↓ Skip to main content

STACS 2002

Overview of attention for book
Cover of 'STACS 2002'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Hyper-Encryption and Everlasting Security
  3. Altmetric Badge
    Chapter 2 Models and Techniques for Communication in Dynamic Networks
  4. Altmetric Badge
    Chapter 3 What Is a Theory?
  5. Altmetric Badge
    Chapter 4 A Space Lower Bound for Routing in Trees
  6. Altmetric Badge
    Chapter 5 Labeling Schemes for Dynamic Tree Networks
  7. Altmetric Badge
    Chapter 6 Tight Bounds for the Performance of Longest-in-System on DAGs
  8. Altmetric Badge
    Chapter 7 Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling
  9. Altmetric Badge
    Chapter 8 Balanced Coloring: Equally Easy for All Numbers of Colors?
  10. Altmetric Badge
    Chapter 9 The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
  11. Altmetric Badge
    Chapter 10 On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
  12. Altmetric Badge
    Chapter 11 On Dualization in Products of Forests
  13. Altmetric Badge
    Chapter 12 An Asymptotic $$ \mathcal{O} $$ (ln ρ/ ln ln ρ)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs
  14. Altmetric Badge
    Chapter 13 Scheduling at Twilight the EasyWay
  15. Altmetric Badge
    Chapter 14 Complexity of Multi-dimensional Loop Alignment
  16. Altmetric Badge
    Chapter 15 A Probabilistic 3—SAT Algorithm Further Improved
  17. Altmetric Badge
    Chapter 16 The Secret of Selective Game Tree Search, When Using Random-Error Evaluations
  18. Altmetric Badge
    Chapter 17 Randomized Acceleration of Fundamental Matrix Computations
  19. Altmetric Badge
    Chapter 18 Approximations for ATSP with Parametrized Triangle Inequality
  20. Altmetric Badge
    Chapter 19 A New Diagram from Disks in the Plane
  21. Altmetric Badge
    Chapter 20 Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles
  22. Altmetric Badge
    Chapter 21 On the Parameterized Intractability of Closest Substring and Related Problems
  23. Altmetric Badge
    Chapter 22 On the Complexity of Protein Similarity Search under mRNA Structure Constraints
  24. Altmetric Badge
    Chapter 23 Pure Dominance Constraints
  25. Altmetric Badge
    Chapter 24 Improved Quantum Communication Complexity Bounds for Disjointness and Equality
  26. Altmetric Badge
    Chapter 25 On Quantum Computation with Some Restricted Amplitudes
  27. Altmetric Badge
    Chapter 26 A Quantum Goldreich-Levin Theorem with Cryptographic Applications
  28. Altmetric Badge
    Chapter 27 On Quantum and Approximate Privacy
  29. Altmetric Badge
    Chapter 28 On Quantum Versions of the Yao Principle
  30. Altmetric Badge
    Chapter 29 Describing Parameterized Complexity Classes
  31. Altmetric Badge
    Chapter 30 On the Computational Power of Boolean Decision Lists
  32. Altmetric Badge
    Chapter 31 How Many Missing Answers Can Be Tolerated by Query Learners?
  33. Altmetric Badge
    Chapter 32 Games with a Uniqueness Property
  34. Altmetric Badge
    Chapter 33 Bi-Immunity Separates Strong NP-Completeness Notions
  35. Altmetric Badge
    Chapter 34 Complexity of Semi-algebraic Proofs
  36. Altmetric Badge
    Chapter 35 A Lower Bound Technique for Restricted Branching Programs and Applications
  37. Altmetric Badge
    Chapter 36 The Complexity of Constraints on Intervals and Lengths
  38. Altmetric Badge
    Chapter 37 Nesting Until and Since in Linear Temporal Logic
  39. Altmetric Badge
    Chapter 38 Comparing Verboseness for Finite Automata and Turing Machines
  40. Altmetric Badge
    Chapter 39 On the Average Parallelism in Trace Monoids
  41. Altmetric Badge
    Chapter 40 A Further Step towards a Theory of Regular MSC Languages
  42. Altmetric Badge
    Chapter 41 Existential and Positive Theories of Equations in Graph Products
  43. Altmetric Badge
    Chapter 42 The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
  44. Altmetric Badge
    Chapter 43 Recognizable Sets of Message Sequence Charts
  45. Altmetric Badge
    Chapter 44 Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
  46. Altmetric Badge
    Chapter 45 On the Enumerative Sequences of Regular Languages on k Symbols
  47. Altmetric Badge
    Chapter 46 Ground Tree Rewriting Graphs of Bounded Tree Width
  48. Altmetric Badge
    Chapter 47 Timed Control Synthesis for External Specifications
  49. Altmetric Badge
    Chapter 48 Axiomatizing GSOS with Termination
  50. Altmetric Badge
    Chapter 49 Axiomatising Tree-Interpretable Structures
  51. Altmetric Badge
    Chapter 50 EXPSPACE-Complete Variant of Guarded Fragment with Transitivity
  52. Altmetric Badge
    Chapter 51 A Parametric Analysis of the State Explosion Problem in Model Checking
  53. Altmetric Badge
    Chapter 52 Generalized Model-Checking over Locally Tree-Decomposable Classes
  54. Altmetric Badge
    Chapter 53 Learnability and Definability in Trees and Similar Structures
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
10 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 2002
Published by
Springer Science & Business Media, February 2002
DOI 10.1007/3-540-45841-7
ISBNs
978-3-54-043283-8, 978-3-54-045841-8
Editors

Alt, Helmut, Ferreira, Afonso

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Canada 1 10%
Unknown 9 90%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 30%
Unknown 7 70%
Readers by discipline Count As %
Computer Science 2 20%
Engineering 1 10%
Unknown 7 70%