↓ Skip to main content

Automata, Languages and Programming

Overview of attention for book
Cover of 'Automata, Languages and Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Polarized Process Algebra and Program Equivalence
  3. Altmetric Badge
    Chapter 2 Problems on RNA Secondary Structure Prediction and Design
  4. Altmetric Badge
    Chapter 3 Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks
  5. Altmetric Badge
    Chapter 4 The SPQR-Tree Data Structure in Graph Drawing
  6. Altmetric Badge
    Chapter 5 Model Checking and Testing Combined
  7. Altmetric Badge
    Chapter 6 Logic and Automata: A Match Made in Heaven
  8. Altmetric Badge
    Chapter 7 Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes
  9. Altmetric Badge
    Chapter 8 Generalized Framework for Selectors with Applications in Optimal Group Testing
  10. Altmetric Badge
    Chapter 9 Decoding of Interleaved Reed Solomon Codes over Noisy Data
  11. Altmetric Badge
    Chapter 10 On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
  12. Altmetric Badge
    Chapter 11 Resource Access and Mobility Control with Dynamic Privileges Acquisition
  13. Altmetric Badge
    Chapter 12 Replication vs. Recursive Definitions in Channel Based Calculi
  14. Altmetric Badge
    Chapter 13 Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
  15. Altmetric Badge
    Chapter 14 An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
  16. Altmetric Badge
    Chapter 15 An Improved Approximation Algorithm for Vertex Cover with Hard Capacities
  17. Altmetric Badge
    Chapter 16 Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem
  18. Altmetric Badge
    Chapter 17 Approximating Steiner k-Cuts
  19. Altmetric Badge
    Chapter 18 MAX k-CUT and Approximating the Chromatic Number of Random Graphs
  20. Altmetric Badge
    Chapter 19 Approximation Algorithm for Directed Telephone Multicast Problem
  21. Altmetric Badge
    Chapter 20 Mixin Modules and Computational Effects
  22. Altmetric Badge
    Chapter 21 Decision Problems for Language Equations with Boolean Operations
  23. Altmetric Badge
    Chapter 22 Generalized Rewrite Theories
  24. Altmetric Badge
    Chapter 23 Sophistication Revisited
  25. Altmetric Badge
    Chapter 24 Scaled Dimension and Nonuniform Complexity
  26. Altmetric Badge
    Chapter 25 Quantum Search on Bounded-Error Inputs
  27. Altmetric Badge
    Chapter 26 A Direct Sum Theorem in Communication Complexity via Message Compression
  28. Altmetric Badge
    Chapter 27 Optimal Cache-Oblivious Implicit Dictionaries
  29. Altmetric Badge
    Chapter 28 The Cell Probe Complexity of Succinct Data Structures
  30. Altmetric Badge
    Chapter 29 Succinct Representations of Permutations
  31. Altmetric Badge
    Chapter 30 Succinct Dynamic Dictionaries and Trees
  32. Altmetric Badge
    Chapter 31 Labeling Schemes for Weighted Dynamic Trees
  33. Altmetric Badge
    Chapter 32 A Simple Linear Time Algorithm for Computing a (2k — 1)-Spanner of O(n 1+1/k ) Size in Weighted Graphs
  34. Altmetric Badge
    Chapter 33 Multicommodity Flows over Time: Efficient Algorithms and Complexity
  35. Altmetric Badge
    Chapter 34 Multicommodity Demand Flow in a Tree
  36. Altmetric Badge
    Chapter 35 Skew and Infinitary Formal Power Series
  37. Altmetric Badge
    Chapter 36 Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser’s Separation
  38. Altmetric Badge
    Chapter 37 Residual Languages and Probabilistic Automata
  39. Altmetric Badge
    Chapter 38 A Testing Scenario for Probabilistic Automata
  40. Altmetric Badge
    Chapter 39 The Equivalence Problem for t-Turn DPDA Is Co-NP
  41. Altmetric Badge
    Chapter 40 Flip-Pushdown Automata: k + 1 Pushdown Reversals Are Better than k
  42. Altmetric Badge
    Chapter 41 Convergence Time to Nash Equilibria
  43. Altmetric Badge
    Chapter 42 Automata, Languages and Programming
  44. Altmetric Badge
    Chapter 43 Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution
  45. Altmetric Badge
    Chapter 44 An Intersection Inequality for Discrete Distributions and Related Generation Problems
  46. Altmetric Badge
    Chapter 45 Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games
  47. Altmetric Badge
    Chapter 46 Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes
  48. Altmetric Badge
    Chapter 47 Bisimulation Proof Methods for Mobile Ambients
  49. Altmetric Badge
    Chapter 48 On Equivalent Representations of Infinite Structures
  50. Altmetric Badge
    Chapter 49 Adaptive Raising Strategies Optimizing Relative Efficiency
  51. Altmetric Badge
    Chapter 50 A Competitive Algorithm for the General 2-Server Problem
  52. Altmetric Badge
    Chapter 51 On the Competitive Ratio for Online Facility Location
  53. Altmetric Badge
    Chapter 52 A Study of Integrated Document and Connection Caching
  54. Altmetric Badge
    Chapter 53 A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems
  55. Altmetric Badge
    Chapter 54 Monadic Second-Order Logics with Cardinalities
  56. Altmetric Badge
    Chapter 55 ∏2 ∩ Σ2 ≡ AFMC
  57. Altmetric Badge
    Chapter 56 Upper Bounds for a Theory of Queues
  58. Altmetric Badge
    Chapter 57 Automata, Languages and Programming
  59. Altmetric Badge
    Chapter 58 Similarity Matrices for Pairs of Graphs
  60. Altmetric Badge
    Chapter 59 Algorithmic Aspects of Bandwidth Trading
  61. Altmetric Badge
    Chapter 60 CTL+ Is Complete for Double Exponential Time
  62. Altmetric Badge
    Chapter 61 Hierarchical and Recursive State Machines with Context-Dependent Properties
  63. Altmetric Badge
    Chapter 62 Oracle Circuits for Branching-Time Model Checking
  64. Altmetric Badge
    Chapter 63 There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)
  65. Altmetric Badge
    Chapter 64 The Computational Complexity of the Role Assignment Problem
  66. Altmetric Badge
    Chapter 65 Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
  67. Altmetric Badge
    Chapter 66 Genus Characterizes the Complexity of Graph Problems: Some Tight Results
  68. Altmetric Badge
    Chapter 67 The Definition of a Temporal Clock Operator
  69. Altmetric Badge
    Chapter 68 Minimal Classical Logic and Control Operators
  70. Altmetric Badge
    Chapter 69 Counterexample-Guided Control
  71. Altmetric Badge
    Chapter 70 Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types
  72. Altmetric Badge
    Chapter 71 Efficient Pebbling for List Traversal Synopses
  73. Altmetric Badge
    Chapter 72 Function Matching: Algorithms, Applications, and a Lower Bound
  74. Altmetric Badge
    Chapter 73 Simple Linear Work Suffix Array Construction
  75. Altmetric Badge
    Chapter 74 Expansion Postponement via Cut Elimination in Sequent Calculi for Pure Type Systems
  76. Altmetric Badge
    Chapter 75 Secrecy in Untrusted Networks
  77. Altmetric Badge
    Chapter 76 Locally Commutative Categories
  78. Altmetric Badge
    Chapter 77 Semi-pullbacks and Bisimulations in Categories of Stochastic Relations
  79. Altmetric Badge
    Chapter 78 Quantitative Analysis of Probabilistic Lossy Channel Systems
  80. Altmetric Badge
    Chapter 79 Discounting the Future in Systems Theory
  81. Altmetric Badge
    Chapter 80 Information Flow in Concurrent Games
  82. Altmetric Badge
    Chapter 81 Impact of Local Topological Information on Random Walks on Finite Graphs
  83. Altmetric Badge
    Chapter 82 Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
  84. Altmetric Badge
    Chapter 83 Optimal Coding and Sampling of Triangulations
  85. Altmetric Badge
    Chapter 84 Generating Labeled Planar Graphs Uniformly at Random
  86. Altmetric Badge
    Chapter 85 Online Load Balancing Made Simple: Greedy Strikes Back
  87. Altmetric Badge
    Chapter 86 Real-Time Scheduling with a Budget
  88. Altmetric Badge
    Chapter 87 Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling
  89. Altmetric Badge
    Chapter 88 Anycasting in Adversarial Systems: Routing and Admission Control
  90. Altmetric Badge
    Chapter 89 Dynamic Algorithms for Approximating Interdistances
  91. Altmetric Badge
    Chapter 90 Solving the Robots Gathering Problem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
2 blogs
twitter
4 X users
wikipedia
15 Wikipedia pages

Citations

dimensions_citation
5 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
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, January 2003
DOI 10.1007/3-540-45061-0
ISBNs
978-3-54-040493-4, 978-3-54-045061-0
Editors

Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 X users 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 %
Professor 1 8%
Student > Ph. D. Student 1 8%
Professor > Associate Professor 1 8%
Unknown 9 75%
Readers by discipline Count As %
Computer Science 2 17%
Engineering 1 8%
Unknown 9 75%