Abstract is missing.
- Self-Adjusting ComputationRobert Harper. 1-2 [doi]
- The Past, Present, and Future of Web Search Engines pMonika Rauch Henzinger. 3 [doi]
- What Do Program Logics and Type Systems Have in Common?Martin Hofmann. 4-7 [doi]
- Feasible Proofs and Computations: Partnership and FusionAlexander A. Razborov. 8-14 [doi]
- Grammar Compression, LZ-Encodings, and String Algorithms with Implicit InputWojciech Rytter. 15-27 [doi]
- Testing, Optimizaton, and GamesMihalis Yannakakis. 28-45 [doi]
- Deciding Knowledge in Security Protocols Under Equational TheoriesMartín Abadi, Véronique Cortier. 46-58 [doi]
- Representing Nested Inductive Types Using W-TypesMichael Abbott, Thorsten Altenkirch, Neil Ghani. 59-71 [doi]
- Algorithms for Multi-product PricingGagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu. 72-83 [doi]
- Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable FormulasMichael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson. 84-96 [doi]
- Linear and Branching Metrics for Quantitative Transition SystemsLuca de Alfaro, Marco Faella, Mariëlle Stoelinga. 97-109 [doi]
- Learning a Hidden SubgraphNoga Alon, Vera Asodi. 110-121 [doi]
- Optimal Reachability for Weighted Timed GamesRajeev Alur, Mikhail Bernadsky, P. Madhusudan. 122-133 [doi]
- Wavelength Assignment in Optical Networks with Fixed Fiber CapacityMatthew Andrews, Lisa Zhang. 134-145 [doi]
- External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse GraphsLars Arge, Ulrich Meyer, Laura Toma. 146-157 [doi]
- A lambda-Calculus for Resource SeparationRobert Atkey. 158-170 [doi]
- The Power of Verification for One-Parameter AgentsVincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano. 171-182 [doi]
- Group Spreading: A Protocol for Provably Secure Distributed Name ServiceBaruch Awerbuch, Christian Scheideler. 183-195 [doi]
- Further Improvements in Competitive Guarantees for QoS BufferingNikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko. 196-207 [doi]
- Competition-Induced Preferential AttachmentNoam Berger, Christian Borgs, Jennifer T. Chayes, R. M. D Souza, Robert D. Kleinberg. 208-221 [doi]
- Approximating Longest Directed Paths and CyclesAndreas Björklund, Thore Husfeldt, Sanjeev Khanna. 222-233 [doi]
- Definitions and Bounds for Self-Healing Key Distribution SchemesCarlo Blundo, Paolo D Arco, Alfredo De Santis. 234-245 [doi]
- Tree-Walking Automata Cannot Be DeterminizedMikolaj Bojanczyk, Thomas Colcombet. 246-256 [doi]
- Projecting Games on HypercoherencesPierre Boudes. 257-268 [doi]
- An Analog Characterization of Elementarily Computable Functions over the Real NumbersOlivier Bournez, Emmanuel Hainry. 269-280 [doi]
- Model Checking with Multi-valued LogicsGlenn Bruns, Patrice Godefroid. 281-293 [doi]
- The Complexity of Partition FunctionsAndrei A. Bulatov, Martin Grohe. 294-306 [doi]
- Comparing Recursion, Replication, and Iteration in Process CalculiNadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro. 307-319 [doi]
- Dynamic Price Sequence and Incentive Compatibility (Extended Abstract)Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao. 320-331 [doi]
- The Complexity of Equivariant UnificationJames Cheney. 332-344 [doi]
- Coordination MechanismsGeorge Christodoulou, Elias Koutsoupias, Akash Nanavati. 345-357 [doi]
- Online Scheduling of Equal-Length Jobs: Randomization and Restarts HelpMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý. 358-370 [doi]
- Efficient Computation of Equilibrium Prices for Markets with Leontief UtilitiesBruno Codenotti, Kasturi R. Varadarajan. 371-382 [doi]
- Coloring Semirandom Graphs OptimallyAmin Coja-Oghlan. 383-395 [doi]
- Sublinear-Time Approximation for Clustering Via Random SamplingArtur Czumaj, Christian Sohler. 396-407 [doi]
- Solving Two-Variable Word Equations (Extended Abstract)Robert Dabrowski, Wojciech Plandowski. 408-419 [doi]
- Backtracking Games and Inflationary Fixed PointsAnuj Dawar, Erich Grädel, Stephan Kreutzer. 420-432 [doi]
- A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract)Xiaotie Deng, Guojun Li. 433-444 [doi]
- Towards an Algebraic Theory of Typed Mobile ProcessesYuxin Deng, Davide Sangiorgi. 445-456 [doi]
- Ecological Turing MachinesBruno Durand, Andrei A. Muchnik, Maxim Ushakov, Nikolai K. Vereshchagin. 457-468 [doi]
- Locally Consistent Constraint Satisfaction Problems: (Extended Abstract)Zdenek Dvorak, Daniel Král, Ondrej Pangrác. 469-480 [doi]
- Quantum Query Complexity of Some Graph ProblemsChristoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla. 481-493 [doi]
- A Domain Theoretic Account of Picard s TheoremAbbas Edalat, Dirk Pattinson. 494-505 [doi]
- Interactive Observability in LudicsClaudia Faggian. 506-518 [doi]
- Easily Refutable Subformulas of Large Random 3CNF FormulasUriel Feige, Eran Ofek. 519-530 [doi]
- On Graph Problems in a Semi-streaming ModelJoan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. 531-543 [doi]
- Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source NetworksLisa Fleischer. 544-554 [doi]
- Bounded Fixed-Parameter Tractability and log:::2:::n Nondeterministic BitsJörg Flum, Martin Grohe, Mark Weyer. 555-567 [doi]
- Exact (Exponential) Algorithms for Treewidth and Minimum Fill-InFedor V. Fomin, Dieter Kratsch, Ioan Todinca. 568-580 [doi]
- Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-UpFedor V. Fomin, Dimitrios M. Thilikos. 581-592 [doi]
- Selfish Unsplittable FlowsDimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. 593-605 [doi]
- A General Technique for Managing Strings in Comparison-Driven Data StructuresGianni Franceschini, Roberto Grossi. 606-617 [doi]
- Greedy Regular Expression MatchingAlain Frisch, Luca Cardelli. 618-629 [doi]
- A 2:::O(n:::1-(1/d):::log n)::: Time Algorithm for d-Dimensional Protein Folding in the HP-ModelBin Fu, Wei Wang. 630-644 [doi]
- Nash Equilibria in Discrete Routing Games with Convex Latency FunctionsMartin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode. 645-657 [doi]
- Improved Results for Data Migration and Open Shop SchedulingRajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. 658-669 [doi]
- Deterministic M2M Multicast in Radio Networks: (Extended Abstract)Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin. 670-682 [doi]
- Syntactic Control of ConcurrencyDan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong. 683-694 [doi]
- Linear-Time List Decoding in Error-Free Settings: (Extended Abstract)Venkatesan Guruswami, Piotr Indyk. 695-707 [doi]
- A Categorical Model for the Geometry of InteractionEsfandiar Haghverdi, Philip J. Scott. 708-720 [doi]
- Testing Monotonicity over Graph ProductsShirley Halevy, Eyal Kushilevitz. 721-732 [doi]
- The Minimum-Entropy Set Cover ProblemEran Halperin, Richard M. Karp. 733-744 [doi]
- Communication Versus ComputationPrahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh. 745-756 [doi]
- Optimal Website Design with the Constrained Subtree Selection ProblemBrent Heeringa, Micah Adler. 757-769 [doi]
- Simple Permutations Mix WellShlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff. 770-781 [doi]
- Closest Pair Problems in Very High DimensionsPiotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat. 782-792 [doi]
- Universality in Quantum ComputationEmmanuel Jeandel. 793-804 [doi]
- Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network DesignRaja Jothi, Balaji Raghavachari. 805-818 [doi]
- Fairness to All While DownsizingBala Kalyanasundaram, Mahendran Velauthapillai. 819-830 [doi]
- A Generalisation of Pre-logical Predicates to Simply Typed Formal SystemsShin-ya Katsumata. 831-845 [doi]
- A Faster Algorithm for Minimum Cycle Basis of GraphsTelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. 846-857 [doi]
- The Black-Box Complexity of Nearest Neighbor SearchRobert Krauthgamer, James R. Lee. 858-869 [doi]
- Regular Solutions of Language Inequalities and Well Quasi-ordersMichal Kunc. 870-881 [doi]
- A Calculus of CoroutinesJames Laird. 882-893 [doi]
- Almost Optimal Decentralized Routing in Long-Range Contact NetworksEmmanuelle Lebhar, Nicolas Schabanel. 894-905 [doi]
- Word Problems on Compressed WordsMarkus Lohrey. 906-918 [doi]
- Complexity of Pseudoknot Prediction in Simple ModelsRune B. Lyngsø. 919-931 [doi]
- Property Testing of Regular Tree LanguagesFrédéric Magniez, Michel de Rougemont. 932-944 [doi]
- Entropy as a Fixed PointKeye Martin. 945-958 [doi]
- Transparent Long Proofs: A First PCP Theorem for NP::R::Klaus Meer. 959-970 [doi]
- A Time Lower Bound for SatisfiabilityDieter van Melkebeek, Ran Raz. 971-982 [doi]
- Some Results on Effective RandomnessWolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman. 983-995 [doi]
- A Polynomial Quantum Query Lower Bound for the Set Equality ProblemGatis Midrijanis. 996-1005 [doi]
- Succinct Representations of FunctionsJ. Ian Munro, S. Srinivasa Rao. 1006-1015 [doi]
- A Note on Karr s AlgorithmMarkus Müller-Olm, Helmut Seidl. 1016-1028 [doi]
- The Existence and Efficient Construction of Large Independent Sets in General Random Intersection GraphsSotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. 1029-1040 [doi]
- Efficient Consistency Proofs for Generalized Queries on a Committed DatabaseRafail Ostrovsky, Charles Rackoff, Adam Smith. 1041-1053 [doi]
- A 2(1/8)-Approximation Algorithm for Rectangle TilingKatarzyna E. Paluch. 1054-1065 [doi]
- Extensional Theories and RewritingGrigore Rosu. 1066-1079 [doi]
- Hardness of String Similarity Search and Other Indexing ProblemsSüleyman Cenk Sahinalp, Andrey Utis. 1080-1098 [doi]
- A Syntactic Characterization of Distributive LTL QueriesMarko Samer, Helmut Veith. 1099-1110 [doi]
- Online Scheduling with Bounded MigrationPeter Sanders, Naveen Sivadasan, Martin Skutella. 1111-1122 [doi]
- On the Expressive Power of Monadic Least Fixed Point LogicNicole Schweikardt. 1123-1135 [doi]
- Counting in Trees for FreeHelmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl. 1136-1149 [doi]
- Games with Winning Conditions of High Borel ComplexityOlivier Serre. 1150-1162 [doi]
- Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean FormulasAlan Skelley. 1163-1175 [doi]
- LA, Permutations, and the Hajós CalculusMichael Soltys. 1176-1187 [doi]
- A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles: (Extended Abstract)Michael Toftdal. 1188-1200 [doi]
- Efficiently Computing Succinct Trade-Off CurvesSergei Vassilvitskii, Mihalis Yannakakis. 1201-1213 [doi]
- On Randomization Versus Synchronization in Distributed SystemsHagen Völzer. 1214-1226 [doi]
- A New Algorithm for Optimal Constraint Satisfaction and Its ImplicationsRyan Williams. 1227-1237 [doi]
- On the Power of Ambainis s Lower BoundsShengyu Zhang. 1238-1250 [doi]