Abstract is missing.
- Approximation Schemes for Metric Clustering ProblemsClaire Kenyon. 1-3 [doi]
- Positional Determinacy of Infinite GamesErich Grädel. 4-18 [doi]
- Individual Communication Complexity: Extended AbstractHarry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi. 19-30 [doi]
- The Complexity of Satisfiability Problems over Finite LatticesBernhard Schwarz. 31-43 [doi]
- Constant Width Planar Computation Characterizes ACC:::0:::Kristoffer Arnsfelt Hansen. 44-55 [doi]
- A Simple and Fast Approach for Solving Problems on Planar GraphsFedor V. Fomin, Dimitrios M. Thilikos. 56-67 [doi]
- Sum-Multicoloring on PathsAnnamária Kovács. 68-80 [doi]
- Matching Algorithms Are Fast in Sparse Random GraphsHolger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki. 81-92 [doi]
- Algebraic Results on Quantum AutomataAndris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien. 93-104 [doi]
- Quantum Identification of Boolean OraclesAndris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita. 105-116 [doi]
- Local Limit Distributions in Pattern Statistics: Beyond the Markovian ModelsAlberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati. 117-128 [doi]
- A Discontinuity in Pattern InferenceDaniel Reidenbach. 129-140 [doi]
- Algorithms for SAT Based on Search in Hamming BallsEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. 141-151 [doi]
- Identifying Efficiently Solvable Cases of Max CSPDavid A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin. 152-163 [doi]
- The Complexity of Boolean Constraint IsomorphismElmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer. 164-175 [doi]
- On Minimizing the Total Weighted Tardiness on a Single MachineStavros G. Kolliopoulos, George Steiner. 176-186 [doi]
- Online Competitive Algorithms for Maximizing Weighted Throughput of Unit JobsYair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jiri Sgall, Tomás Tichý. 187-198 [doi]
- Optimal and Online Preemptive Scheduling on Uniformly Related MachinesTomás Ebenlendr, Jiri Sgall. 199-210 [doi]
- Parallel Prefetching and Caching Is HardChristoph Ambühl, Birgitta Weber. 211-221 [doi]
- Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents ProblemTelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. 222-233 [doi]
- Approximation Algorithms for Minimizing Average DistortionKedar Dhamdhere, Anupam Gupta, R. Ravi. 234-245 [doi]
- Digraphs Exploration with Little MemoryPierre Fraigniaud, David Ilcinkas. 246-257 [doi]
- Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical NetworksIoannis Caragiannis, Christos Kaklamanis. 258-269 [doi]
- An Algorithmic View on OVSF Code AssignmentThomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer. 270-281 [doi]
- The Syntactic Graph of a Sofic ShiftMarie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin. 282-293 [doi]
- Periodicity and Unbordered Words: A Proof of Duval?s ConjectureTero Harju, Dirk Nowotka. 294-304 [doi]
- Desert Automata and the Finite Substitution ProblemDaniel Kirsten. 305-316 [doi]
- Satisfiability Problems Complete for Deterministic Logarithmic SpaceJan Johannsen. 317-325 [doi]
- A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence NumberTill Tantau. 326-337 [doi]
- The Minimal Logically-Defined NP-Complete ProblemRégis Barbanchon, Etienne Grandjean. 338-349 [doi]
- Solving the 2-Disjoint Paths Problem in Nearly Linear TimeTorsten Tholey. 350-361 [doi]
- Simpler Computation of Single-Source Shortest Paths in Linear Average TimeTorben Hagerup. 362-369 [doi]
- Lattices with Many Cycles Are DenseMårten Trolin. 370-381 [doi]
- Automata-Based Analysis of Recursive Cryptographic ProtocolsRalf Küsters, Thomas Wilke. 382-393 [doi]
- On Minimum Circular ArrangementMurali K. Ganapathy, Sachin Lodha. 394-405 [doi]
- Integral Symmetric 2-Commodity FlowsAubin Jarry. 406-417 [doi]
- Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless NetworksChristoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri. 418-427 [doi]
- On the Expressiveness of Deterministic Transducers over Infinite TreesThomas Colcombet, Christof Löding. 428-439 [doi]
- Definability and Regularity in Automatic StructuresBakhadyr Khoussainov, Sasha Rubin, Frank Stephan. 440-451 [doi]
- Active Context-Free GamesAnca Muscholl, Thomas Schwentick, Luc Segoufin. 452-464 [doi]
- Worst Case Performance of an Approximation Algorithm for Asymmetric TSPAnna Palbom. 465-476 [doi]
- On Visibility Representation of Plane GraphsHuaming Zhang, Xin He. 477-488 [doi]
- Topology Matters: Smoothed Competitiveness of Metrical Task SystemsGuido Schäfer, Naveen Sivadasan. 489-500 [doi]
- A Randomized Competitive Algorithm for Evaluating Priced AND/OR TreesEduardo Sany Laber. 501-512 [doi]
- The Plurality Problem with Three ColorsMartin Aigner, Gianluca De Marco, Manuela Montangero. 513-521 [doi]
- A Measured Collapse of the Modal µ-Calculus Alternation HierarchyDoron Bustan, Orna Kupferman, Moshe Y. Vardi. 522-533 [doi]
- An Information Theoretic Lower Bound for Broadcasting in Radio NetworksCarlos Brito, Eli Gafni, Shailesh Vaya. 534-546 [doi]
- A New Model for Selfish RoutingThomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode. 547-558 [doi]
- Broadcast in the Rendezvous ModelPhilippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari. 559-570 [doi]
- Time-Space Tradeoff in Derandomizing Probabilistic LogspaceJin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek. 571-583 [doi]
- What Can be Efficiently Reduced to the K-Random Strings?Eric Allender, Harry Buhrman, Michal Koucký. 584-595 [doi]
- Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open TermsSebastian Bala. 596-607 [doi]
- Deterministic Truthful Approximation Mechanisms for Scheduling Related MachinesVincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano. 608-619 [doi]
- The Expected Competitive Ratio for Weighted Completion Time SchedulingAlexander Souza, Angelika Steger. 620-631 [doi]
- Effective Strong Dimension in Algorithmic Information and Computational ComplexityKrishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo. 632-643 [doi]
- A Lower Bound on the Competitive Ratio of Truthful AuctionsAndrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks. 644-655 [doi]
- Errata to Analysis of the Harmonic Algorithm for Three ServersMarek Chrobak, Jiri Sgall. 656 [doi]