↓ 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 Local Search: Simple, Successful, But Sometimes Sluggish
  3. Altmetric Badge
    Chapter 2 When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability
  4. Altmetric Badge
    Chapter 3 Plane Spanners of Maximum Degree Six
  5. Altmetric Badge
    Chapter 4 The Positive Semidefinite Grothendieck Problem with Rank Constraint
  6. Altmetric Badge
    Chapter 5 Cycle Detection and Correction
  7. Altmetric Badge
    Chapter 6 Decomposition Width of Matroids
  8. Altmetric Badge
    Chapter 7 The Cooperative Game Theory Foundations of Network Bargaining Games
  9. Altmetric Badge
    Chapter 8 On the Existence of Pure Nash Equilibria in Weighted Congestion Games
  10. Altmetric Badge
    Chapter 9 On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
  11. Altmetric Badge
    Chapter 10 Mean-Payoff Games and Propositional Proofs
  12. Altmetric Badge
    Chapter 11 Online Network Design with Outliers
  13. Altmetric Badge
    Chapter 12 Efficient Completely Non-malleable Public Key Encryption
  14. Altmetric Badge
    Chapter 13 Polynomial-Space Approximation of No-Signaling Provers
  15. Altmetric Badge
    Chapter 14 From Secrecy to Soundness: Efficient Verification via Secure Computation
  16. Altmetric Badge
    Chapter 15 Mergeable Dictionaries
  17. Altmetric Badge
    Chapter 16 Faster Algorithms for Semi-matching Problems (Extended Abstract)
  18. Altmetric Badge
    Chapter 17 Clustering with Diversity
  19. Altmetric Badge
    Chapter 18 New Data Structures for Subgraph Connectivity
  20. Altmetric Badge
    Chapter 19 Tight Thresholds for Cuckoo Hashing via XORSAT
  21. Altmetric Badge
    Chapter 20 Resource Oblivious Sorting on Multicores
  22. Altmetric Badge
    Chapter 21 Interval Sorting
  23. Altmetric Badge
    Chapter 22 Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
  24. Altmetric Badge
    Chapter 23 Thresholded Covering Algorithms for Robust and Max-min Optimization
  25. Altmetric Badge
    Chapter 24 Graph Homomorphisms with Complex Values: A Dichotomy Theorem
  26. Altmetric Badge
    Chapter 25 Metrical Task Systems and the k -Server Problem on HSTs
  27. Altmetric Badge
    Chapter 26 Scheduling Periodic Tasks in a Hard Real-Time Environment
  28. Altmetric Badge
    Chapter 27 Scalably Scheduling Power-Heterogeneous Processors
  29. Altmetric Badge
    Chapter 28 Better Scalable Algorithms for Broadcast Scheduling
  30. Altmetric Badge
    Chapter 29 Max-min Online Allocations with a Reordering Buffer
  31. Altmetric Badge
    Chapter 30 Orientability of Random Hypergraphs and the Power of Multiple Choices
  32. Altmetric Badge
    Chapter 31 On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
  33. Altmetric Badge
    Chapter 32 Dynamic Programming for Graphs on Surfaces
  34. Altmetric Badge
    Chapter 33 Interval Graphs: Canonical Representation in Logspace
  35. Altmetric Badge
    Chapter 34 Approximating the Partition Function of the Ferromagnetic Potts Model
  36. Altmetric Badge
    Chapter 35 On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
  37. Altmetric Badge
    Chapter 36 On Sums of Roots of Unity
  38. Altmetric Badge
    Chapter 37 Exponential Time Complexity of the Permanent and the Tutte Polynomial
  39. Altmetric Badge
    Chapter 38 On Approximate Horn Formula Minimization
  40. Altmetric Badge
    Chapter 39 Choosing, Agreeing, and Eliminating in Communication Complexity
  41. Altmetric Badge
    Chapter 40 Additive Spanners in Nearly Quadratic Time
  42. Altmetric Badge
    Chapter 41 Composition Theorems in Communication Complexity
  43. Altmetric Badge
    Chapter 42 Network Design via Core Detouring for Problems without a Core
  44. Altmetric Badge
    Chapter 43 Weak Completeness Notions for Exponential Time
  45. Altmetric Badge
    Chapter 44 Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
  46. Altmetric Badge
    Chapter 45 On the Complexity of Searching in Trees: Average-Case Minimization
  47. Altmetric Badge
    Chapter 46 Finding Is as Easy as Detecting for Quantum Walks
  48. Altmetric Badge
    Chapter 47 Improved Constructions for Non-adaptive Threshold Group Testing
  49. Altmetric Badge
    Chapter 48 Testing Non-uniform k -Wise Independent Distributions over Product Spaces
  50. Altmetric Badge
    Chapter 49 A Sublogarithmic Approximation for Highway and Tollbooth Pricing
  51. Altmetric Badge
    Chapter 50 Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
  52. Altmetric Badge
    Chapter 51 Cell Probe Lower Bounds and Approximations for Range Mode
  53. Altmetric Badge
    Chapter 52 SDP Gaps for 2-to-1 and Other Label-Cover Variants
  54. Altmetric Badge
    Chapter 53 Data Stream Algorithms for Codeword Testing
  55. Altmetric Badge
    Chapter 54 Streaming Algorithms for Independent Sets
  56. Altmetric Badge
    Chapter 55 Preprocessing of Min Ones Problems: A Dichotomy
  57. Altmetric Badge
    Chapter 56 Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems
  58. Altmetric Badge
    Chapter 57 Optimal Trade-Offs for Succinct String Indexes
  59. Altmetric Badge
    Chapter 58 Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
  60. Altmetric Badge
    Chapter 59 Concurrent Knowledge Extraction in the Public-Key Model
  61. Altmetric Badge
    Chapter 60 On the k -Independence Required by Linear Probing and Minwise Independence
  62. Altmetric Badge
    Chapter 61 Covering and Packing in Linear Space
  63. Altmetric Badge
    Chapter 62 Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s - t Paths in Digraphs
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
  • Good Attention Score compared to outputs of the same age (78th percentile)
  • High Attention Score compared to outputs of the same age and source (91st percentile)

Mentioned by

2 Q&A threads


1 Dimensions

Readers on

13 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.
Automata, Languages and Programming
Published by
Lecture notes in computer science, January 2010
DOI 10.1007/978-3-642-14165-2
978-3-64-214164-5, 978-3-64-214165-2

Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis


Abramsky, Samson, Gavoille, Cyril, Kirchner, Claude, Meyer auf der Heide, Friedhelm, Spirakis, Paul G.

Mendeley readers

The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Japan 1 8%
Unknown 12 92%

Demographic breakdown

Readers by professional status Count As %
Student > Master 4 31%
Student > Ph. D. Student 3 23%
Researcher 2 15%
Professor 2 15%
Unspecified 1 8%
Other 1 8%
Readers by discipline Count As %
Computer Science 12 92%
Unspecified 1 8%

Attention Score in Context

This research output has an Altmetric Attention Score of 5. 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 29 July 2012.
All research outputs
of 9,723,598 outputs
Outputs from Lecture notes in computer science
of 7,142 outputs
Outputs of similar age
of 89,592 outputs
Outputs of similar age from Lecture notes in computer science
of 73 outputs
Altmetric has tracked 9,723,598 research outputs across all sources so far. Compared to these this one has done well and is in the 78th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 7,142 research outputs from this source. They receive a mean Attention Score of 4.3. This one has done well, scoring higher than 78% 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 89,592 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 78% of its contemporaries.
We're also able to compare this research output to 73 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 91% of its contemporaries.