Abstract is missing.
- Genome Halving Problem RevisitedMax A. Alekseyev, Pavel A. Pevzner. 1-15 [doi]
- Verifying Probabilistic Procedural ProgramsJavier Esparza, Kousha Etessami. 16-31 [doi]
- Streaming Algorithms for Geometric ProblemsPiotr Indyk. 32-34 [doi]
- Toward a Grainless Semantics for Shared-Variable ConcurrencyJohn C. Reynolds. 35-48 [doi]
- Regular Languages, Unambiguous Concatenation and Computational ComplexityDenis Thérien. 49-57 [doi]
- Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri NetsParosh Aziz Abdulla, Pritha Mahata, Richard Mayr. 58-70 [doi]
- On the Urgency ExpressivenessMichaël Adélaïde, Claire Pagetti. 71-83 [doi]
- Asynchronous Automata-Theoretic Characterization of Aperiodic Trace LanguagesBharat Adsul, Milind A. Sohoni. 84-96 [doi]
- A Decidable Fragment of Separation LogicJosh Berdine, Cristiano Calcagno, Peter W. O Hearn. 97-109 [doi]
- Approximate Range Searching Using Binary Space PartitionsMark de Berg, Micha Streppel. 110-121 [doi]
- Representable Disjoint NP-PairsOlaf Beyersdorff. 122-134 [doi]
- Symbolic Reachability Analysis of Higher-Order Context-Free ProcessesAhmed Bouajjani, Antoine Meyer. 135-147 [doi]
- Optimal Strategies in Priced Timed Game AutomataPatricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen. 148-160 [doi]
- A Calculus for Trust ManagementMarco Carbone, Mogens Nielsen, Vladimiro Sassone. 161-173 [doi]
- Short-Cuts on Star, Source and Planar UnfoldingsVijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar. 174-185 [doi]
- Subdividing Alpha ComplexHo-Lun Cheng, Tony Tan. 186-197 [doi]
- Real-Counter Automata and Their Decision ProblemsZhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie. 198-210 [doi]
- Adjunct Elimination Through Games in Static Ambient LogicAnuj Dawar, Philippa Gardner, Giorgio Ghelli. 211-223 [doi]
- On the Bisimulation Invariant Fragment of Monadic S1 in the FiniteAnuj Dawar, David Janin. 224-236 [doi]
- On the Complexity of Hilbert s 17th ProblemNikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi. 237-249 [doi]
- Who is Pointing When to Whom?Dino Distefano, Joost-Pieter Katoen, Arend Rensink. 250-262 [doi]
- An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) MatrixMartin Fürer, Shiva Prasad Kasiviswanathan. 263-274 [doi]
- Distributed Games with Causal Memory Are Decidable for Series-Parallel SystemsPaul Gastin, Benjamin Lerman, Marc Zeitoun. 275-286 [doi]
- Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTSGilles Geeraerts, Jean-François Raskin, Laurent Van Begin. 287-298 [doi]
- Minimum Weight Pseudo-TriangulationsJoachim Gudmundsson, Christos Levcopoulos. 299-310 [doi]
- Join Algorithms for the Theory of Uninterpreted FunctionsSumit Gulwani, Ashish Tiwari, George C. Necula. 311-323 [doi]
- No, Coreset, No CrySariel Har-Peled. 324-335 [doi]
- Hardness Hypotheses, Derandomization, and Circuit ComplexityJohn M. Hitchcock, Aduri Pavan. 336-347 [doi]
- Improved Approximation Algorithms for Maximum Graph Partitioning ProblemsGerold Jäger, Anand Srivastav. 348-359 [doi]
- Learning Languages from Positive Data and a Finite Number of QueriesSanjay Jain, Efim B. Kinber. 360-371 [doi]
- The Complexity of the Local Hamiltonian ProblemJulia Kempe, Alexei Kitaev, Oded Regev. 372-383 [doi]
- Quantum and Classical Communication-Space Tradeoffs from Rectangle BoundsHartmut Klauck. 384-395 [doi]
- Adaptive Stabilization of Reactive ProtocolsShay Kutten, Boaz Patt-Shamir. 396-407 [doi]
- Visibly Pushdown GamesChristof Löding, P. Madhusudan, Olivier Serre. 408-420 [doi]
- Refinement and Separation ContextsIvana Mijajlovic, Noah Torp-Smith, Peter W. O Hearn. 421-433 [doi]
- Decidability of MSO Theories of Tree StructuresAngelo Montanari, Gabriele Puppis. 434-446 [doi]
- Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc NetworksSrinivasan Parthasarathy 0002, Rajiv Gandhi. 447-459 [doi]
- Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential SizeAshok Kumar Ponnuswami, H. Venkateswaran. 460-468 [doi]
- Testing Geometric ConvexityLuis Rademacher, Santosh Vempala. 469-480 [doi]
- Complexity of Linear Connectivity Problems in Directed HypergraphsMayur Thakur, Rahul Tripathi. 481-493 [doi]
- Actively Learning to Verify Safety for FIFO AutomataAbhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gul Agha. 494-505 [doi]
- Reasoning About Game Equilibria Using Temporal LogicG. Venkatesh. 506-517 [doi]
- Alternation in Equational Tree Automata Modulo XORKumar Neeraj Verma. 518-530 [doi]