↓ 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 Assigning Papers to Referees
  3. Altmetric Badge
    Chapter 2 Algorithmic Game Theory: A Snapshot
  4. Altmetric Badge
    Chapter 3 SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
  5. Altmetric Badge
    Chapter 4 Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
  6. Altmetric Badge
    Chapter 5 Sorting and Selection with Imprecise Comparisons
  7. Altmetric Badge
    Chapter 6 Fast FAST
  8. Altmetric Badge
    Chapter 7 Bounds on the Size of Small Depth Circuits for Approximating Majority
  9. Altmetric Badge
    Chapter 8 Counting Subgraphs via Homomorphisms
  10. Altmetric Badge
    Chapter 9 External Sampling
  11. Altmetric Badge
    Chapter 10 Functional Monitoring without Monotonicity
  12. Altmetric Badge
    Chapter 11 De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
  13. Altmetric Badge
    Chapter 12 Towards a Study of Low-Complexity Graphs
  14. Altmetric Badge
    Chapter 13 Decidability of Conjugacy of Tree-Shifts of Finite Type
  15. Altmetric Badge
    Chapter 14 Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
  16. Altmetric Badge
    Chapter 15 Competitive Analysis of Aggregate Max in Windowed Streaming
  17. Altmetric Badge
    Chapter 16 Faster Regular Expression Matching
  18. Altmetric Badge
    Chapter 17 A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
  19. Altmetric Badge
    Chapter 18 Unconditional Lower Bounds against Advice
  20. Altmetric Badge
    Chapter 19 Approximating Decision Trees with Multiway Branches
  21. Altmetric Badge
    Chapter 20 Annotations in Data Streams
  22. Altmetric Badge
    Chapter 21 Automata, Languages and Programming
  23. Altmetric Badge
    Chapter 22 A Graph Reduction Step Preserving Element-Connectivity and Applications
  24. Altmetric Badge
    Chapter 23 Approximating Matches Made in Heaven
  25. Altmetric Badge
    Chapter 24 Strong and Pareto Price of Anarchy in Congestion Games
  26. Altmetric Badge
    Chapter 25 A Better Algorithm for Random k -SAT
  27. Altmetric Badge
    Chapter 26 Exact and Approximate Bandwidth
  28. Altmetric Badge
    Chapter 27 Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
  29. Altmetric Badge
    Chapter 28 Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
  30. Altmetric Badge
    Chapter 29 On Cartesian Trees and Range Minimum Queries
  31. Altmetric Badge
    Chapter 30 Applications of a Splitting Trick
  32. Altmetric Badge
    Chapter 31 Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
  33. Altmetric Badge
    Chapter 32 Incompressibility through Colors and IDs
  34. Altmetric Badge
    Chapter 33 Partition Arguments in Multiparty Communication Complexity
  35. Altmetric Badge
    Chapter 34 High Complexity Tilings with Sparse Errors
  36. Altmetric Badge
    Chapter 35 Tight Bounds for the Cover Time of Multiple Random Walks
  37. Altmetric Badge
    Chapter 36 Online Computation with Advice
  38. Altmetric Badge
    Chapter 37 Dynamic Succinct Ordered Trees
  39. Altmetric Badge
    Chapter 38 Universal Succinct Representations of Trees?
  40. Altmetric Badge
    Chapter 39 Distortion Is Fixed Parameter Tractable
  41. Altmetric Badge
    Chapter 40 Towards Optimal Range Medians
  42. Altmetric Badge
    Chapter 41 B-Treaps: A Uniquely Represented Alternative to B-Trees
  43. Altmetric Badge
    Chapter 42 Testing Fourier Dimensionality and Sparsity
  44. Altmetric Badge
    Chapter 43 Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
  45. Altmetric Badge
    Chapter 44 Wireless Communication Is in APX
  46. Altmetric Badge
    Chapter 45 The Ehrenfeucht-Silberger Problem
  47. Altmetric Badge
    Chapter 46 Applications of Effective Probability Theory to Martin-Löf Randomness
  48. Altmetric Badge
    Chapter 47 An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
  49. Altmetric Badge
    Chapter 48 Popular Mixed Matchings
  50. Altmetric Badge
    Chapter 49 Factoring Groups Efficiently
  51. Altmetric Badge
    Chapter 50 On Finding Dense Subgraphs
  52. Altmetric Badge
    Chapter 51 Learning Halfspaces with Malicious Noise
  53. Altmetric Badge
    Chapter 52 General Scheme for Perfect Quantum Network Coding with Free Classical Communication
  54. Altmetric Badge
    Chapter 53 Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
  55. Altmetric Badge
    Chapter 54 Limits and Applications of Group Algebras for Parameterized Problems
  56. Altmetric Badge
    Chapter 55 Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
  57. Altmetric Badge
    Chapter 56 Improved Bounds for Flow Shop Scheduling
  58. Altmetric Badge
    Chapter 57 A 3/2-Approximation Algorithm for General Stable Marriage
  59. Altmetric Badge
    Chapter 58 Limiting Negations in Formulas
  60. Altmetric Badge
    Chapter 59 Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
  61. Altmetric Badge
    Chapter 60 Superhighness and Strong Jump Traceability
  62. Altmetric Badge
    Chapter 61 Amortized Communication Complexity of Distributions
  63. Altmetric Badge
    Chapter 62 The Number of Symbol Comparisons in QuickSort and QuickSelect
  64. Altmetric Badge
    Chapter 63 Computing the Girth of a Planar Graph in O ( n log n ) Time
  65. Altmetric Badge
    Chapter 64 Elimination Graphs
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 (95th percentile)
  • High Attention Score compared to outputs of the same age and source (97th percentile)

Mentioned by

blogs
2 blogs
twitter
1 X user
wikipedia
12 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
2 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
ADS, July 2009
DOI 10.1007/978-3-642-02927-1
ISBNs
978-3-64-202926-4, 978-3-64-202927-1
Editors

Albers, Susanne, Marchetti-Spaccamela, Alberto, Matias, Yossi, Nikoletseas, Sotiris, Thomas, Wolfgang

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Unspecified 1 50%
Student > Master 1 50%
Readers by discipline Count As %
Computer Science 2 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 23. 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 03 December 2023.
All research outputs
#1,468,228
of 23,330,477 outputs
Outputs from ADS
#713
of 37,912 outputs
Outputs of similar age
#4,567
of 111,588 outputs
Outputs of similar age from ADS
#9
of 302 outputs
Altmetric has tracked 23,330,477 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 93rd percentile: it's in the top 10% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 37,912 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done particularly well, scoring higher than 98% 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 111,588 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 95% of its contemporaries.
We're also able to compare this research output to 302 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 97% of its contemporaries.