↓ 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 Molecular Assembly and Computation: From Theory to Experimental Demonstrations
  3. Altmetric Badge
    Chapter 2 Towards a Predictive Computational Complexity Theory
  4. Altmetric Badge
    Chapter 3 Equivariant Syntax and Semantics
  5. Altmetric Badge
    Chapter 4 L(A) = L(B)? Decidability Results from Complete Formal Systems
  6. Altmetric Badge
    Chapter 5 Discrete Tomography: Reconstruction under Periodicity Constraints
  7. Altmetric Badge
    Chapter 6 Local and Global Methods in Data Mining: Basic Techniques and Open Problems
  8. Altmetric Badge
    Chapter 7 Program Debugging and Validation Using Semantic Approximations and Partial Specifications
  9. Altmetric Badge
    Chapter 8 Inapproximability Results for Equations over Finite Groups
  10. Altmetric Badge
    Chapter 9 A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
  11. Altmetric Badge
    Chapter 10 On Families of Graphs Having a Decidable First Order Theory with Reachability
  12. Altmetric Badge
    Chapter 11 Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
  13. Altmetric Badge
    Chapter 12 The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
  14. Altmetric Badge
    Chapter 13 Control Message Aggregation in Group Communication Protocols
  15. Altmetric Badge
    Chapter 14 Church-Rosser Languages vs. UCFL
  16. Altmetric Badge
    Chapter 15 Intersection of Regular Languages and Star Hierarchy
  17. Altmetric Badge
    Chapter 16 On the Construction of Reversible Automata for Reversible Languages
  18. Altmetric Badge
    Chapter 17 Priority Queues, Pairing, and Adaptive Sorting
  19. Altmetric Badge
    Chapter 18 Exponential Structures for Efficient Cache-Oblivious Algorithms
  20. Altmetric Badge
    Chapter 19 Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
  21. Altmetric Badge
    Chapter 20 On the Complexity of Resolution with Bounded Conjunctions
  22. Altmetric Badge
    Chapter 21 Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
  23. Altmetric Badge
    Chapter 22 Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
  24. Altmetric Badge
    Chapter 23 Exponential Lower Bound for Static Semi-algebraic Proofs
  25. Altmetric Badge
    Chapter 24 Paths Problems in Symmetric Logarithmic Space
  26. Altmetric Badge
    Chapter 25 Scheduling Search Procedures
  27. Altmetric Badge
    Chapter 26 Removable Online Knapsack Problems
  28. Altmetric Badge
    Chapter 27 New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
  29. Altmetric Badge
    Chapter 28 The Quest for Small Universal Cellular Automata
  30. Altmetric Badge
    Chapter 29 Hyperbolic Recognition by Graph Automata
  31. Altmetric Badge
    Chapter 30 Quantum and Stochastic Branching Programs of Bounded Width
  32. Altmetric Badge
    Chapter 31 Spanning Trees with Bounded Number of Branch Vertices
  33. Altmetric Badge
    Chapter 32 Energy Optimal Routing in Radio Networks Using Geometric Data Structures
  34. Altmetric Badge
    Chapter 33 Gossiping with Bounded Size Messages in ad hoc Radio Networks
  35. Altmetric Badge
    Chapter 34 The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences
  36. Altmetric Badge
    Chapter 35 The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
  37. Altmetric Badge
    Chapter 36 Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
  38. Altmetric Badge
    Chapter 37 Cache Oblivious Distribution Sweeping
  39. Altmetric Badge
    Chapter 38 One-Probe Search
  40. Altmetric Badge
    Chapter 39 New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
  41. Altmetric Badge
    Chapter 40 Measuring the Probabilistic Powerdomain
  42. Altmetric Badge
    Chapter 41 Games Characterizing Levy-Longo Trees
  43. Altmetric Badge
    Chapter 42 Comparing Functional Paradigms for Exact Real-Number Computation
  44. Altmetric Badge
    Chapter 43 Random Sampling from Boltzmann Principles
  45. Altmetric Badge
    Chapter 44 On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures
  46. Altmetric Badge
    Chapter 45 Bialgebraic Modelling of Timed Processes
  47. Altmetric Badge
    Chapter 46 Testing Labelled Markov Processes
  48. Altmetric Badge
    Chapter 47 Why Computational Complexity Requires Stricter Martingales
  49. Altmetric Badge
    Chapter 48 Correspondence Principles for Effective Dimensions
  50. Altmetric Badge
    Chapter 49 A Total Approach to Partial Algebraic Specification
  51. Altmetric Badge
    Chapter 50 Axiomatising Divergence
  52. Altmetric Badge
    Chapter 51 A Spatial Logic for Querying Graphs
  53. Altmetric Badge
    Chapter 52 Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network
  54. Altmetric Badge
    Chapter 53 Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
  55. Altmetric Badge
    Chapter 54 Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
  56. Altmetric Badge
    Chapter 55 Synthesis of Uninitialized Systems
  57. Altmetric Badge
    Chapter 56 Infinite-State High-Level MSCs: Model-Checking and Realizability
  58. Altmetric Badge
    Chapter 57 Universal Inherence of Cycle-Free Context-Free Ambiguity Functions
  59. Altmetric Badge
    Chapter 58 Histogramming Data Streams with Fast Per-Item Processing
  60. Altmetric Badge
    Chapter 59 Finding Frequent Items in Data Streams
  61. Altmetric Badge
    Chapter 60 Symbolic Strategy Synthesis for Games on Pushdown Graphs
  62. Altmetric Badge
    Chapter 61 Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
  63. Altmetric Badge
    Chapter 62 Solving the String Statistics Problem in Time $$ \mathcal{O} $$ ( n log n )
  64. Altmetric Badge
    Chapter 63 A PTAS for Distinguishing (Sub)string Selection
  65. Altmetric Badge
    Chapter 64 On the Theory of One-Step Rewriting in Trace Monoids
  66. Altmetric Badge
    Chapter 65 Navigating with a Browser
  67. Altmetric Badge
    Chapter 66 Improved Results for Stackelberg Scheduling Strategies
  68. Altmetric Badge
    Chapter 67 Call Control in Rings
  69. Altmetric Badge
    Chapter 68 Preemptive Scheduling in Overloaded Systems
  70. Altmetric Badge
    Chapter 69 The Equivalence Problem of Finite Substitutions on ab*c , with Applications
  71. Altmetric Badge
    Chapter 70 Deciding DPDA Equivalence Is Primitive Recursive
  72. Altmetric Badge
    Chapter 71 Two-Way Alternating Automata and Finite Models
  73. Altmetric Badge
    Chapter 72 Approximating Huffman Codes in Parallel
  74. Altmetric Badge
    Chapter 73 Seamless Integration of Parallelism and Memory Hierarchy
  75. Altmetric Badge
    Chapter 74 The Communication Complexity of Approximate Set Packing and Covering
  76. Altmetric Badge
    Chapter 75 Antirandomizing the Wrong Game
  77. Altmetric Badge
    Chapter 76 Fast Universalization of Investment Strategies with Provably Good Relative Returns
  78. Altmetric Badge
    Chapter 77 Randomized Pursuit-Evasion in Graphs
  79. Altmetric Badge
    Chapter 78 The Essence of Principal Typings
  80. Altmetric Badge
    Chapter 79 Complete and Tractable Local Linear Time Temporal Logics over Traces
  81. Altmetric Badge
    Chapter 80 An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
  82. Altmetric Badge
    Chapter 81 Random Numbers and an Incomplete Immune Recursive Set
  83. Altmetric Badge
    Chapter 82 A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers
  84. Altmetric Badge
    Chapter 83 Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
  85. Altmetric Badge
    Chapter 84 Finding a Path of Superlogarithmic Length
  86. Altmetric Badge
    Chapter 85 Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
  87. Altmetric Badge
    Chapter 86 Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs
  88. Altmetric Badge
    Chapter 87 Efficient Testing of Hypergraphs
  89. Altmetric Badge
    Chapter 88 Optimal Net Surface Problems with Applications
  90. Altmetric Badge
    Chapter 89 Wagner’s Theorem on Realizers
  91. Altmetric Badge
    Chapter 90 Circular Arrangements
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
2 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
25 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, June 2002
DOI 10.1007/3-540-45465-9
ISBNs
978-3-54-043864-9, 978-3-54-045465-6
Authors

Bender, Michael A., Cole, Richard, Raman, Rajeev

Editors

Widmayer, Peter, Eidenbenz, Stephan, Triguero, Francisco, Morales, Rafael, Conejo, Ricardo, Hennessy, Matthew

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 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 25 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Switzerland 1 4%
United Kingdom 1 4%
Canada 1 4%
Japan 1 4%
United States 1 4%
Unknown 20 80%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 9 36%
Student > Master 4 16%
Professor > Associate Professor 4 16%
Student > Bachelor 3 12%
Researcher 2 8%
Other 2 8%
Unknown 1 4%
Readers by discipline Count As %
Computer Science 19 76%
Mathematics 1 4%
Agricultural and Biological Sciences 1 4%
Physics and Astronomy 1 4%
Social Sciences 1 4%
Other 1 4%
Unknown 1 4%