Abstract is missing.
- The Complexity of Querying External Memory and Streaming DataMartin Grohe, Christoph Koch, Nicole Schweikardt. 1-16 [doi]
- The Smoothed Analysis of AlgorithmsDaniel A. Spielman. 17-18 [doi]
- Path Coupling Using Stopping TimesMagnus Bordewich, Martin E. Dyer, Marek Karpinski. 19-31 [doi]
- On the Incompressibility of Monotone DNFsMatthias P. Krieger. 32-43 [doi]
- Bounds on the Power of Constant-Depth Quantum CircuitsStephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang. 44-55 [doi]
- Biautomatic SemigroupsMichael Hoffmann 0002, Richard M. Thomas. 56-67 [doi]
- Deterministic Automata on Unranked TreesJulien Cristau, Christof Löding, Wolfgang Thomas. 68-79 [doi]
- Decidable Membership Problems for Finite Recurrent Systems over Sets of NaturalsDaniel Meister. 80-91 [doi]
- Generic Density and Small Span TheoremPhilippe Moser. 92-102 [doi]
- Logspace Optimization Problems and Their Approximability PropertiesTill Tantau. 103-114 [doi]
- A Faster and Simpler 2-Approximation Algorithm for Block SortingWolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough. 115-124 [doi]
- On the Power of Unambiguity in Alternating MachinesHolger Spakowski, Rahul Tripathi. 125-136 [doi]
- Translational Lemmas for Alternating TMs and PRAMsChuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai. 137-148 [doi]
- Collapsing Recursive Oracles for Relativized Polynomial HierarchiesTomoyuki Yamakami. 149-160 [doi]
- Exact Algorithms for Graph HomomorphismsFedor V. Fomin, Pinar Heggernes, Dieter Kratsch. 161-171 [doi]
- Improved Algorithms and Complexity Results for Power Domination in GraphsJiong Guo, Rolf Niedermeier, Daniel Raible. 172-184 [doi]
- Clique-Width for Four-Vertex Forbidden SubgraphsAndreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin. 185-196 [doi]
- On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph ProblemsVincenzo Bonifaci, Ugo Di Iorio, Luigi Laura. 197-208 [doi]
- Simple Stochastic Games and P-Matrix Generalized Linear Complementarity ProblemsBernd Gärtner, Leo Rüst. 209-220 [doi]
- Perfect Reconstruction of Black Pixels RevisitedHans-Ulrich Simon. 221-232 [doi]
- Adaptive Zooming in Point Set LabelingSheung-Hung Poon, Chan-Su Shin. 233-244 [doi]
- On the Black-Box Complexity of Sperner s LemmaKatalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven. 245-257 [doi]
- Property Testing and the Branching Program Size of Boolean FunctionsBeate Bollig. 258-269 [doi]
- Almost Optimal Explicit SelectorsBogdan S. Chlebus, Dariusz R. Kowalski. 270-280 [doi]
- The Delayed ::::k::::-Server ProblemWolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga. 281-292 [doi]
- Leftist Grammars and the Chomsky HierarchyTomasz Jurdzinski, Krzysztof Lorys. 293-304 [doi]
- Shrinking Multi-pushdown AutomataMarkus Holzer, Friedrich Otto. 305-316 [doi]
- A Simple and Fast Min-cut AlgorithmMichael Brinkmeier. 317-328 [doi]
- (Non)-Approximability for the Multi-criteria ::::TSP::::(1, 2)Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot. 329-340 [doi]
- Completeness and Compactness of Quantitative DomainsPawel Waszkiewicz. 341-351 [doi]
- A Self-dependency Constraint in the Simply Typed Lambda CalculusAleksy Schubert. 352-364 [doi]
- A Type System for Computationally Secure Information FlowPeeter Laud, Varmo Vene. 365-377 [doi]
- Algorithms for Graphs Embeddable with Few Crossings Per EdgeAlexander Grigoriev, Hans Leo Bodlaender. 378-387 [doi]
- Approximation Results for the Weighted P::4:: Partition ProblemsJérôme Monnot, Sophie Toulouse. 388-396 [doi]
- The Maximum Resource Bin Packing ProblemJoan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk. 397-408 [doi]
- Average-Case Non-approximability of Optimisation ProblemsBirgit Schelm. 409-421 [doi]
- Relations Between Average-Case and Worst-Case ComplexityAduri Pavan, N. V. Vinodchandran. 422-432 [doi]
- Reconstructing Many Partitions Using Spectral TechniquesJoachim Giesen, Dieter Mitsche. 433-444 [doi]
- Constant Time Generation of Linear ExtensionsAkimitsu Ono, Shin-Ichi Nakano. 445-453 [doi]
- On Approximating Real-World Halting ProblemsSven Köhler, Christian Schindelhauer, Martin Ziegler. 454-466 [doi]
- An Explicit Solution to Post s Problem over the RealsKlaus Meer, Martin Ziegler. 467-478 [doi]
- The Complexity of Semilinear Problems in Succinct RepresentationPeter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois. 479-490 [doi]
- On Finding Acyclic SubhypergraphsKouichi Hirata, Megumi Kuwabara, Masateru Harao. 491-503 [doi]
- An Improved Approximation Algorithm for TSP with Distances One and TwoMarkus Bläser, L. Shankar Ram. 504-515 [doi]
- New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set ProblemAndreas Brandstädt, Van Bang Le, Suhail Mahfud. 516-527 [doi]
- On the Expressiveness of Asynchronous Cellular AutomataBenedikt Bollig. 528-539 [doi]
- Tree Automata and Discrete Distributed GamesJulien Bernet, David Janin. 540-551 [doi]
- A New Linearizing Restriction in the Pattern Matching ProblemYo-Sub Han, Derick Wood. 552-562 [doi]
- Fully Incremental LCS ComputationYusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda. 563-574 [doi]