Abstract is missing.
- A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key ProtocolMichael Backes, Birgit Pfitzmann. 1-12 [doi]
- Constructions of Sparse Asymmetric Connectors: Extended AbstractAndreas Baltz, Gerold Jäger, Anand Srivastav. 13-22 [doi]
- A Separation Logic for Resource Distribution: Extended AbstractNicolas Biri, Didier Galmiche. 23-37 [doi]
- An Equational Theory for TransactionsAndrew P. Black, Vincent Cremet, Rachid Guerraoui, Martin Odersky. 38-49 [doi]
- Axioms for Regular Words: Extended AbstractStephen L. Bloom, Zoltán Ésik. 50-61 [doi]
- 1-Bounded TWA Cannot Be DeterminizedMikolaj Bojanczyk. 62-73 [doi]
- Reachability Analysis of Process Rewrite SystemsAhmed Bouajjani, Tayssir Touili. 74-87 [doi]
- Pushdown Games with Unboundedness and Regular ConditionsAlexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz. 88-99 [doi]
- Real-Time Model-Checking: Parameters EverywhereVéronique Bruyère, Jean-François Raskin. 100-111 [doi]
- The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown AutomataArnaud Carayol, Stefan Wöhrle. 112-123 [doi]
- Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in ExponentsYannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani. 124-135 [doi]
- Subtyping Constraints in Quasi-latticesEmmanuel Coquery, François Fages. 136-148 [doi]
- An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear CaseNikhil R. Devanur, Vijay V. Vazirani. 149-155 [doi]
- Word Equations over Graph ProductsVolker Diekert, Markus Lohrey. 156-167 [doi]
- Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended AbstractDevdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi. 168-182 [doi]
- Comparing Sequences with Segment RearrangementsFunda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp. 183-194 [doi]
- On Logically Defined Recognizable Tree LanguagesZoltán Ésik, Pascal Weil. 195-207 [doi]
- Randomized Time-Space Tradeoffs for Directed Graph ConnectivityParikshit Gopalan, Richard J. Lipton, Aranyak Mehta. 208-216 [doi]
- Distance-Preserving Approximations of Polygonal PathsJoachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid. 217-228 [doi]
- Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular PolyhedraSumanta Guha. 229-243 [doi]
- On the Covering Steiner ProblemAnupam Gupta, Aravind Srinivasan. 244-251 [doi]
- Minimality Results for the Spatial LogicsDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi. 252-264 [doi]
- Algorithms for Non-uniform Size Data Placement on Parallel DisksSrinivas R. Kashyap, Samir Khuller. 265-276 [doi]
- Efficient Algorithms for Abelian Group Isomorphism and Related ProblemsTelikepalli Kavitha. 277-288 [doi]
- Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner TreesJochen Könemann, R. Ravi. 289-301 [doi]
- Model Checking and Satisfiability for Sabotage Modal LogicChristof Löding, Philipp Rohde. 302-313 [doi]
- Merging and Sorting By Strip MovesMeena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar. 314-325 [doi]
- The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size IncreaseSebastian Maneth. 326-337 [doi]
- Distributed GamesSwarup Mohalik, Igor Walukiewicz. 338-351 [doi]
- Maintenance of Multidimensional HistogramsS. Muthukrishnan, Martin Strauss. 352-362 [doi]
- Tagging Makes Secrecy Decidable with Unbounded Nonces as WellRamaswamy Ramanujam, S. P. Suresh. 363-374 [doi]
- Quantum and Classical Complexity Classes: Separations, Collapses, and Closure PropertiesHolger Spakowski, Mayur Thakur, Rahul Tripathi. 375-386 [doi]
- On the Greedy Superstring ConjectureMaik Weinard, Georg Schnitger. 387-398 [doi]
- Reasoning about Infinite State Systems Using Boolean MethodsRandal E. Bryant. 399-407 [doi]
- Stringent RelativizationJin-yi Cai, Osamu Watanabe. 408-419 [doi]
- Component-Based Construction of Deadlock-Free Systems: Extended AbstractGregor Gößler, Joseph Sifakis. 420-433 [doi]
- Moderately Hard Functions: From Complexity to Spam FightingMoni Naor. 434-442 [doi]
- Zigzag Products, Expander Constructions, Connections, and ApplicationsAvi Wigderson. 443 [doi]