Table of Contents

• Molecular Assembly and Computation: From Theory to Experimental DemonstrationsJohn H. Reif. 1-21 [doi]
• Towards a Predictive Computational Complexity TheoryMadhav V. Marathe. 22-31 [doi]
• Equivariant Syntax and SemanticsAndrew M. Pitts. 32-36 [doi]
• L(A) = L(B)? Decidability Results from Complete Formal SystemsGéraud Sénizergues. 37 [doi]
• Discrete Tomography: Reconstruction under Periodicity ConstraintsAlberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon. 38-56 [doi]
• Local and Global Methods in Data Mining: Basic Techniques and Open ProblemsHeikki Mannila. 57-68 [doi]
• Program Debugging and Validation Using Semantic Approximations and Partial SpecificationsManuel V. Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García. 69-72 [doi]
• Inapproximability Results for Equations over Finite GroupsLars Engebretsen, Jonas Holmerin, Alexander Russell. 73-84 [doi]
• A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse GraphsSeth Pettie. 85-97 [doi]
• On Families of Graphs Having a Decidable First Order Theory with ReachabilityThomas Colcombet. 98-109 [doi]
• Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the InternetAlex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou. 110-122 [doi]
• The Structure and Complexity of Nash Equilibria for a Selfish Routing GameDimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis. 123-134 [doi]
• Control Message Aggregation in Group Communication ProtocolsSanjeev Khanna, Joseph Naor, Danny Raz. 135-146 [doi]
• Church-Rosser Languages vs. UCFLTomasz Jurdzinski, Krzysztof Lorys. 147-158 [doi]
• Intersection of Regular Languages and Star HierarchySebastian Bala. 159-169 [doi]
• On the Construction of Reversible Automata for Reversible LanguagesSylvain Lombardy. 170-182 [doi]
• Priority Queues, Pairing, and Adaptive SortingAmr Elmasry. 183-194 [doi]
• Exponential Structures for Efficient Cache-Oblivious AlgorithmsMichael A. Bender, Richard Cole, Rajeev Raman. 195-207 [doi]
• Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz RefutationsRussell Impagliazzo, Nathan Segerlind. 208-219 [doi]
• On the Complexity of Resolution with Bounded ConjunctionsJuan Luis Esteban, Nicola Galesi, Jochen Messner. 220-231 [doi]
• Cryptographic Hardness Based on the Decoding of Reed-Solomon CodesAggelos Kiayias, Moti Yung. 232-243 [doi]
• Perfect Constant-Round Secure Computation via Perfect Randomizing PolynomialsYuval Ishai, Eyal Kushilevitz. 244-256 [doi]
• Exponential Lower Bound for Static Semi-algebraic ProofsDima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik. 257-268 [doi]
• Paths Problems in Symmetric Logarithmic SpaceAndreas Jakoby, Maciej Liskiewicz. 269-280 [doi]
• Scheduling Search ProceduresPeter Damaschke. 281-292 [doi]
• Removable Online Knapsack ProblemsKazuo Iwama, Shiro Taketomi. 293-305 [doi]
• New Bounds for Variable-Sized and Resource Augmented Online Bin PackingLeah Epstein, Steven S. Seiden, Rob van Stee. 306-317 [doi]
• The Quest for Small Universal Cellular AutomataNicolas Ollinger. 318-329 [doi]
• Hyperbolic Recognition by Graph AutomataChristophe Papazian, Eric Rémila. 330-342 [doi]
• Quantum and Stochastic Branching Programs of Bounded WidthFarid M. Ablayev, Cristopher Moore, Chris Pollett. 343-354 [doi]
• Spanning Trees with Bounded Number of Branch VerticesLuisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro. 355-365 [doi]
• Energy Optimal Routing in Radio Networks Using Geometric Data StructuresRené Beier, Peter Sanders, Naveen Sivadasan. 366-376 [doi]
• Gossiping with Bounded Size Messages in ad hoc Radio NetworksMalin Christersson, Leszek Gasieniec, Andrzej Lingas. 377-389 [doi]
• The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting SubsequencesWolfgang Merkle. 390-400 [doi]
• The Nondeterministic Constraint Logic Model of Computation: Reductions and ApplicationsRobert A. Hearn, Erik D. Demaine. 401-413 [doi]
• Constraint Satisfaction Problems in Non-deterministic Logarithmic SpaceVíctor Dalmau. 414-425 [doi]
• Cache Oblivious Distribution SweepingGerth Stølting Brodal, Rolf Fagerberg. 426-438 [doi]
• One-Probe SearchAnna Östlin, Rasmus Pagh. 439-450 [doi]
• New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related ProblemsMoses Charikar, Piotr Indyk, Rina Panigrahy. 451-462 [doi]
• Measuring the Probabilistic PowerdomainKeye Martin, Michael W. Mislove, James Worrell. 463-475 [doi]
• Games Characterizing Levy-Longo TreesC.-H. Luke Ong, Pietro Di Gianantonio. 476-487 [doi]
• Comparing Functional Paradigms for Exact Real-Number ComputationAndrej Bauer, Martín Hötzel Escardó, Alex K. Simpson. 488-500 [doi]
• Random Sampling from Boltzmann PrinciplesPhilippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer. 501-513 [doi]
• On the Average Performance of Orthogonal Range Search in Multidimensional Data StructuresAmalia Duch, Conrado Martinez. 514-524 [doi]
• Bialgebraic Modelling of Timed ProcessesMarco Kick. 525-536 [doi]
• Testing Labelled Markov ProcessesFranck van Breugel, Steven Shalit, James Worrell. 537-548 [doi]
• Why Computational Complexity Requires Stricter MartingalesJohn M. Hitchcock, Jack H. Lutz. 549-560 [doi]
• Correspondence Principles for Effective DimensionsJohn M. Hitchcock. 561-571 [doi]
• A Total Approach to Partial Algebraic SpecificationJosé Meseguer, Grigore Rosu. 572-584 [doi]
• Axiomatising DivergenceMarkus Lohrey, Pedro R. D Argenio, Holger Hermanns. 585-596 [doi]
• A Spatial Logic for Querying GraphsLuca Cardelli, Philippa Gardner, Giorgio Ghelli. 597-610 [doi]
• Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the NetworkTomasz Radzik. 611-622 [doi]
• Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTIONPiotr Berman, Marek Karpinski. 623-632 [doi]
• Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest PathsCamil Demetrescu, Giuseppe F. Italiano. 633-643 [doi]
• Synthesis of Uninitialized SystemsThomas A. Henzinger, Sriram C. Krishnan, Orna Kupferman, Freddy Y. C. Mang. 644-656 [doi]
• Infinite-State High-Level MSCs: Model-Checking and RealizabilityBlaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun. 657-668 [doi]
• Universal Inherence of Cycle-Free Context-Free Ambiguity FunctionsKlaus Wich. 669-680 [doi]
• Histogramming Data Streams with Fast Per-Item ProcessingSudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss. 681-692 [doi]
• Finding Frequent Items in Data StreamsMoses Charikar, Kevin Chen, Martin Farach-Colton. 693-703 [doi]
• Symbolic Strategy Synthesis for Games on Pushdown GraphsThierry Cachat. 704-715 [doi]
• Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-HardJirí Srba. 716-727 [doi]
• Solving the String Statistics Problem in Time O(n log n)Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen. 728-739 [doi]
• A PTAS for Distinguishing (Sub)string SelectionXiaotie Deng, Guojun Li, Zimao Li, Bin Ma, Lusheng Wang. 740-751 [doi]
• On the Theory of One-Step Rewriting in Trace MonoidsDietrich Kuske, Markus Lohrey. 752-763 [doi]
• Navigating with a BrowserMichal Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche. 764-775 [doi]
• Improved Results for Stackelberg Scheduling StrategiesV. S. Anil Kumar, Madhav V. Marathe. 776-787 [doi]
• Call Control in RingsUdo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach. 788-799 [doi]
• Preemptive Scheduling in Overloaded SystemsMarek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania. 800-811 [doi]
• The Equivalence Problem of Finite Substitutions on ab:::*:::c, with ApplicationsJuhani Karhumäki, Leonid P. Lisovik. 812-820 [doi]
• Deciding DPDA Equivalence Is Primitive RecursiveColin Stirling. 821-832 [doi]
• Two-Way Alternating Automata and Finite ModelsMikolaj Bojanczyk. 833-844 [doi]
• Approximating Huffman Codes in ParallelPiotr Berman, Marek Karpinski, Yakov Nekrich. 845-855 [doi]
• Seamless Integration of Parallelism and Memory HierarchyCarlo Fantozzi, Andrea Pietracaprina, Geppino Pucci. 856-867 [doi]
• The Communication Complexity of Approximate Set Packing and CoveringNoam Nisan. 868-875 [doi]
• Antirandomizing the Wrong GameBenjamin Doerr. 876-887 [doi]
• Fast Universalization of Investment Strategies with Provably Good Relative ReturnsKarhan Akcoglu, Petros Drineas, Ming-Yang Kao. 888-900 [doi]
• Randomized Pursuit-Evasion in GraphsMicah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking. 901-912 [doi]
• The Essence of Principal TypingsJ. B. Wells. 913-925 [doi]
• Complete and Tractable Local Linear Time Temporal Logics over TracesBharat Adsul, Milind A. Sohoni. 926-937 [doi]
• An Elementary Expressively Complete Temporal Logic for Mazurkiewicz TracesPaul Gastin, Madhavan Mukund. 938-949 [doi]
• Random Numbers and an Incomplete Immune Recursive SetVasco Brattka. 950-961 [doi]
• A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real NumbersPeter Hertling. 962-972 [doi]
• Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design ProblemArtur Czumaj, Andrzej Lingas, Hairong Zhao. 973-984 [doi]
• Finding a Path of Superlogarithmic LengthAndreas Björklund, Thore Husfeldt. 985-992 [doi]
• Linear Time Algorithms on Chordal Bipartite and Strongly Chordal GraphsRyuhei Uehara. 993-1004 [doi]
• Improved Inapproximability Results for Vertex Cover on k -Uniform HypergraphsJonas Holmerin. 1005-1016 [doi]
• Efficient Testing of HypergraphsYoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl. 1017-1028 [doi]
• Optimal Net Surface Problems with ApplicationsXiaodong Wu, Danny Z. Chen. 1029-1042 [doi]
• Wagner s Theorem on RealizersNicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah. 1043-1053 [doi]
• Circular ArrangementsVincenzo Liberatore. 1054-1066 [doi]