Abstract is missing.
- Primality Testing with Gaussian PeriodsHendrik W. Lenstra Jr.. 1 [doi]
- From Hilbert Spaces to Dilbert Spaces: Context Semantics Made SimpleHarry G. Mairson. 2-17 [doi]
- Encoding Generic JudgmentsDale Miller, Alwen Fernanto Tiu. 18-32 [doi]
- Model Checking Algol-Like Languages Using Game SemanticsC.-H. Luke Ong. 33-36 [doi]
- Modeling Software: From Theory to PracticeMargus Veanes. 37-46 [doi]
- Local Normal Forms for Logics over TracesBharat Adsul, Milind A. Sohoni. 47-58 [doi]
- On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle InequalityHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. 59-70 [doi]
- Communication Interference in Mobile Boxed AmbientsMichele Bugliesi, Silvia Crafa, Massimo Merro, Vladimiro Sassone. 71-84 [doi]
- The Seal Calculus Revisited: Contextual Equivalence and BisimilarityGiuseppe Castagna, Francesco Zappa Nardelli. 85-96 [doi]
- Composing Strand SpacesFederico Crazzolara, Glynn Winskel. 97-108 [doi]
- Generalising Automaticity to Modal Properties of Finite StructuresAnuj Dawar, Stephan Kreutzer. 109-120 [doi]
- An Automata-Theoretic Approach to Constraint LTLStéphane Demri, Deepak D Souza. 121-132 [doi]
- Hardness Results for Multicast Cost SharingJoan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker. 133-144 [doi]
- How to Compose Presburger-Accelerations: Applications to Broadcast ProtocolsAlain Finkel, Jérôme Leroux. 145-156 [doi]
- State Space Reductions for Alternating Büchi AutomataCarsten Fritz, Thomas Wilke. 157-168 [doi]
- Algorithmic Combinatorics Based on Slicing PosetsVijay K. Garg. 169-181 [doi]
- Pattern Matching for Arc-Annotated SequencesJens Gramm, Jiong Guo, Rolf Niedermeier. 182-193 [doi]
- Knowledge over Dense Flows of Time (from a Hybrid Point of View)Bernhard Heinemann. 194-205 [doi]
- The Complexity of the InertiaThanh Minh Hoang, Thomas Thierauf. 206-217 [doi]
- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit VersionRahul Jain, Jaikumar Radhakrishnan, Pranab Sen. 218-229 [doi]
- The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary SignaturesKonstantin Korovin, Andrei Voronkov. 230-240 [doi]
- Deciding the First Level of the µ-Calculus Alternation HierarchyRalf Küsters, Thomas Wilke. 241-252 [doi]
- Dynamic Message Sequence ChartsMartin Leucker, P. Madhusudan, Supratik Mukhopadhyay. 253-264 [doi]
- The Complexity of Compositions of Deterministic Tree TransducersSebastian Maneth. 265-276 [doi]
- On the Hardness of Approximating Minimum Monopoly ProblemsS. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian. 277-288 [doi]
- Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled SystemsMadhavan Mukund. 289-300 [doi]
- Lower Bounds for Embedding Graphs into Graphs of Smaller CharacteristicK. V. M. Naidu, H. Ramesh. 301-310 [doi]
- Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi DecompositionsYogish Sabharwal, Nishant Sharma, Sandeep Sen. 311-323 [doi]
- Formal Languages and Algorithms for Similarity Based Retrieval from Sequence DatabasesA. Prasad Sistla. 324-335 [doi]
- Decomposition in Asynchronous Circuit DesignWalter Vogler, Ralf Wollowski. 336-347 [doi]
- Queue Layouts, Tree-Width, and Three-Dimensional Graph DrawingDavid R. Wood. 348-359 [doi]