ISBN: 3-540-65691-X
TITLE: STACS 99
AUTHOR: Meinel, Christoph; Tison, Sophie (Eds.)
TOC:

Invited Talks
Algorithms for Selfish Agents
N. Nisan 1
The Reduced Genus of a Multigraph
P. Ossona de Mendez 16
Classifying Discrete Temporal Properties
Th. Wilke 32
Complexity 1
Circuit Complexity of Testing Square-Free Numbers
A. Bernasconi, I. Shparlinski 47
Relating Branching Program Size and Formula Size over the Full Binary Basis
M. Sauerhoff, I. Wegener, R. Werchner 57
Theory of Parallel Algorithms 1
Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines
A.E. Andreev, A.E.F. Clementi, P. Penna, J.D.P. Rolim 68
The Average Time Complexity to Compute Prefix Functions in Processor Networks
A. Jakoby 78
Complexity 2
On the Hardness of Permanent
J.-Y. Cai, A. Pavan, D. Sivakumar 90
One-Sided Versus Two-Sided Error in Probabilistic Computation
H. Buhrman, L. Fortnow 100
Computational Geometry
An Optimal Competitive Strategy for Walking in Streets
C. Icking, R. Klein, E. Langetepe 110
An Optimal Strategy for Searching in Unknown Streets
S. Schuierer, I. Semrau 121
Parallel Searching on m Rays
M. Hammar, B.J. Nilsson, S. Schuierer 132
Complexity 3
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
C. Lautemann, N. Schweikardt, Th. Schwentick 143
Descriptive Complexity of Computable Sequences
B. Durand, A. Shen, N. Vereshagin 153
Complexity of Some Problems in Universal Algebra
C. Bergman, G. Slutzki 163
Algorithms and Data Structures 1
New Branchwidth Territories
T. Kloks, J. Kratochvl, H. Mller 173
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
M.-Y. Kao, A. Lingas, A. stlin 184
Treewidth and Minimum Fill-In of Weakly Triangulated Graphs
V. Bouchitt, I. Todinca 197
Automata and Formal Languages
Decidability and Undecidability of Marked PCP
V. Halava, M. Hirvensalo, R. de Wolf 207
On Quadratic Word Equations
J.M. Robson, V. Diekert 217
Some Undecidability Results Related to the Star Problem in Trace Monoids
D. Kirsten 227
Algorithms and Data Structures 2
An Approximation Algorithm for Max p-Section
G. Andersson 237
Approximating Bandwidth by Mixing Layouts of Interval Graphs
D. Kratsch, L. Stewart 248
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
R. Preis 259
Complexity 4
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries
E. Hemaspaandra, L.A. Hemaspaandra, H. Hempel 270
Sparse Sets, Approximable Sets, and Parallel Queries to NP
V. Arvind, J. Torn 281
Algorithms and Data Structures 3
External Selection
J.F. Sibeyn 291
Fast Computations of the Exponential Function
T. Ahrendt 302
Verification
A Model of Behaviour Abstraction for Communicating Processes
M. Koutny, G. Pappalardo 313
Model Checking Lossy Vector Addition Systems
A. Bouajjani, R. Mayr 323
Algorithms and Data Structures 4
Constructing Light Spanning Trees with Small Routing Cost
B.Y. Wu, K.-M. Chao, C.Y. Tang 334
Finding Paths with the Right Cost
M. Nyknen, E. Ukkonen 345
Complexity 5
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
M. Szegedy 356
Lower Bounds for Dynamic Algebraic Problems
G.S. Frandsen, J.P. Hansen, P.B. Miltersen 362
An Explicit Lower Bound for TSP with Distances One and Two
L. Engebretsen 373
Theory of Parallel Algorithms 2
Scheduling Dynamic Graphs
A. Jakoby, M. Liskiewicz, R. Reischuk 383
Supporting Increment and Decrement Operations in Balancing Networks
W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit, D. Touitou 393
Worst-Case Equilibria
E. Koutsoupias, C. Papadimitriou 404
Algorithmic Learning
A Complete and Tight Average-Case Analysis of Learning Monomials
R. Reischuk, Th. Zeugmann 414
Costs of General Purpose Learning
J. Case, K.-J. Chen, S. Jain 424
Universal Distributions and Time-Bounded Kolmogorov Complexity
R. Schuler 434
Logic in Computer Science
The Descriptive Complexity Approach to LOGCFL
C. Lautemann, P. McKenzie, Th. Schwentick, H. Vollmer 444
The Weakness of Self-Complementation
O. Kupferman, M.Y. Vardi 455
On the Difference of Horn Theories
Th. Eiter, T. Ibaraki, K. Makino 467
Complexity 6
On Quantum Algorithms for Noncommutative Hidden Subgroups
M. Ettinger, P. Hyer 478
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions
M. Sauerhoff 488
How To Forget a Secret
G. Di Crescenzo, N. Ferguson, R. Impagliazzo, M. Jakobsson 500
Logic in Computer Science 2
A Modal Fixpoint Logic with Chop
M. Mller-Olm 510
Completeness of Neighbourhood Logic
R. Barua, S. Roy, Z. Chaochen 521
Eliminating Recursion in the -Calculus
M. Otto 531
Complexity 7
On Optimal Algorithms and Optimal Proof Systems
J. Messner 541
Space Bounds for Resolution
J.L. Esteban, J. Torn 551
Algorithms and Data Structures 5
Upper Bounds for Vertex Cover Further Improved
R. Niedermeier, P. Rossmanith 561
Online Matching for Scheduling Problems
M. Riedel 571
Author Index 581
END
