↓ 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 Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
  3. Altmetric Badge
    Chapter 2 Internet Ad Auctions: Insights and Directions
  4. Altmetric Badge
    Chapter 3 The Complexity of Boolean Formula Minimization
  5. Altmetric Badge
    Chapter 4 Optimal Cryptographic Hardness of Learning Monotone Functions
  6. Altmetric Badge
    Chapter 5 On Berge Multiplication for Monotone Boolean Dualization
  7. Altmetric Badge
    Chapter 6 Diagonal Circuit Identity Testing and Lower Bounds
  8. Altmetric Badge
    Chapter 7 Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity
  9. Altmetric Badge
    Chapter 8 Constructing Efficient Dictionaries in Close to Sorting Time
  10. Altmetric Badge
    Chapter 9 On List Update with Locality of Reference
  11. Altmetric Badge
    Chapter 10 A New Combinatorial Approach for Sparse Graph Problems
  12. Altmetric Badge
    Chapter 11 How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
  13. Altmetric Badge
    Chapter 12 Networks Become Navigable as Nodes Move and Forget
  14. Altmetric Badge
    Chapter 13 Fast Distributed Computation of Cuts Via Random Circulations
  15. Altmetric Badge
    Chapter 14 Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
  16. Altmetric Badge
    Chapter 15 Function Evaluation Via Linear Programming in the Priced Information Model
  17. Altmetric Badge
    Chapter 16 Improved Approximation Algorithms for Budgeted Allocations
  18. Altmetric Badge
    Chapter 17 The Travelling Salesman Problem in Bounded Degree Graphs
  19. Altmetric Badge
    Chapter 18 Treewidth Computation and Extremal Combinatorics
  20. Altmetric Badge
    Chapter 19 Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
  21. Altmetric Badge
    Chapter 20 Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
  22. Altmetric Badge
    Chapter 21 A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
  23. Altmetric Badge
    Chapter 22 Optimal Monotone Encodings
  24. Altmetric Badge
    Chapter 23 Polynomial-Time Construction of Linear Network Coding
  25. Altmetric Badge
    Chapter 24 Complexity of Decoding Positive-Rate Reed-Solomon Codes
  26. Altmetric Badge
    Chapter 25 Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
  27. Altmetric Badge
    Chapter 26 The Randomized Coloring Procedure with Symmetry-Breaking
  28. Altmetric Badge
    Chapter 27 The Local Nature of List Colorings for Graphs of High Girth
  29. Altmetric Badge
    Chapter 28 Approximating List-Coloring on a Fixed Surface
  30. Altmetric Badge
    Chapter 29 Asymptotically Optimal Hitting Sets Against Polynomials
  31. Altmetric Badge
    Chapter 30 The Smoothed Complexity of Edit Distance
  32. Altmetric Badge
    Chapter 31 Randomized Self-assembly for Approximate Shapes
  33. Altmetric Badge
    Chapter 32 Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
  34. Altmetric Badge
    Chapter 33 Competitive Weighted Matching in Transversal Matroids
  35. Altmetric Badge
    Chapter 34 Scheduling for Speed Bounded Processors
  36. Altmetric Badge
    Chapter 35 Faster Algorithms for Incremental Topological Ordering
  37. Altmetric Badge
    Chapter 36 Dynamic Normal Forms and Dynamic Characteristic Polynomial
  38. Altmetric Badge
    Chapter 37 Algorithms for ε-Approximations of Terrains
  39. Altmetric Badge
    Chapter 38 An Approximation Algorithm for Binary Searching in Trees
  40. Altmetric Badge
    Chapter 39 Algorithms for 2-Route Cut Problems
  41. Altmetric Badge
    Chapter 40 The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
  42. Altmetric Badge
    Chapter 41 Efficiently Testing Sparse GF(2) Polynomials
  43. Altmetric Badge
    Chapter 42 Testing Properties of Sets of Points in Metric Spaces
  44. Altmetric Badge
    Chapter 43 An Expansion Tester for Bounded Degree Graphs
  45. Altmetric Badge
    Chapter 44 Property Testing on k-Vertex-Connectivity of Graphs
  46. Altmetric Badge
    Chapter 45 Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
  47. Altmetric Badge
    Chapter 46 On Problems without Polynomial Kernels (Extended Abstract)
  48. Altmetric Badge
    Chapter 47 Faster Algebraic Algorithms for Path and Packing Problems
  49. Altmetric Badge
    Chapter 48 Understanding the Complexity of Induced Subgraph Isomorphisms
  50. Altmetric Badge
    Chapter 49 Spanners in Sparse Graphs
  51. Altmetric Badge
    Chapter 50 Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
  52. Altmetric Badge
    Chapter 51 All-Pairs Shortest Paths with a Sublinear Additive Error
  53. Altmetric Badge
    Chapter 52 Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
  54. Altmetric Badge
    Chapter 53 The Complexity of the Counting Constraint Satisfaction Problem
  55. Altmetric Badge
    Chapter 54 On the Hardness of Losing Weight
  56. Altmetric Badge
    Chapter 55 Product Theorems Via Semidefinite Programming
  57. Altmetric Badge
    Chapter 56 Sound 3-Query PCPPs Are Long
  58. Altmetric Badge
    Chapter 57 Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
  59. Altmetric Badge
    Chapter 58 Automata, Languages and Programming
  60. Altmetric Badge
    Chapter 59 Complementation, Disambiguation, and Determinization of Büchi Automata Unified
  61. Altmetric Badge
    Chapter 60 Tree Projections: Hypergraph Games and Minimality
  62. Altmetric Badge
    Chapter 61 Explicit Non-adaptive Combinatorial Group Testing Schemes
  63. Altmetric Badge
    Chapter 62 Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination
  64. Altmetric Badge
    Chapter 63 Impossibility of a Quantum Speed-Up with a Faulty Oracle
  65. Altmetric Badge
    Chapter 64 Superpolynomial speedups based on almost any quantum circuit
  66. Altmetric Badge
    Chapter 65 The Speed of Convergence in Congestion Games under Best-Response Dynamics
  67. Altmetric Badge
    Chapter 66 Uniform Budgets and the Envy-Free Pricing Problem
  68. Altmetric Badge
    Chapter 67 Automata, Languages and Programming
  69. Altmetric Badge
    Chapter 68 Truthful Unification Framework for Packing Integer Programs with Choices
  70. Altmetric Badge
    Chapter 69 Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
  71. Altmetric Badge
    Chapter 70 Finding Optimal Flows Efficiently
  72. Altmetric Badge
    Chapter 71 Optimal Quantum Adversary Lower Bounds for Ordered Search
  73. Altmetric Badge
    Chapter 72 Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete
  74. Altmetric Badge
    Chapter 73 Superpolynomial Speedups Based on Almost Any Quantum Circuit
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (96th percentile)
  • High Attention Score compared to outputs of the same age and source (98th percentile)

Mentioned by

blogs
2 blogs
twitter
1 X user
wikipedia
20 Wikipedia pages
q&a
2 Q&A threads

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
46 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
Lecture notes in computer science, January 2008
DOI 10.1007/978-3-540-70575-8
ISBNs
978-3-54-070574-1, 978-3-54-070575-8
Editors

Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz

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

Geographical breakdown

Country Count As %
Unknown 46 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 2%
Student > Ph. D. Student 1 2%
Professor > Associate Professor 1 2%
Unknown 43 93%
Readers by discipline Count As %
Computer Science 3 7%
Unknown 43 93%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 29. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 02 April 2024.
All research outputs
#1,353,549
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#183
of 8,229 outputs
Outputs of similar age
#4,075
of 173,545 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 86 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 94th percentile: it's in the top 10% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,229 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.3. This one has done particularly well, scoring higher than 97% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 173,545 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 96% of its contemporaries.
We're also able to compare this research output to 86 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 98% of its contemporaries.