Table of Contents

• Polarized Process Algebra and Program EquivalenceJan A. Bergstra, Inge Bethke. 1-21 [doi]
• Problems on RNA Secondary Structure Prediction and DesignAnne Condon. 22-32 [doi]
• Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer NetworksAmos Fiat. 33 [doi]
• The SPQR-Tree Data Structure in Graph DrawingPetra Mutzel. 34-46 [doi]
• Model Checking and Testing CombinedDoron Peled. 47-63 [doi]
• Logic and Automata: A Match Made in HeavenMoshe Y. Vardi. 64-65 [doi]
• Pushdown Automata and Multicounter Machines, a Comparison of Computation ModesJuraj Hromkovic, Georg Schnitger. 66-80 [doi]
• Generalized Framework for Selectors with Applications in Optimal Group TestingAnnalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro. 81-96 [doi]
• Decoding of Interleaved Reed Solomon Codes over Noisy DataDaniel Bleichenbacher, Aggelos Kiayias, Moti Yung. 97-108 [doi]
• On the Axiomatizability of Ready Traces, Ready Simulation, and Failure TracesStefan Blom, Wan Fokkink, Sumit Nain. 109-118 [doi]
• Resource Access and Mobility Control with Dynamic Privileges AcquisitionDaniele Gorla, Rosario Pugliese. 119-132 [doi]
• Replication vs. Recursive Definitions in Channel Based CalculiNadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro. 133-144 [doi]
• Improved Combinatorial Approximation Algorithms for the k-Level Facility Location ProblemAlexander A. Ageev, Yinyu Ye, Jiawei Zhang. 145-156 [doi]
• An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle InequalityMarkus Bläser. 157-163 [doi]
• An Improved Approximation Algorithm for Vertex Cover with Hard CapacitiesRajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan. 164-175 [doi]
• Approximation Schemes for Degree-Restricted MST and Red-Blue Separation ProblemSanjeev Arora, Kevin L. Chang. 176-188 [doi]
• Approximating Steiner k-CutsChandra Chekuri, Sudipto Guha, Joseph Naor. 189-199 [doi]
• MAX k-CUT and Approximating the Chromatic Number of Random GraphsAmin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. 200-211 [doi]
• Approximation Algorithm for Directed Telephone Multicast ProblemMichael Elkin, Guy Kortsarz. 212-223 [doi]
• Mixin Modules and Computational EffectsDavide Ancona, Sonia Fagorzi, Eugenio Moggi, Elena Zucca. 224-238 [doi]
• Decision Problems for Language Equations with Boolean OperationsAlexander Okhotin. 239-251 [doi]
• Generalized Rewrite TheoriesRoberto Bruni, José Meseguer. 252-266 [doi]
• Sophistication RevisitedLuis Antunes 0002, Lance Fortnow. 267-277 [doi]
• Scaled Dimension and Nonuniform ComplexityJohn M. Hitchcock, Jack H. Lutz, Elvira Mayordomo. 278-290 [doi]
• Quantum Search on Bounded-Error InputsPeter Høyer, Michele Mosca, Ronald de Wolf. 291-299 [doi]
• A Direct Sum Theorem in Communication Complexity via Message CompressionRahul Jain, Jaikumar Radhakrishnan, Pranab Sen. 300-315 [doi]
• Optimal Cache-Oblivious Implicit DictionariesGianni Franceschini, Roberto Grossi. 316-331 [doi]
• The Cell Probe Complexity of Succinct Data StructuresAnna Gál, Peter Bro Miltersen. 332-344 [doi]
• Succinct Representations of PermutationsJ. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao. 345-356 [doi]
• Succinct Dynamic Dictionaries and TreesRajeev Raman, S. Srinivasa Rao. 357-368 [doi]
• Labeling Schemes for Weighted Dynamic TreesAmos Korman, David Peleg. 369-383 [doi]
• A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n:::1+1/k:::) Size in Weighted GraphsSurender Baswana, Sandeep Sen. 384-296 [doi]
• Multicommodity Flows over Time: Efficient Algorithms and ComplexityAlexander Hall, Steffen Hippler, Martin Skutella. 397-409 [doi]
• Multicommodity Demand Flow in a TreeChandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd. 410-425 [doi]
• Skew and Infinitary Formal Power SeriesManfred Droste, Dietrich Kuske. 426-438 [doi]
• Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser s SeparationJuraj Hromkovic, Georg Schnitger. 439-451 [doi]
• Residual Languages and Probabilistic AutomataFrançois Denis, Yann Esposito. 452-463 [doi]
• A Testing Scenario for Probabilistic AutomataMariëlle Stoelinga, Frits W. Vaandrager. 464-477 [doi]
• The Equivalence Problem for t-Turn DPDA Is Co-NPGéraud Sénizergues. 478-489 [doi]
• Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than kMarkus Holzer, Martin Kutrib. 490-501 [doi]
• Convergence Time to Nash EquilibriaEyal Even-Dar, Alexander Kesselman, Yishay Mansour. 502-513 [doi]
• Nashification and the Coordination Ratio for a Selfish Routing GameRainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode. 514-526 [doi]
• Stable Marriages with Multiple Partners: Efficient Search for an Optimal SolutionVipul Bansal, Aseem Agrawal, Varun S. Malhotra. 527-542 [doi]
• An Intersection Inequality for Discrete Distributions and Related Generation ProblemsEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino. 543-555 [doi]
• Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity GamesThierry Cachat. 556-569 [doi]
• Undecidability of Weak Bisimulation Equivalence for 1-Counter ProcessesRichard Mayr. 570-583 [doi]
• Bisimulation Proof Methods for Mobile AmbientsMassimo Merro, Francesco Zappa Nardelli. 584-598 [doi]
• On Equivalent Representations of Infinite StructuresArnaud Carayol, Thomas Colcombet. 599-610 [doi]
• Adaptive Raising Strategies Optimizing Relative EfficiencyArnold Schönhage. 611-623 [doi]
• A Competitive Algorithm for the General 2-Server ProblemRené Sitters, Leen Stougie, Willem de Paepe. 624-636 [doi]
• On the Competitive Ratio for Online Facility LocationDimitris Fotakis. 637-652 [doi]
• A Study of Integrated Document and Connection CachingSusanne Albers, Rob van Stee. 653-667 [doi]
• A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State SystemsGaoyan Xie, Zhe Dang, Oscar H. Ibarra. 668-680 [doi]
• Monadic Second-Order Logics with CardinalitiesFelix Klaedtke, Harald Rueß. 681-696 [doi]
• Pi::2:: cap Sigma::2:: equiv AFMCOrna Kupferman, Moshe Y. Vardi. 697-713 [doi]
• Upper Bounds for a Theory of QueuesTatiana Rybina, Andrei Voronkov. 714-724 [doi]
• Degree Distribution of the FKP Network ModelNoam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan. 725-738 [doi]
• Similarity Matrices for Pairs of GraphsVincent D. Blondel, Paul Van Dooren. 739-750 [doi]
• Algorithmic Aspects of Bandwidth TradingRandeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor. 751-766 [doi]
• CTL:::+::: Is Complete for Double Exponential TimeJan Johannsen, Martin Lange. 767-775 [doi]
• Hierarchical and Recursive State Machines with Context-Dependent PropertiesSalvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato. 776-789 [doi]
• Oracle Circuits for Branching-Time Model CheckingPh. Schnoebelen. 790-801 [doi]
• There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)Luisa Gargano, Mikael Hammar. 802-816 [doi]
• The Computational Complexity of the Role Assignment ProblemJirí Fiala, Daniël Paulusma. 817-828 [doi]
• Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map GraphsErik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. 829-844 [doi]
• Genus Characterizes the Complexity of Graph Problems: Some Tight ResultsJianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia. 845-856 [doi]
• The Definition of a Temporal Clock OperatorCindy Eisner, Dana Fisman, John Havlicek, Anthony McIsaac, David Van Campenhout. 857-870 [doi]
• Minimal Classical Logic and Control OperatorsZena M. Ariola, Hugo Herbelin. 871-885 [doi]
• Counterexample-Guided ControlThomas A. Henzinger, Ranjit Jhala, Rupak Majumdar. 886-902 [doi]
• Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data TypesJo Erskine Hannay. 903-917 [doi]
• Efficient Pebbling for List Traversal SynopsesYossi Matias, Ely Porat. 918-928 [doi]
• Function Matching: Algorithms, Applications, and a Lower BoundAmihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat. 929-942 [doi]
• Simple Linear Work Suffix Array ConstructionJuha Kärkkäinen, Peter Sanders. 943-955 [doi]
• Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type SystemsFrancisco Gutiérrez, Blas C. Ruiz. 956-968 [doi]
• Secrecy in Untrusted NetworksMichele Bugliesi, Silvia Crafa, Amela Prelic, Vladimiro Sassone. 969-983 [doi]
• Locally Commutative CategoriesArkadev Chattopadhyay, Denis Thérien. 984-995 [doi]
• Semi-pullbacks and Bisimulations in Categories of Stochastic RelationsErnst-Erich Doberkat. 996-1007 [doi]
• Quantitative Analysis of Probabilistic Lossy Channel SystemsAlexander Moshe Rabinovich. 1008-1021 [doi]
• Discounting the Future in Systems TheoryLuca de Alfaro, Thomas A. Henzinger, Rupak Majumdar. 1022-1037 [doi]
• Information Flow in Concurrent GamesLuca de Alfaro, Marco Faella. 1038-1053 [doi]
• Impact of Local Topological Information on Random Walks on Finite GraphsSatoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita. 1054-1067 [doi]
• Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean SpacesJens Jägersküpper. 1068-1079 [doi]
• Optimal Coding and Sampling of TriangulationsDominique Poulalhon, Gilles Schaeffer. 1080-1094 [doi]
• Generating Labeled Planar Graphs Uniformly at RandomManuel Bodirsky, Clemens Gröpl, Mihyun Kang. 1095-1107 [doi]
• Online Load Balancing Made Simple: Greedy Strikes BackPierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger. 1108-1122 [doi]
• Real-Time Scheduling with a BudgetJoseph Naor, Hadas Shachnai, Tami Tamir. 1123-1137 [doi]
• Improved Approximation Algorithms for Minimum-Space Advertisement SchedulingBrian C. Dean, Michel X. Goemans. 1138-1152 [doi]
• Anycasting in Adversarial Systems: Routing and Admission ControlBaruch Awerbuch, André Brinkmann, Christian Scheideler. 1153-1168 [doi]
• Dynamic Algorithms for Approximating InterdistancesSergei Bespamyatnikh, Michael Segal. 1169-1180 [doi]
• Solving the Robots Gathering ProblemMark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro. 1181-1196 [doi]