View: session overviewtalk overviewside by side with other conferences
09:00  ImmermanFest Opening Remarks SPEAKER: Kousha Etessami 
09:15  27 and still counting: Iterated product, inductive counting, and the structure of P SPEAKER: Eric Allender ABSTRACT. This month marks an important anniversary. It was precisely 3^{3} years ago (July, 1987) that Neil Immerman announced a proof that NL = coNL. This shook the complexitytheoretic universe, triggering the collapse of multiple hierarchies, and spawning a series of aftershocks that still reverberate. This lecture will survey some of these developments, and will also trace the impact of some work of Immerman and Landau, which brought to the fore the central role that is played by iterated multiplication (in different algebras), in elucidating the structure of subclasses of P. 
10:45  Some Reflections on Definability and Complexity SPEAKER: Phokion Kolaitis 
11:45  Crane Beach Revisited SPEAKER: Nicole Schweikardt 
14:00  On the power of fixedpoint logic with counting SPEAKER: Anuj Dawar ABSTRACT. In 1982, Neil Immerman proposed an extension of fixedpoint logic by means of counting quantifiers (which we denote FPC) as a logic that

15:00  Reasoning about transitive closure in Immerman's style SPEAKER: Mooly Sagiv 
16:30  The Variable Hierarchy on Ordered Graphs SPEAKER: Benjamin Rossman 
17:30  Closing Remarks SPEAKER: Neil Immerman 