↓ 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 Ushering in a New Era of Algorithm Design
  3. Altmetric Badge
    Chapter 2 A “proof-reading” of Some Issues in Cryptography
  4. Altmetric Badge
    Chapter 3 Credentials-Based Authorization: Evaluation and Implementation
  5. Altmetric Badge
    Chapter 4 Subexponential Parameterized Algorithms
  6. Altmetric Badge
    Chapter 5 Competitive Algorithms for Due Date Scheduling
  7. Altmetric Badge
    Chapter 6 Mechanism Design for Fractional Scheduling on Unrelated Machines
  8. Altmetric Badge
    Chapter 7 Estimating Sum by Weighted Sampling
  9. Altmetric Badge
    Chapter 8 Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
  10. Altmetric Badge
    Chapter 9 Low Distortion Spanners
  11. Altmetric Badge
    Chapter 10 Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
  12. Altmetric Badge
    Chapter 11 Labeling Schemes for Vertex Connectivity
  13. Altmetric Badge
    Chapter 12 Unbounded-Error One-Way Classical and Quantum Communication Complexity
  14. Altmetric Badge
    Chapter 13 Automata, Languages and Programming
  15. Altmetric Badge
    Chapter 14 Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
  16. Altmetric Badge
    Chapter 15 An Optimal Decomposition Algorithm for Tree Edit Distance
  17. Altmetric Badge
    Chapter 16 On Commutativity Based Edge Lean Search
  18. Altmetric Badge
    Chapter 17 Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
  19. Altmetric Badge
    Chapter 18 On the Complexity of Hard-Core Set Constructions
  20. Altmetric Badge
    Chapter 19 Approximation by DNF: Examples and Counterexamples
  21. Altmetric Badge
    Chapter 20 Exotic Quantifiers, Complexity Classes, and Complete Problems
  22. Altmetric Badge
    Chapter 21 Online Conflict-Free Colorings for Hypergraphs
  23. Altmetric Badge
    Chapter 22 Distributed Computing with Advice: Information Sensitivity of Graph Coloring
  24. Altmetric Badge
    Chapter 23 Private Multiparty Sampling and Approximation of Vector Combinations
  25. Altmetric Badge
    Chapter 24 Constant-Round Private Database Queries
  26. Altmetric Badge
    Chapter 25 Universal Algebra and Hardness Results for Constraint Satisfaction Problems
  27. Altmetric Badge
    Chapter 26 On the Power of k-Consistency
  28. Altmetric Badge
    Chapter 27 Complexity of Propositional Proofs Under a Promise
  29. Altmetric Badge
    Chapter 28 Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
  30. Altmetric Badge
    Chapter 29 Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
  31. Altmetric Badge
    Chapter 30 A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
  32. Altmetric Badge
    Chapter 31 Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
  33. Altmetric Badge
    Chapter 32 Parameterized Algorithms for Directed Maximum Leaf Problems
  34. Altmetric Badge
    Chapter 33 Parameterized Approximability of the Disjoint Cycle Problem
  35. Altmetric Badge
    Chapter 34 Linear Problem Kernels for NP-Hard Problems on Planar Graphs
  36. Altmetric Badge
    Chapter 35 Private Locally Decodable Codes
  37. Altmetric Badge
    Chapter 36 Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
  38. Altmetric Badge
    Chapter 37 Unrestricted Aggregate Signatures
  39. Altmetric Badge
    Chapter 38 Ring Signatures of Sub-linear Size Without Random Oracles
  40. Altmetric Badge
    Chapter 39 Balanced Families of Perfect Hash Functions and Their Applications
  41. Altmetric Badge
    Chapter 40 An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks
  42. Altmetric Badge
    Chapter 41 Modular Algorithms for Heterogeneous Modal Logics
  43. Altmetric Badge
    Chapter 42 Co-Logic Programming: Extending Logic Programming with Coinduction
  44. Altmetric Badge
    Chapter 43 Offline/Online Mixing
  45. Altmetric Badge
    Chapter 44 Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys
  46. Altmetric Badge
    Chapter 45 Succinct Ordinal Trees Based on Tree Covering
  47. Altmetric Badge
    Chapter 46 A Framework for Dynamizing Succinct Data Structures
  48. Altmetric Badge
    Chapter 47 In-Place Suffix Sorting
  49. Altmetric Badge
    Chapter 48 Maximal Infinite-Valued Constraint Languages
  50. Altmetric Badge
    Chapter 49 Affine Systems of Equations and Counting Infinitary Logic
  51. Altmetric Badge
    Chapter 50 Boundedness of Monadic FO over Acyclic Structures
  52. Altmetric Badge
    Chapter 51 Strong Price of Anarchy for Machine Load Balancing
  53. Altmetric Badge
    Chapter 52 Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
  54. Altmetric Badge
    Chapter 53 Automata, Languages and Programming
  55. Altmetric Badge
    Chapter 54 Categorical Views on Computations on Trees (Extended Abstract)
  56. Altmetric Badge
    Chapter 55 Holographic Algorithms: The Power of Dimensionality Resolved
  57. Altmetric Badge
    Chapter 56 Reconciling Data Compression and Kolmogorov Complexity
  58. Altmetric Badge
    Chapter 57 Size Competitive Meshing Without Large Angles
  59. Altmetric Badge
    Chapter 58 A Fully Abstract Trace Semantics for General References
  60. Altmetric Badge
    Chapter 59 Aliased Register Allocation for Straight-Line Programs Is NP-Complete
  61. Altmetric Badge
    Chapter 60 Conservative Ambiguity Detection in Context-Free Grammars
  62. Altmetric Badge
    Chapter 61 Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
  63. Altmetric Badge
    Chapter 62 Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
  64. Altmetric Badge
    Chapter 63 Checking and Spot-Checking the Correctness of Priority Queues
  65. Altmetric Badge
    Chapter 64 Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
  66. Altmetric Badge
    Chapter 65 Ready Simulation for Concurrency: It’s Logical!
  67. Altmetric Badge
    Chapter 66 Continuous Capacities on Continuous State Spaces
  68. Altmetric Badge
    Chapter 67 On the Chromatic Number of Random Graphs
  69. Altmetric Badge
    Chapter 68 Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
  70. Altmetric Badge
    Chapter 69 Complexity of the Cover Polynomial
  71. Altmetric Badge
    Chapter 70 A Generalization of Cobham’s Theorem to Automata over Real Numbers
  72. Altmetric Badge
    Chapter 71 Minimum-Time Reachability in Timed Games
  73. Altmetric Badge
    Chapter 72 Reachability-Time Games on Timed Automata
  74. Altmetric Badge
    Chapter 73 Perfect Information Stochastic Priority Games
  75. Altmetric Badge
    Chapter 74 Bounded Depth Data Trees
  76. Altmetric Badge
    Chapter 75 Unranked Tree Automata with Sibling Equalities and Disequalities
  77. Altmetric Badge
    Chapter 76 Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
  78. Altmetric Badge
    Chapter 77 A Combinatorial Theorem for Trees
  79. Altmetric Badge
    Chapter 78 Model Theory Makes Formulas Large
  80. Altmetric Badge
    Chapter 79 Decision Problems for Lower/Upper Bound Parametric Timed Automata
  81. Altmetric Badge
    Chapter 80 On the Complexity of Ltl Model-Checking of Recursive State Machines
  82. Altmetric Badge
    Chapter 81 Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
4 X users
patent
1 patent
wikipedia
5 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
11 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 2007
DOI 10.1007/978-3-540-73420-8
ISBNs
978-3-54-073419-2, 978-3-54-073420-8
Editors

Lars Arge, Christian Cachin, Tomasz Jurdziński, Andrzej Tarlecki

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

Geographical breakdown

Country Count As %
Japan 1 9%
Unknown 10 91%

Demographic breakdown

Readers by professional status Count As %
Student > Master 3 27%
Student > Ph. D. Student 3 27%
Professor 1 9%
Student > Postgraduate 1 9%
Researcher 1 9%
Other 2 18%
Readers by discipline Count As %
Computer Science 10 91%
Agricultural and Biological Sciences 1 9%