• Publications
  • Influence
The Complexity of Decentralized Control of Markov Decision Processes
TLDR
This work considers decentralized control of Markov decision processes and gives complexity bounds on the worst-case running time for algorithms that find optimal solutions and describes generalizations that allow for decentralized control. Expand
Efficient pattern matching over event streams
TLDR
This paper presents a formal evaluation model that offers precise semantics for this new class of queries and a query evaluation framework permitting optimizations in a principled way and further analyzes the runtime complexity of query evaluation using this model and develops a suite of techniques that improve runtime efficiency by exploiting sharing in storage and processing. Expand
Descriptive Complexity
  • N. Immerman
  • Computer Science
  • Graduate Texts in Computer Science
  • 1999
TLDR
The core of the book is contained in Chapters 1 through 7, although even here some sections can be omitted according to the taste and interests of the instructor, and the remaining chapters are more independent of each other. Expand
Relational Queries Computable in Polynomial Time
  • N. Immerman
  • Computer Science, Mathematics
  • Inf. Control.
  • 1 March 1986
The rotary ball valve includes a generally annular seal which is held in place by an edge anchored annular retainer. The retainer is oversized for the valve housing and on installation resides in aExpand
On Uniformity within NC¹
TLDR
It is shown that Immerman's families of circuits defined by first-order formulas and a uniformity corresponding to Buss' deterministic log-time reductions are equivalent, leading to a natural notion of uniformity for low-level circuit complexity classes. Expand
An optimal lower bound on the number of variables for graph identification
TLDR
It is shown that Ω(n) variables are needed for first-order logic with counting to identify graphs onn vertices, equivalent to the (k−1)-dimensional Weisfeiler-Lehman method, and the lower bound is optimal up to multiplication by a constant. Expand
An optimal lower bound on the number of variables for graph identification
TLDR
It is shown that Omega (n) variables are needed for first-order logic with counting to identify graphs on n vertices and the lower bound is optimal up to multiplication by a constant. Expand
Languages that Capture Complexity Classes
  • N. Immerman
  • Computer Science
  • SIAM J. Comput.
  • 1 August 1987
TLDR
It is shown that projection translations are a uniform version of Valiant’s projections, and that the usual complete problems remain complete via these very restrictive reductions. Expand
Nondeterministic Space is Closed Under Complementation
  • N. Immerman
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 October 1988
TLDR
It immediately follows that the context-sensitive languages are closed under complementation, thus settling a question raised by Kuroda. Expand
Upper and lower bounds for first order expressibility
  • N. Immerman
  • Computer Science, Mathematics
  • 21st Annual Symposium on Foundations of Computer…
  • 1 August 1982
TLDR
An "alternating pebbling game" is introduced to prove lower bounds on the number of variables and size needed to express properties without successor. Expand
...
1
2
3
4
5
...