23. ICALP 1996: Paderborn, Germany
Alexander A. Razborov
: Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic.
Fairness, Domination, and the µ-Calculus
: Characterizing Fairness Implementability for Multiparty Interaction.
: Termination of Context-Sensitive Rewriting by Rewriting.
: Fatal Errors in Conditional Expressions (Extended Abstract).
: On Infinite Transition Graphs Having a Decidable Monadic Theory.
Leonid P. Lisovik
: Hard Sets Method and Semilinear Reservoir Method with Applications.
: The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus.
: Fixpoints for Rabin Tree Automata Make Complementation Easy.
: Recognizing Regular Expressions by Means of Dataflow Networks.
Peter Bro Miltersen
: Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication.