↓ Skip to main content

STACS 99

Overview of attention for book
Cover of 'STACS 99'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Algorithms for Selfish Agents
  3. Altmetric Badge
    Chapter 2 The Reduced Genus of a Multigraph
  4. Altmetric Badge
    Chapter 3 Classifying Discrete Temporal Properties
  5. Altmetric Badge
    Chapter 4 Circuit Complexity of Testing Square-Free Numbers
  6. Altmetric Badge
    Chapter 5 Relating Branching Program Size and Formula Size over the Full Binary Basis
  7. Altmetric Badge
    Chapter 6 Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines
  8. Altmetric Badge
    Chapter 7 The Average Time Complexity to Compute Prefix Functions in Processor Networks
  9. Altmetric Badge
    Chapter 8 On the Hardness of Permanent
  10. Altmetric Badge
    Chapter 9 One-Sided Versus Two-Sided Error in Probabilistic Computation
  11. Altmetric Badge
    Chapter 10 An Optimal Competitive Strategy for Walking in Streets
  12. Altmetric Badge
    Chapter 11 An Optimal Strategy for Searching in Unknown Streets
  13. Altmetric Badge
    Chapter 12 Parallel Searching on m Rays
  14. Altmetric Badge
    Chapter 13 A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
  15. Altmetric Badge
    Chapter 14 Descriptive Complexity of Computable Sequences
  16. Altmetric Badge
    Chapter 15 Complexity of Some Problems in Universal Algebra
  17. Altmetric Badge
    Chapter 16 New Branchwidth Territories
  18. Altmetric Badge
    Chapter 17 Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
  19. Altmetric Badge
    Chapter 18 Treewidth and Minimum Fill-In of Weakly Triangulated Graphs
  20. Altmetric Badge
    Chapter 19 Decidability and Undecidability of Marked PCP
  21. Altmetric Badge
    Chapter 20 On Quadratic Word Equations
  22. Altmetric Badge
    Chapter 21 Some Undecidability Results Related to the Star Problem in Trace Monoids
  23. Altmetric Badge
    Chapter 22 An Approximation Algorithm for Max p -Section
  24. Altmetric Badge
    Chapter 23 Approximating Bandwidth by Mixing Layouts of Interval Graphs
  25. Altmetric Badge
    Chapter 24 Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
  26. Altmetric Badge
    Chapter 25 Extending Downward Collapse from 1-versus-2 Queries to j -versus- j + 1 Queries
  27. Altmetric Badge
    Chapter 26 Sparse Sets, Approximable Sets, and Parallel Queries to NP
  28. Altmetric Badge
    Chapter 27 External Selection
  29. Altmetric Badge
    Chapter 28 Fast Computations of the Exponential Function
  30. Altmetric Badge
    Chapter 29 A Model of Behaviour Abstraction for Communicating Processes
  31. Altmetric Badge
    Chapter 30 Model Checking Lossy Vector Addition Systems
  32. Altmetric Badge
    Chapter 31 Constructing Light Spanning Trees with Small Routing Cost
  33. Altmetric Badge
    Chapter 32 Finding Paths with the Right Cost
  34. Altmetric Badge
    Chapter 33 In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
  35. Altmetric Badge
    Chapter 34 Lower Bounds for Dynamic Algebraic Problems
  36. Altmetric Badge
    Chapter 35 An Explicit Lower Bound for TSP with Distances One and Two
  37. Altmetric Badge
    Chapter 36 Scheduling Dynamic Graphs
  38. Altmetric Badge
    Chapter 37 Supporting Increment and Decrement Operations in Balancing Networks
  39. Altmetric Badge
    Chapter 38 Worst-Case Equilibria
  40. Altmetric Badge
    Chapter 39 A Complete and Tight Average-Case Analysis of Learning Monomials
  41. Altmetric Badge
    Chapter 40 Costs of General Purpose Learning
  42. Altmetric Badge
    Chapter 41 Universal Distributions and Time-Bounded Kolmogorov Complexity
  43. Altmetric Badge
    Chapter 42 The Descriptive Complexity Approach to LOGCFL
  44. Altmetric Badge
    Chapter 43 The Weakness of Self-Complementation
  45. Altmetric Badge
    Chapter 44 On the Difference of Horn Theories
  46. Altmetric Badge
    Chapter 45 On Quantum Algorithms for Noncommutative Hidden Subgroups
  47. Altmetric Badge
    Chapter 46 On the Size of Randomized OBDDs and Read-Once Branching Programs for k -Stable Functions
  48. Altmetric Badge
    Chapter 47 How To Forget a Secret
  49. Altmetric Badge
    Chapter 48 A Modal Fixpoint Logic with Chop
  50. Altmetric Badge
    Chapter 49 Completeness of Neighbourhood Logic
  51. Altmetric Badge
    Chapter 50 Eliminating Recursion in the μ-Calculus
  52. Altmetric Badge
    Chapter 51 On Optimal Algorithms and Optimal Proof Systems
  53. Altmetric Badge
    Chapter 52 Space Bounds for Resolution
  54. Altmetric Badge
    Chapter 53 Upper Bounds for Vertex Cover Further Improved
  55. Altmetric Badge
    Chapter 54 Online Matching for Scheduling Problems
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
12 Wikipedia pages
q&a
1 Q&A thread

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 99
Published by
Springer Science & Business Media, February 1999
DOI 10.1007/3-540-49116-3
ISBNs
978-3-54-065691-3, 978-3-54-049116-3
Editors

Meinel, Christoph, Tison, Sophie

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
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%
Unknown 8 89%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 44%
Researcher 1 11%
Student > Doctoral Student 1 11%
Unknown 3 33%
Readers by discipline Count As %
Computer Science 2 22%
Mathematics 1 11%
Arts and Humanities 1 11%
Business, Management and Accounting 1 11%
Engineering 1 11%
Other 0 0%
Unknown 3 33%