Abstract is missing.
- Algorithms for Selfish AgentsNoam Nisan. 1-15 [doi]
- The Reduced Genus of a MultigraphPatrice Ossona de Mendez. 16-31 [doi]
- Classifying Discrete Temporal PropertiesThomas Wilke. 32-46 [doi]
- Circuit Complexity of Testing Square-Free NumbersAnna Bernasconi, Igor Shparlinski. 47-56 [doi]
- Relating Branching Program Size and Formula Size over the Full Binary BasisMartin Sauerhoff, Ingo Wegener, Ralph Werchner. 57-67 [doi]
- Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory MachinesAlexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim. 68-77 [doi]
- The Average Time Complexity to Compute Prefix Functions in Processor NetworksAndreas Jakoby. 78-89 [doi]
- On the Hardness of PermanentJin-yi Cai, Aduri Pavan, D. Sivakumar. 90-99 [doi]
- One-sided Versus Two-sided Error in Probabilistic ComputationHarry Buhrman, Lance Fortnow. 100-109 [doi]
- An Optimal Competitive Strategy for Walking in StreetsChristian Icking, Rolf Klein, Elmar Langetepe. 110-120 [doi]
- An Optimal Strategy for Searching in Unknown StreetsSven Schuierer, Ines Semrau. 121-131 [doi]
- Parallel Searching on m RaysMikael Hammar, Bengt J. Nilsson, Sven Schuierer. 132-142 [doi]
- A Logical Characterisation of Linear Time on Nondeterministic Turing MachinesClemens Lautemann, Nicole Schweikardt, Thomas Schwentick. 143-152 [doi]
- Descriptive Complexity of Computable SequencesBruno Durand, Alexander Shen, Nikolai K. Vereshchagin. 153-162 [doi]
- Complexity of Some Problems in Universal AlgebraClifford Bergman, Giora Slutzki. 163-172 [doi]
- New Branchwidth TerritoriesTon Kloks, Jan Kratochvíl, Haiko Müller. 173-183 [doi]
- Balanced Randomized Tree Splitting with Applications to Evolutionary Tree ConstructionsMing-Yang Kao, Andrzej Lingas, Anna Östlin. 184-196 [doi]
- Treewidth and Minimum Fill-in of Weakly Triangulated GraphsVincent Bouchitté, Ioan Todinca. 197-206 [doi]
- Decidability and Undecidability of Marked PCPVesa Halava, Mika Hirvensalo, Ronald de Wolf. 207-216 [doi]
- On Quadratic Word EquationsJohn Michael Robson, Volker Diekert. 217-226 [doi]
- Some Undecidability Results Related to the Star Problem in Trace MonoidsDaniel Kirsten. 227-236 [doi]
- An Approximation Algorithm for Max p-SectionGunnar Andersson. 237-247 [doi]
- Approximating Bandwidth by Mixing Layouts of Interval GraphsDieter Kratsch, Lorna Stewart. 248-258 [doi]
- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General GraphsRobert Preis. 259-269 [doi]
- Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 QueriesEdith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. 269-280 [doi]
- Sparse Sets, Approximable Sets, and Parallel Queries to NPVikraman Arvind, Jacobo Torán. 281-290 [doi]
- External SelectionJop F. Sibeyn. 291-301 [doi]
- Fast Computations of the Exponential FunctionTimm Ahrendt. 302-312 [doi]
- A Model of Behaviour Abstraction for Communicating ProcessesMaciej Koutny, Giuseppe Pappalardo. 313-322 [doi]
- Model Checking Lossy Vector Addition SystemsAhmed Bouajjani, Richard Mayr. 323-333 [doi]
- Constructing Light Spanning Trees with Small Routing CostBang Ye Wu, Kun-Mao Chao, Chuan Yi Tang. 334-344 [doi]
- Finding Paths with the Right CostMatti Nykänen, Esko Ukkonen. 345-355 [doi]
- In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?Mario Szegedy. 356-361 [doi]
- Lower Bounds for Dynamic Algebraic ProblemsGudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen. 362-372 [doi]
- An Explicit Lower Bound for TSP with Distances One and TwoLars Engebretsen. 373-382 [doi]
- Scheduling Dynamic GraphsAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk. 383-392 [doi]
- Supporting Increment and Decrement Operations in Balancing NetworksWilliam Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou. 393-403 [doi]
- Worst-case EquilibriaElias Koutsoupias, Christos H. Papadimitriou. 404-413 [doi]
- A Complete and Tight Average-Case Analysis of Learning MonomialsRüdiger Reischuk, Thomas Zeugmann. 414-423 [doi]
- Costs of General Purpose LearningJohn Case, Keh-Jiann Chen, Sanjay Jain. 424-433 [doi]
- Universal Distributions and Time-Bounded Kolmogorov ComplexityRainer Schuler. 434-443 [doi]
- The Descriptive Complexity Approach to LOGCFLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer. 444-454 [doi]
- The Weakness of Self-ComplementationOrna Kupferman, Moshe Y. Vardi. 455-466 [doi]
- On the Difference of Horn TheoriesThomas Eiter, Toshihide Ibaraki, Kazuhisa Makino. 467-477 [doi]
- On Quantum Algorithms for Noncommutative Hidden SubgroupsMark Ettinger, Peter Høyer. 478-487 [doi]
- On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable FunctionsMartin Sauerhoff. 488-499 [doi]
- How to Forget a SecretGiovanni Di Crescenzo, Niels Ferguson, Russell Impagliazzo, Markus Jakobsson. 500-509 [doi]
- A Modal Fixpoint Logic with ChopMarkus Müller-Olm. 510-520 [doi]
- Completeness of Neighbourhood LogicRana Barua, Suman Roy, Zhou Chaochen. 521-530 [doi]
- Eliminating Recursion in the µ-CalculusMartin Otto. 531-540 [doi]
- On Optimal Algorithms and Optimal Proof SystemsJochen Meßner. 541-550 [doi]
- Space Bounds for ResolutionJuan Luis Esteban, Jacobo Torán. 551-560 [doi]
- Upper Bounds for Vertex Cover Further ImprovedRolf Niedermeier, Peter Rossmanith. 561-570 [doi]
- Online Matching for Scheduling ProblemsMarco Riedel. 571-580 [doi]