↓ Skip to main content

STACS 2003

Overview of attention for book
Cover of 'STACS 2003'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Logic as a Query Language: From Frege to XML
  3. Altmetric Badge
    Chapter 2 How Does Computer Science Change Molecular Biology?
  4. Altmetric Badge
    Chapter 3 Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer
  5. Altmetric Badge
    Chapter 4 Rectangle Visibility Graphs: Characterization, Construction, and Compaction
  6. Altmetric Badge
    Chapter 5 Approximating Geometric Bottleneck Shortest Paths
  7. Altmetric Badge
    Chapter 6 Optimization in Arrangements
  8. Altmetric Badge
    Chapter 7 Complete Classifications for the Communication Complexity of Regular Languages
  9. Altmetric Badge
    Chapter 8 The Commutation with Codes and Ternary Sets of Words
  10. Altmetric Badge
    Chapter 9 On the Confluence of Linear Shallow Term Rewrite Systems
  11. Altmetric Badge
    Chapter 10 Wadge Degrees of ω-Languages of Deterministic Turing Machines
  12. Altmetric Badge
    Chapter 11 Faster Deterministic Broadcasting in Ad Hoc Radio Networks
  13. Altmetric Badge
    Chapter 12 Private Computations in Networks: Topology versus Randomness
  14. Altmetric Badge
    Chapter 13 On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
  15. Altmetric Badge
    Chapter 14 Lattice Reduction by Random Sampling and Birthday Methods
  16. Altmetric Badge
    Chapter 15 On the Ultimate Complexity of Factorials
  17. Altmetric Badge
    Chapter 16 On the Effective Jordan Decomposability
  18. Altmetric Badge
    Chapter 17 Fast Algorithms for Extended Regular Expression Matching and Searching
  19. Altmetric Badge
    Chapter 18 Algorithms for Transposition Invariant String Matching (Extended Abstract)
  20. Altmetric Badge
    Chapter 19 On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets
  21. Altmetric Badge
    Chapter 20 Some Results on Derandomization
  22. Altmetric Badge
    Chapter 21 On the Representation of Boolean Predicates of the Diffie-Hellman Function
  23. Altmetric Badge
    Chapter 22 Quantum Circuits with Unbounded Fan-out
  24. Altmetric Badge
    Chapter 23 Analysis of the Harmonic Algorithm for Three Servers
  25. Altmetric Badge
    Chapter 24 Non-clairvoyant Scheduling for Minimizing Mean Slowdown
  26. Altmetric Badge
    Chapter 25 Space Efficient Hash Tables with Worst Case Constant Access Time
  27. Altmetric Badge
    Chapter 26 Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
  28. Altmetric Badge
    Chapter 27 Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs
  29. Altmetric Badge
    Chapter 28 Randomness versus Nondeterminism for Read-Once and Read-k Branching Programs
  30. Altmetric Badge
    Chapter 29 Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids
  31. Altmetric Badge
    Chapter 30 Algebraic Characterizations of Small Classes of Boolean Functions
  32. Altmetric Badge
    Chapter 31 On the Difficulty of Some Shortest Path Problems
  33. Altmetric Badge
    Chapter 32 Representing Graph Metrics with Fewest Edges
  34. Altmetric Badge
    Chapter 33 Computing Shortest Paths with Uncertainty
  35. Altmetric Badge
    Chapter 34 Solving Order Constraints in Logarithmic Space
  36. Altmetric Badge
    Chapter 35 The Inversion Problem for Computable Linear Operators
  37. Altmetric Badge
    Chapter 36 Algebras of Minimal Rank over Arbitrary Fields
  38. Altmetric Badge
    Chapter 37 Evolutionary Algorithms and the Maximum Matching Problem
  39. Altmetric Badge
    Chapter 38 Alternative Algorithms for Counting All Matchings in Graphs
  40. Altmetric Badge
    Chapter 39 Strong Stability in the Hospitals/Residents Problem
  41. Altmetric Badge
    Chapter 40 The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete
  42. Altmetric Badge
    Chapter 41 Decidable Theories of Cayley-Graphs
  43. Altmetric Badge
    Chapter 42 The Complexity of Resolution with Generalized Symmetry Rules
  44. Altmetric Badge
    Chapter 43 Colouring Random Graphs in Expected Polynomial Time
  45. Altmetric Badge
    Chapter 44 An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
  46. Altmetric Badge
    Chapter 45 Finding Large Independent Sets in Polynomial Expected Time
  47. Altmetric Badge
    Chapter 46 Distributed Soft Path Coloring
  48. Altmetric Badge
    Chapter 47 Competing Provers Yield Improved Karp-Lipton Collapse Results
  49. Altmetric Badge
    Chapter 48 One Bit of Advice
  50. Altmetric Badge
    Chapter 49 Strong Reductions and Immunity for Exponential Time
  51. Altmetric Badge
    Chapter 50 The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
  52. Altmetric Badge
    Chapter 51 Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem
  53. Altmetric Badge
    Chapter 52 Cake-Cutting Is Not a Piece of Cake
  54. Altmetric Badge
    Chapter 53 The Price of Truth: Frugality in Truthful Mechanisms
  55. Altmetric Badge
    Chapter 54 Untameable Timed Automata!
  56. Altmetric Badge
    Chapter 55 The Intrinsic Universality Problem of One-Dimensional Cellular Automata
  57. Altmetric Badge
    Chapter 56 On Sand Automata
  58. Altmetric Badge
    Chapter 57 Adaptive Sorting and the Information Theoretic Lower Bound
  59. Altmetric Badge
    Chapter 58 A Discrete Subexponential Algorithm for Parity Games
  60. Altmetric Badge
    Chapter 59 Cryptographically Sound and Machine-Assisted Verification of Security Protocols
  61. Altmetric Badge
    Chapter 60 Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
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
4 Dimensions

Readers on

mendeley
12 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 2003
Published by
Springer, Berlin, Heidelberg, January 2003
DOI 10.1007/3-540-36494-3
ISBNs
978-3-54-000623-7, 978-3-54-036494-8
Editors

Helmut Alt, Michel Habib

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 12 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 12 100%

Demographic breakdown

Readers by professional status Count As %
Student > Postgraduate 1 8%
Student > Master 1 8%
Unknown 10 83%
Readers by discipline Count As %
Computer Science 2 17%
Unknown 10 83%