↓ Skip to main content

STACS 2001

Overview of attention for book
Cover of 'STACS 2001'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Recurrence in Infinite Words
  3. Altmetric Badge
    Chapter 2 Generalized Model-Checking Problems for First-Order Logic
  4. Altmetric Badge
    Chapter 3 Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
  5. Altmetric Badge
    Chapter 4 2-Nested Simulation Is Not Finitely Equationally Axiomatizable
  6. Altmetric Badge
    Chapter 5 On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems
  7. Altmetric Badge
    Chapter 6 Matching Polygonal Curves with Respect to the Fréchet Distance
  8. Altmetric Badge
    Chapter 7 On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
  9. Altmetric Badge
    Chapter 8 Star-Free Open Languages and Aperiodic Loops
  10. Altmetric Badge
    Chapter 9 A 5/2 n 2 -Lower Bound for the Multiplicative Complexity of n × n -Matrix Multiplication
  11. Altmetric Badge
    Chapter 10 Evasiveness of Subgraph Containment and Related Properties
  12. Altmetric Badge
    Chapter 11 On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
  13. Altmetric Badge
    Chapter 12 On Presburger Liveness of Discrete Timed Automata
  14. Altmetric Badge
    Chapter 13 Residual Finite State Automata
  15. Altmetric Badge
    Chapter 14 Deterministic Radio Broadcasting at Low Cost
  16. Altmetric Badge
    Chapter 15 The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE—Complete
  17. Altmetric Badge
    Chapter 16 Recursive Randomized Coloring Beats Fair Dice Random Colorings
  18. Altmetric Badge
    Chapter 17 Randomness, Computability, and Density
  19. Altmetric Badge
    Chapter 18 On Multipartition Communication Complexity
  20. Altmetric Badge
    Chapter 19 Scalable Sparse Topologies with Small Spectrum
  21. Altmetric Badge
    Chapter 20 Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios
  22. Altmetric Badge
    Chapter 21 The UPS Problem
  23. Altmetric Badge
    Chapter 22 Gathering of Asynchronous Oblivious Robots with Limited Visibility
  24. Altmetric Badge
    Chapter 23 Generalized Langton’s Ant: Dynamical Behavior and Complexity
  25. Altmetric Badge
    Chapter 24 Optimal and Approximate Station Placement in Networks
  26. Altmetric Badge
    Chapter 25 Learning Expressions over Monoids
  27. Altmetric Badge
    Chapter 26 Efficient Recognition of Random Unsatisfiable k -SAT Instances by Spectral Methods
  28. Altmetric Badge
    Chapter 27 On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
  29. Altmetric Badge
    Chapter 28 Efficient Minimal Perfect Hashing in Nearly Minimal Space
  30. Altmetric Badge
    Chapter 29 Small PCPs with Low Query Complexity
  31. Altmetric Badge
    Chapter 30 Space Efficient Algorithms for Series-Parallel Graphs
  32. Altmetric Badge
    Chapter 31 A Toolkit for First Order Extensions of Monadic Games
  33. Altmetric Badge
    Chapter 32 Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
  34. Altmetric Badge
    Chapter 33 Refining the Hierarchy of Blind Multicounter Languages
  35. Altmetric Badge
    Chapter 34 A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab * c
  36. Altmetric Badge
    Chapter 35 New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata
  37. Altmetric Badge
    Chapter 36 The Complexity of Minimal Satisfiability Problems
  38. Altmetric Badge
    Chapter 37 On the Minimal Hardware Complexity of Pseudorandom Function Generators
  39. Altmetric Badge
    Chapter 38 Approximation Algorithms for Minimum Size 2-Connectivity Problems
  40. Altmetric Badge
    Chapter 39 A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
  41. Altmetric Badge
    Chapter 40 An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases
  42. Altmetric Badge
    Chapter 41 A New Logical Characterization of Büchi Automata
  43. Altmetric Badge
    Chapter 42 A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph
  44. Altmetric Badge
    Chapter 43 The Complexity of Copy Constant Detection in Parallel Programs
  45. Altmetric Badge
    Chapter 44 Approximation Algorithms for the Bottleneck Stretch Factor Problem
  46. Altmetric Badge
    Chapter 45 Semantical Principles in the Modal Logic of Coalgebras
  47. Altmetric Badge
    Chapter 46 The #a = #b Pictures Are Recognizable
  48. Altmetric Badge
    Chapter 47 A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages
  49. Altmetric Badge
    Chapter 48 Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables
  50. Altmetric Badge
    Chapter 49 New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
9 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
STACS 2001
Published by
Springer Science & Business Media, February 2001
DOI 10.1007/3-540-44693-1
ISBNs
978-3-54-041695-1, 978-3-54-044693-4
Editors

Ferreira, Afonso, Reichel, Horst

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Germany 1 11%
Sweden 1 11%
United Kingdom 1 11%
Canada 1 11%
Belgium 1 11%
Japan 1 11%
Unknown 3 33%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 33%
Professor > Associate Professor 3 33%
Researcher 2 22%
Student > Postgraduate 1 11%
Readers by discipline Count As %
Computer Science 3 33%
Physics and Astronomy 2 22%
Mathematics 1 11%
Engineering 1 11%
Unknown 2 22%