Front matter
1
Primality Testing with Gaussian Periods
H. W. Lenstra
2-17
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple
Harry G. Mairson
18-32
Encoding Generic Judgments
Dale Miller and Alwen Tiu
33-36
Model Checking Algol-Like Languages Using Game Semantics
C. -H. L. Ong
37-46
Modeling Software: From Theory to Practice
Margus Veanes
47-58
Local Normal Forms for Logics over Traces
Bharat Adsul and Milind Sohoni
59-70
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality
Extended Abstract
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovič, Ralf Klasing and Guido Proietti, et al.
71-84
Communication Interference in Mobile Boxed Ambients
Michele Bugliesi, Silvia Crafa, Massimo Merro and Vladimiro Sassone
85-96
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity
Giuseppe Castagna and Francesco Zappa Nardelli
97-108
Composing Strand Spaces
Federico Crazzolara and Glynn Winskel
109-120
Generalising Automaticity to Modal Properties of Finite Structures
A. Dawar and S. Kreutzer
121-132
An Automata-Theoretic Approach to Constraint LTL
Stéphane Demri and Deepak D’souza
133-144
Hardness Results for Multicast Cost Sharing
Extended Abstract
Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami and Scott Shenker
145-156
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
Alain Finkel and Jérôme Leroux
157-168
State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences
Carsten Fritz and Thomas Wilke
169-181
Algorithmic Combinatorics Based on Slicing Posets
Vijay K. Garg
182-193
Pattern Matching for Arc-Annotated Sequences
Jens Gramm, Jiong Guo and Rolf Niedermeier
194-205
Knowledge over Dense Flows of Time (from a Hybrid Point of View)
Bernhard Heinemann
206-217
The Complexity of the Inertia
Thanh Minh Hoang and Thomas Thierauf
218-229
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
Rahul Jain, Jaikumar Radhakrishnan and Pranab Sen
230-240
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
Konstantin Korovin and Andrei Voronkov
241-252
Deciding the First Level of the μ-Calculus Alternation Hierarchy
Ralf Küsters and Thomas Wilke
253-264
Dynamic Message Sequence Charts
Martin Leucker, P. Madhusudan and Supratik Mukhopadhyay
265-276
The Complexity of Compositions of Deterministic Tree Transducers
Sebastian Maneth
277-288
On the Hardness of Approximating Minimum Monopoly Problems
S. Mishra, Jaikumar Radhakrishnan and S. Sivasubramanian
289-300
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
Madhavan Mukund
301-310
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
K. V. M. Naidu and H. Ramesh
311-323
Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions
Yogish Sabharwal, Nishant Sharma and Sandeep Sen
324-335
Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases
A. Prasad Sistla
336-347
Decomposition in Asynchronous Circuit Design
Walter Vogler and Ralf Wollowski
348-359
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
David R. Wood
Back matter