Table of Contents

• Algorithms, Games, and the InternetChristos H. Papadimitriou. 1-3 [doi]
• Automata, Circuits, and Hybrids: Facets of Continuous TimeBoris A. Trakhtenbrot. 4-23 [doi]
• Languages, Rewriting Systems, and Verification of Infinite-State SystemsAhmed Bouajjani. 24-39 [doi]
• Integrating Semantics for Object-Oriented System ModelsMartin Große-Rhode. 40-60 [doi]
• Modelling with Partial Orders - Why and Why Not?Mogens Nielsen. 61-63 [doi]
• Theoretical Aspects of Evolutionary AlgorithmsIngo Wegener. 64-78 [doi]
• Improvements of the Alder-Strassen Bound: Algebras with Nonzero RadicalMarkus Bläser. 79-91 [doi]
• On Generating All Minimal Integer Solutions for a Monotone System of Linear InequalitiesEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino. 92-103 [doi]
• Division Is in Uniform TC:::0:::William Hesse. 104-114 [doi]
• A Framework for Index Bulk Loading and DynamizationPankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter. 115-127 [doi]
• A Characterization of Temporal Locality and Its Portability across Memory HierarchiesGianfranco Bilardi, Enoch Peserico. 128-139 [doi]
• The Complexity of Constructing Evolutionary Trees Using ExperimentsGerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin. 140-151 [doi]
• Hidden Pattern StatisticsPhilippe Flajolet, Yves Guivarc h, Wojciech Szpankowski, Brigitte Vallée. 152-165 [doi]
• Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real SequenceKunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama. 166-177 [doi]
• All-Pairs Shortest Paths Computation in the BSP ModelAlexandre Tiskin. 178-189 [doi]
• Approximating the Minimum Spanning Tree Weight in Sublinear TimeBernard Chazelle, Ronitt Rubinfeld, Luca Trevisan. 190-200 [doi]
• Approximation Hardness of TSP with Bounded MetricsLars Engebretsen, Marek Karpinski. 201-212 [doi]
• The RPR:::2::: Rounding Technique for Semidefinite ProgramsUriel Feige, Michael Langberg. 213-224 [doi]
• Approximation Algorithms for Partial Covering ProblemsRajiv Gandhi, Samir Khuller, Aravind Srinivasan. 225-236 [doi]
• On the Online Bin Packing ProblemSteven S. Seiden. 237-248 [doi]
• Quick k-Median, k-Center, and Facility Location for Sparse GraphsMikkel Thorup. 249-260 [doi]
• Parameterized Complexity: Exponential Speed-Up for Planar Graph ProblemsJochen Alber, Henning Fernau, Rolf Niedermeier. 261-272 [doi]
• Subexponential Parameterized Algorithms Collapse the W-HierarchyLiming Cai, David W. Juedes. 273-284 [doi]
• Improved Lower Bounds on the Randomized Complexity of Graph PropertiesAmit Chakrabarti, Subhash Khot. 285-296 [doi]
• New Imperfect Random Source with Applications to Coin-FlippingYevgeniy Dodis. 297-309 [doi]
• Recognizing More Unsatisfiable Random 3-SAT Instances EfficientlyJoel Friedman, Andreas Goerdt. 310-321 [doi]
• Weisfeiler-Lehman Refinement Requires at Least a Linear Number of IterationsMartin Fürer. 322-333 [doi]
• On Interactive Proofs with a Laconic ProverOded Goldreich, Salil P. Vadhan, Avi Wigderson. 334-345 [doi]
• Quantum Complexities of Ordered Searching, Sorting, and Element DistinctnessPeter Høyer, Jan Neerbek, Yaoyun Shi. 346-357 [doi]
• Lower Bounds in the Quantum Cell Probe ModelPranab Sen, Srinivasan Venkatesh. 358-369 [doi]
• Axiomatizations for Probabilistic BisimulationEmanuele Bandini, Roberto Segala. 370-381 [doi]
• Noninterference for Concurrent ProgramsGérard Boudol, Ilaria Castellani. 382-395 [doi]
• Distributed Controller Synthesis for Local SpecificationsP. Madhusudan, P. S. Thiagarajan. 396-407 [doi]
• A Distributed Abstract Machine for Safe AmbientsDavide Sangiorgi, Andrea Valente. 408-420 [doi]
• Towards Quantitative Verification of Probabilistic Transition SystemsFranck van Breugel, James Worrell. 421-432 [doi]
• Efficient Generation of Plane Triangulations without RepetitionsZhangjian Li, Shin-Ichi Nakano. 433-443 [doi]
• The Longest Common Subsequence Problem for Sequences with Nested Arc AnnotationsGuo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen. 444-455 [doi]
• Visibility-Based Pursuit-Evasion in a Polygonal Region by a SearcherSang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa. 456-468 [doi]
• A New Method for Balancing Binary Search TreesSalvador Roura. 469-480 [doi]
• Permutation Editing and Matching via EmbeddingsGraham Cormode, S. Muthukrishnan, Süleyman Cenk Sahinalp. 481-492 [doi]
• Testing Hypergraph ColoringArtur Czumaj, Christian Sohler. 493-505 [doi]
• Total Colorings of Degenerated GraphsShuji Isobe, Xiao Zhou, Takao Nishizeki. 506-517 [doi]
• Decidable Properties of Graphs of All-Optical NetworksLuciano Margara, Janos Simon. 518-529 [doi]
• Majority Consensus and the Local Majority RuleNabil H. Mustafa, Aleksandar Pekec. 530-542 [doi]
• Solvability of Equations in Free Partially Commutative Groups Is DecidableVolker Diekert, Anca Muscholl. 543-554 [doi]
• Rational Transformations of Formal Power SeriesManfred Droste, Guo-Qiang Zhang. 555-566 [doi]
• Combinatorics of Three-Interval ExchangesSébastien Ferenczi, Charles Holton, Luca Q. Zamboni. 567-578 [doi]
• Decision Questions Concerning Semilinearity, Morphisms, and Commutation of LanguagesTero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa. 579-590 [doi]
• The Star Problem in Trace Monoids: Reductions Beyond C4Daniel Kirsten. 591-602 [doi]
• The Trace Coding Problem Is UndecidableMichal Kunc. 603-614 [doi]
• Combinatorics of Periods in StringsEric Rivals, Sven Rahmann. 615-626 [doi]
• Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to ConstructPriti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan. 627-638 [doi]
• Effective Lossy Queue LanguagesParosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani. 639-651 [doi]
• Model Checking of Unrestricted Hierarchical State MachinesMichael Benedikt, Patrice Godefroid, Thomas W. Reps. 652-666 [doi]
• Symbolic Trace Analysis of Cryptographic ProtocolsMichele Boreale. 667-681 [doi]
• Tree Automata with One Memory, Set Constraints, and Ping-Pong ProtocolsHubert Comon, Véronique Cortier, John Mitchell. 682-693 [doi]
• Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi AutomataKousha Etessami, Thomas Wilke, Rebecca A. Schuller. 694-707 [doi]
• Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-WidthGeorg Gottlob, Reinhard Pichler. 708-719 [doi]
• From Finite State Communication Protocols to High-Level Message Sequence ChartsAnca Muscholl, Doron Peled. 720-731 [doi]
• Fractional Path Coloring with Applications to WDM NetworksIoannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano. 732-743 [doi]
• Performance Aspects of Distributed Caches Using TTL-Based ConsistencyEdith Cohen, Eran Halperin, Haim Kaplan. 744-756 [doi]
• Routing in TreesPierre Fraigniaud, Cyril Gavoille. 757-772 [doi]
• Online Packet Routing on Linear Arrays and RingsJessen T. Havill. 773-784 [doi]
• Faster Gossiping on ButterfliesJop F. Sibeyn. 785-796 [doi]
• Realizability and Verification of MSC GraphsRajeev Alur, Kousha Etessami, Mihalis Yannakakis. 797-808 [doi]
• Reasoning about Sequential and Branching Behaviours of Message Sequence GraphsP. Madhusudan. 809-820 [doi]
• A Set-Theoretic Framework for Assume-Guarantee ReasoningPatrick Maier. 821-834 [doi]
• Foundations for Circular Compositional ReasoningMahesh Viswanathan, Ramesh Viswanathan. 835-847 [doi]
• A PTAS for Minimizing Weighted Completion Time on Uniformly Related MachinesChandra Chekuri, Sanjeev Khanna. 848-861 [doi]
• The Buffer Minimization Problem for Multiprocessor Scheduling with ConflictsMarek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger. 862-874 [doi]
• On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release DatesAleksei V. Fishkin, Klaus Jansen, Lorant Porkolab. 875-886 [doi]
• On the Approximability of Average Completion Time Scheduling under Precedence ConstraintsGerhard J. Woeginger. 887-897 [doi]
• Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of RoundsBirgit Baum-Waidner. 898-911 [doi]
• Information-Theoretic Private Information Retrieval: A Unified ConstructionAmos Beimel, Yuval Ishai. 912-926 [doi]
• Secure Multiparty Computation of ApproximationsJoan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright. 927-938 [doi]
• Secure Games with Polynomial ExpressionsAggelos Kiayias, Moti Yung. 939-950 [doi]
• On the Completeness of Arbitrary Selection Strategies for ParamodulationMiquel Bofill, Guillem Godoy. 951-962 [doi]
• An Axiomatic Approach to Metareasoning on Nominal Algebras in HOASFurio Honsell, Marino Miculan, Ivan Scagnetto. 963-978 [doi]
• Knuth-Bendix Constraint Solving Is NP-CompleteKonstantin Korovin, Andrei Voronkov. 979-992 [doi]
• Amalgamation in CASL via Enriched SignaturesLutz Schröder, Till Mossakowski, Andrzej Tarlecki. 993-1004 [doi]
• Lower Bounds for the Weak Pigeonhole Principle Beyond ResolutionAlbert Atserias, Maria Luisa Bonet, Juan Luis Esteban. 1005-1016 [doi]
• Time and Space Bounds for Reversible SimulationHarry Buhrman, John Tromp, Paul M. B. Vitányi. 1017-1027 [doi]
• Finite-State DimensionJack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo. 1028-1039 [doi]
• The Complexity of Computing the Size of an IntervalLane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner. 1040-1051 [doi]
• Communication Gap for Finite Memory DevicesTomasz Jurdzinski, Miroslaw Kutylowski. 1052-1064 [doi]
• Separating Quantum and Classical LearningRocco A. Servedio. 1065-1080 [doi]