STACS 99

Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines

Pages 68-77

Andreev, Alexander E. (et al.)

The Average Time Complexity to Compute Prefix Functions in Processor Networks

Pages 78-89

Jakoby, Andreas

On the Hardness of Permanent

Pages 90-99

Cai, Jin-Yi (et al.)

One-Sided Versus Two-Sided Error in Probabilistic Computation

Pages 100-109

Buhrman, Harry (et al.)

An Optimal Competitive Strategy for Walking in Streets

Pages 110-120

Icking, Christian (et al.)

An Optimal Strategy for Searching in Unknown Streets

Pages 121-131

Schuierer, Sven (et al.)

Parallel Searching on m Rays

Pages 132-142

Hammar, Mikael (et al.)

A Logical Characterisation of Linear Time on Nondeterministic Turing Machines

Pages 143-152

Lautemann, Clemens (et al.)

Descriptive Complexity of Computable Sequences

Pages 153-162

Durand, Bruno (et al.)

Complexity of Some Problems in Universal Algebra

Pages 163-172

Bergman, Clifford (et al.)

New Branchwidth Territories

Pages 173-183

Kloks, Ton (et al.)

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

Pages 184-196

Kao, Ming-Yang (et al.)

Treewidth and Minimum Fill-In of Weakly Triangulated Graphs

Pages 197-206

Bouchitté, Vincent (et al.)

Decidability and Undecidability of Marked PCP

Pages 207-216

Halava, Vesa (et al.)

On Quadratic Word Equations

Pages 217-226

Robson, John Michael (et al.)

Some Undecidability Results Related to the Star Problem in Trace Monoids

Pages 227-236

Kirsten, Daniel

An Approximation Algorithm for Max p-Section

Pages 237-247

Andersson, Gunnar

Approximating Bandwidth by Mixing Layouts of Interval Graphs

Pages 248-258

Kratsch, Dieter (et al.)

Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs

Pages 259-269

Preis, Robert

Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries

Pages 270-280

Hemaspaandra, Edith (et al.)

Sparse Sets, Approximable Sets, and Parallel Queries to NP

Pages 281-290

Arvind, Vikraman (et al.)

External Selection

Pages 291-301

Sibeyn, Jop F.

Fast Computations of the Exponential Function

Pages 302-312

Ahrendt, Timm

A Model of Behaviour Abstraction for Communicating Processes

Pages 313-322

Koutny, Maciej (et al.)

Model Checking Lossy Vector Addition Systems

Pages 323-333

Bouajjani, Ahmed (et al.)

Constructing Light Spanning Trees with Small Routing Cost

Pages 334-344

Wu, Bang Ye (et al.)

Finding Paths with the Right Cost

Pages 345-355

Nykänen, Matti (et al.)

In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?

Pages 356-361

Szegedy, Mario

Lower Bounds for Dynamic Algebraic Problems

Pages 362-372

Frandsen, Gudmund Skovbjerg (et al.)

An Explicit Lower Bound for TSP with Distances One and Two

Pages 373-382

Engebretsen, Lars

Scheduling Dynamic Graphs

Pages 383-392

Jakoby, Andreas (et al.)

Supporting Increment and Decrement Operations in Balancing Networks

Pages 393-403

Aiello, William (et al.)

Worst-Case Equilibria

Pages 404-413

Koutsoupias, Elias (et al.)

A Complete and Tight Average-Case Analysis of Learning Monomials

Pages 414-423

Reischuk, Rüdiger (et al.)

Costs of General Purpose Learning

Pages 424-433

Case, John (et al.)

Universal Distributions and Time-Bounded Kolmogorov Complexity

Pages 434-443

Schuler, Rainer

The Descriptive Complexity Approach to LOGCFL

Pages 444-454

Lautemann, Clemens (et al.)

The Weakness of Self-Complementation

Pages 455-466

Kupferman, Orna (et al.)

On the Difference of Horn Theories

Pages 467-477

Eiter, Thomas (et al.)

On Quantum Algorithms for Noncommutative Hidden Subgroups

Pages 478-487

Ettinger, Mark (et al.)

On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions

Pages 488-499

Sauerhoff, Martin

How To Forget a Secret

Pages 500-509

Crescenzo, Giovanni (et al.)

A Modal Fixpoint Logic with Chop

Pages 510-520

Müller-Olm, Markus

Completeness of Neighbourhood Logic

Pages 521-530

Barua, Rana (et al.)

Eliminating Recursion in the μ-Calculus

Pages 531-540

Otto, Martin

On Optimal Algorithms and Optimal Proof Systems

Pages 541-550

Messner, Jochen

Space Bounds for Resolution

Pages 551-560

Esteban, Juan Luis (et al.)

Upper Bounds for Vertex Cover Further Improved

Pages 561-570

Niedermeier, Rolf (et al.)

Online Matching for Scheduling Problems

Pages 571-580

Riedel, Marco