Advertisement

STACS 99

16th Annual Symposium on Theoretical Aspects of Computer Science Trier, Germany, March 4–6, 1999 Proceedings

  • Christoph Meinel
  • Sophie Tison
Conference proceedings STACS 1999

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1563)

Table of contents

  1. Front Matter
    Pages I-XIV
    PDF

  2. Invited Talks

    1. Algorithms for Selfish Agents
      Noam Nisan
      Pages 1-15
    2. The Reduced Genus of a Multigraph
      Patrice Ossona de Mendez
      Pages 16-31
    3. Classifying Discrete Temporal Properties
      Thomas Wilke
      Pages 32-46

  3. Complexity 1

    1. Circuit Complexity of Testing Square-Free Numbers
      Anna Bernasconi, Igor Shparlinski
      Pages 47-56
    2. Relating Branching Program Size and Formula Size over the Full Binary Basis
      Martin Sauerhoff, Ingo Wegener, Ralph Werchner
      Pages 57-67

  4. Theory of Parallel Algorithms 1

    1. Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines
      Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
      Pages 68-77
    2. The Average Time Complexity to Compute Prefix Functions in Processor Networks
      Andreas Jakoby
      Pages 78-89

  5. Complexity 2

    1. On the Hardness of Permanent
      Jin-Yi Cai, A. Pavan, D. Sivakumar
      Pages 90-99
    2. One-Sided Versus Two-Sided Error in Probabilistic Computation
      Harry Buhrman, Lance Fortnow
      Pages 100-109

  6. Computational Geometry

    1. An Optimal Competitive Strategy for Walking in Streets
      Christian Icking, Rolf Klein, Elmar Langetepe
      Pages 110-120
    2. An Optimal Strategy for Searching in Unknown Streets
      Sven Schuierer, Ines Semrau
      Pages 121-131
    3. Parallel Searching on m Rays
      Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
      Pages 132-142

  7. Complexity 3

    1. A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
      Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick
      Pages 143-152
    2. Descriptive Complexity of Computable Sequences
      Bruno Durand, Alexander Shen, Nikolai Vereshagin
      Pages 153-162
    3. Complexity of Some Problems in Universal Algebra
      Clifford Bergman, Giora Slutzki
      Pages 163-172

  8. Algorithms and Data Structures 1

    1. New Branchwidth Territories
      Ton Kloks, Jan Kratochvíl, Haiko Müller
      Pages 173-183
    2. Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
      Ming-Yang Kao, Andrzej Lingas, Anna Östlin
      Pages 184-196
    3. Treewidth and Minimum Fill-In of Weakly Triangulated Graphs
      Vincent Bouchitté, Ioan Todinca
      Pages 197-206

  9. Automata and Formal Languages

    1. Decidability and Undecidability of Marked PCP
      Vesa Halava, Mika Hirvensalo, Ronald de Wolf
      Pages 207-216
    2. On Quadratic Word Equations
      John Michael Robson, Volker Diekert
      Pages 217-226
    3. Some Undecidability Results Related to the Star Problem in Trace Monoids
      Daniel Kirsten
      Pages 227-236

  10. Algorithms and Data Structures 2

    1. An Approximation Algorithm for Max p-Section
      Gunnar Andersson
      Pages 237-247
    2. Approximating Bandwidth by Mixing Layouts of Interval Graphs
      Dieter Kratsch, Lorna Stewart
      Pages 248-258
    3. Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
      Robert Preis
      Pages 259-269

  11. Complexity 4

    1. Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries
      Edith Hemaspaandra, Lane. A. Hemaspaandra, Harald Hempel
      Pages 270-280
    2. Sparse Sets, Approximable Sets, and Parallel Queries to NP
      Vikraman Arvind, Jacobo Torán
      Pages 281-290

  12. Algorithms and Data Structures 3

    1. External Selection
      Jop F. Sibeyn
      Pages 291-301
    2. Fast Computations of the Exponential Function
      Timm Ahrendt
      Pages 302-312

  13. Verification

    1. A Model of Behaviour Abstraction for Communicating Processes
      Maciej Koutny, Giuseppe Pappalardo
      Pages 313-322
    2. Model Checking Lossy Vector Addition Systems
      Ahmed Bouajjani, Richard Mayr
      Pages 323-333

  14. Algorithms and Data Structures 4

    1. Constructing Light Spanning Trees with Small Routing Cost
      Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
      Pages 334-344
    2. Finding Paths with the Right Cost
      Matti Nykänen, Esko Ukkonen
      Pages 345-355

  15. Complexity 5

    1. In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
      Mario Szegedy
      Pages 356-361
    2. Lower Bounds for Dynamic Algebraic Problems
      Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
      Pages 362-372
    3. An Explicit Lower Bound for TSP with Distances One and Two
      Lars Engebretsen
      Pages 373-382

  16. Theory of Parallel Algorithms 2

    1. Scheduling Dynamic Graphs
      Andreas Jakoby, Maciej Liśkiewicz, Rüdiger Reischuk
      Pages 383-392
    2. Supporting Increment and Decrement Operations in Balancing Networks
      William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
      Pages 393-403
    3. Worst-Case Equilibria
      Elias Koutsoupias, Christos Papadimitriou
      Pages 404-413

  17. Algorithmic Learning

    1. A Complete and Tight Average-Case Analysis of Learning Monomials
      Rüdiger Reischuk, Thomas Zeugmann
      Pages 414-423
    2. Costs of General Purpose Learning
      John Case, Keh-Jiann Chen, Sanjay Jain
      Pages 424-433
    3. Universal Distributions and Time-Bounded Kolmogorov Complexity
      Rainer Schuler
      Pages 434-443

  18. Logic in Computer Science

    1. The Descriptive Complexity Approach to LOGCFL
      Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
      Pages 444-454
    2. The Weakness of Self-Complementation
      Orna Kupferman, Moshe Y. Vardi
      Pages 455-466
    3. On the Difference of Horn Theories
      Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
      Pages 467-477

  19. Complexity 6

    1. On Quantum Algorithms for Noncommutative Hidden Subgroups
      Mark Ettinger, Peter Høyer
      Pages 478-487
    2. On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions
      Martin Sauerhoff
      Pages 488-499
    3. How To Forget a Secret
      Giovanni Di Crescenzo, Niels Ferguson, Russell Impagliazzo, Markus Jakobsson
      Pages 500-509

  20. Logic in Computer Science 2

    1. A Modal Fixpoint Logic with Chop
      Markus Müller-Olm
      Pages 510-520
    2. Completeness of Neighbourhood Logic
      Rana Barua, Suman Roy, Zhou Chaochen
      Pages 521-530

About these proceedings

Keywords

Automat algorithms automata complexity computational geometry computer computer science data structures formal language formal languages logic verification

Editors and affiliations

  • Christoph Meinel
    • 1
  • Sophie Tison
    • 2
  1. 1.FB IV - InformatikUniversität TrierTrierGermany
  2. 2.LIFL, Université de Lille IVilleneuve d’Ascq CedexFrance

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-49116-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-65691-3
  • Online ISBN 978-3-540-49116-3
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site