Abstract is missing.
- The Multicore RevolutionMaurice Herlihy. 1-8 [doi]
- Streaming Algorithms for Selection and Approximate SortingRichard M. Karp. 9-20 [doi]
- Adventures in Bidirectional ProgrammingBenjamin C. Pierce. 21-22 [doi]
- Program Analysis Using Weighted Pushdown SystemsThomas W. Reps, Akash Lal, Nicholas Kidd. 23-51 [doi]
- The Complexity of Zero KnowledgeSalil P. Vadhan. 52-70 [doi]
- The Priority ::::k::::-Median ProblemAmit Kumar, Yogish Sabharwal. 71-83 [doi]
- Rent-or-Buy Scheduling and Cost Coloring ProblemsTakuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi. 84-95 [doi]
- Order Scheduling Models: Hardness and AlgorithmsNaveen Garg, Amit Kumar, Vinayaka Pandit. 96-107 [doi]
- On Simulatability Soundness and Mapping Soundness of Symbolic CryptographyMichael Backes, Markus Dürmuth, Ralf Küsters. 108-120 [doi]
- Key Substitution in the Symbolic Analysis of Cryptographic ProtocolsYannick Chevalier, Mounira Kourjieh. 121-132 [doi]
- Symbolic Bisimulation for the Applied Pi CalculusStéphanie Delaune, Steve Kremer, Mark Ryan. 133-145 [doi]
- Non-mitotic SetsChristian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang. 146-157 [doi]
- Reductions to Graph IsomorphismJacobo Torán. 158-167 [doi]
- Strong Reductions and Isomorphism of Complete SetsRyan C. Harkins, John M. Hitchcock, Aduri Pavan. 168-178 [doi]
- Probabilistic and Topological Semantics for Timed AutomataChristel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer. 179-191 [doi]
- A Theory for Game TheoriesMichel Hirschowitz, André Hirschowitz, Tom Hirschowitz. 192-203 [doi]
- An Incremental Bisimulation AlgorithmDiptikalyan Saha. 204-215 [doi]
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel GraphsAndreas Jakoby, Till Tantau. 216-227 [doi]
- Communication Lower Bounds Via the Chromatic NumberRavi Kumar, D. Sivakumar. 228-240 [doi]
- The Deduction Theorem for Strong Propositional Proof SystemsOlaf Beyersdorff. 241-252 [doi]
- Satisfiability of Algebraic Circuits over Sets of Natural NumbersChristian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr. 253-264 [doi]
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel SystemsPierre Chambart, Ph. Schnoebelen. 265-276 [doi]
- Synthesis of Safe Message-Passing SystemsNicolas Baudru, Rémi Morin. 277-289 [doi]
- Automata and Logics for Timed Message Sequence ChartsS. Akshay, Benedikt Bollig, Paul Gastin. 290-302 [doi]
- Propositional Dynamic Logic for Message-Passing SystemsBenedikt Bollig, Dietrich Kuske, Ingmar Meinecke. 303-315 [doi]
- Better Algorithms and Bounds for Directed Maximum Leaf ProblemsNoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh. 316-327 [doi]
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted GraphsTelikepalli Kavitha. 328-339 [doi]
- Covering Graphs with Few Complete Bipartite SubgraphsHerbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider. 340-351 [doi]
- Safely Composing Security ProtocolsVéronique Cortier, Jérémie Delaitre, Stéphanie Delaune. 352-363 [doi]
- Computationally Sound Typing for Non-interference: The Case of Deterministic EncryptionJudicaël Courant, Cristian Ene, Yassine Lakhnech. 364-375 [doi]
- Bounding Messages for Free in Security ProtocolsMyrto Arapinis, Marie Duflot. 376-387 [doi]
- Triangulations of Line Segment Sets in the PlaneMathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt. 388-399 [doi]
- Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal ProjectionsTherese C. Biedl, Masud Hasan, Alejandro López-Ortiz. 400-411 [doi]
- Finding a Rectilinear Shortest Path in R:::2::: Using Corridor Based Staircase StructuresR. Inkulu, Sanjiv Kapoor. 412-423 [doi]
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and SpaceJesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. 424-435 [doi]
- Stochastic Müller Games are PSPACE-CompleteKrishnendu Chatterjee. 436-448 [doi]
- Solving Parity Games in Big StepsSven Schewe. 449-460 [doi]
- Efficient and Expressive Tree FiltersMichael Benedikt, Alan Jeffrey. 461-472 [doi]
- Markov Decision Processes with Multiple Long-Run Average ObjectivesKrishnendu Chatterjee. 473-484 [doi]
- A Formal Investigation ofSanjeev Khanna, Keshav Kunal, Benjamin C. Pierce. 485-496 [doi]
- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree ProblemAnand Srivastav, Sören Werth. 497-507 [doi]
- Undirected Graphs of Entanglement 2Walid Belkhir, Luigi Santocanale. 508-519 [doi]
- Acceleration in Convex Data-Flow AnalysisJérôme Leroux, Grégoire Sutre. 520-531 [doi]
- Model Checking Almost All Paths Can Be Less Expensive Than Checking All PathsMatthias Schmalz, Hagen Völzer, Daniele Varacca. 532-543 [doi]
- Closures and Modules Within Linear Logic Concurrent Constraint ProgrammingRémy Haemmerlé, François Fages, Sylvain Soliman. 544-556 [doi]