↓ 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 Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method
  3. Altmetric Badge
    Chapter 2 The NOF Multiparty Communication Complexity of Composed Functions
  4. Altmetric Badge
    Chapter 3 Quantum Strategies Are Better Than Classical in Almost Any XOR Game
  5. Altmetric Badge
    Chapter 4 Efficient Submodular Function Maximization under Linear Packing Constraints
  6. Altmetric Badge
    Chapter 5 Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
  7. Altmetric Badge
    Chapter 6 Clustering under Perturbation Resilience
  8. Altmetric Badge
    Chapter 7 Secretary Problems with Convex Costs
  9. Altmetric Badge
    Chapter 8 Nearly Simultaneously Resettable Black-Box Zero Knowledge
  10. Altmetric Badge
    Chapter 9 Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
  11. Altmetric Badge
    Chapter 10 On Quadratic Programming with a Ratio Objective
  12. Altmetric Badge
    Chapter 11 De-amortizing Binary Search Trees
  13. Altmetric Badge
    Chapter 12 Efficient Sampling Methods for Discrete Distributions
  14. Altmetric Badge
    Chapter 13 Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
  15. Altmetric Badge
    Chapter 14 Improved LP-Rounding Approximation Algorithm for k -level Uncapacitated Facility Location
  16. Altmetric Badge
    Chapter 15 Testing Coverage Functions
  17. Altmetric Badge
    Chapter 16 Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree
  18. Altmetric Badge
    Chapter 17 A Dependent LP-Rounding Approach for the k -Median Problem
  19. Altmetric Badge
    Chapter 18 Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
  20. Altmetric Badge
    Chapter 19 Computing the Visibility Polygon of an Island in a Polygonal Domain
  21. Altmetric Badge
    Chapter 20 Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
  22. Altmetric Badge
    Chapter 21 Max-Cut Parameterized above the Edwards-Erdős Bound
  23. Altmetric Badge
    Chapter 22 Clique Cover and Graph Separation: New Incompressibility Results
  24. Altmetric Badge
    Chapter 23 The Inverse Shapley Value Problem
  25. Altmetric Badge
    Chapter 24 Zero-One Rounding of Singular Vectors
  26. Altmetric Badge
    Chapter 25 Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
  27. Altmetric Badge
    Chapter 26 Space-Constrained Interval Selection
  28. Altmetric Badge
    Chapter 27 Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
  29. Altmetric Badge
    Chapter 28 Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima
  30. Altmetric Badge
    Chapter 29 Universal Factor Graphs
  31. Altmetric Badge
    Chapter 30 Parameterized Approximation via Fidelity Preserving Transformations
  32. Altmetric Badge
    Chapter 31 Backdoors to Acyclic SAT
  33. Altmetric Badge
    Chapter 32 Dominators, Directed Bipolar Orders, and Independent Spanning Trees
  34. Altmetric Badge
    Chapter 33 Hardness of Approximation for Quantum Problems
  35. Altmetric Badge
    Chapter 34 The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)
  36. Altmetric Badge
    Chapter 35 Stochastic Vehicle Routing with Recourse
  37. Altmetric Badge
    Chapter 36 The Online Metric Matching Problem for Doubling Metrics
  38. Altmetric Badge
    Chapter 37 Approximating Sparse Covering Integer Programs Online
  39. Altmetric Badge
    Chapter 38 Streaming and Communication Complexity of Clique Approximation
  40. Altmetric Badge
    Chapter 39 Distributed Private Heavy Hitters
  41. Altmetric Badge
    Chapter 40 A Thirty Year Old Conjecture about Promise Problems
  42. Altmetric Badge
    Chapter 41 Minimum Latency Submodular Cover
  43. Altmetric Badge
    Chapter 42 Constant-Time Algorithms for Sparsity Matroids
  44. Altmetric Badge
    Chapter 43 CRAM: Compressed Random Access Memory
  45. Altmetric Badge
    Chapter 44 Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
  46. Altmetric Badge
    Chapter 45 Faster Fully Compressed Pattern Matching by Recompression
  47. Altmetric Badge
    Chapter 46 NNS Lower Bounds via Metric Expansion for l  ∞  and EMD
  48. Altmetric Badge
    Chapter 47 Quantum Adversary (Upper) Bound
  49. Altmetric Badge
    Chapter 48 Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
  50. Altmetric Badge
    Chapter 49 Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
  51. Altmetric Badge
    Chapter 50 Preserving Terminal Distances Using Minors
  52. Altmetric Badge
    Chapter 51 A Rounding by Sampling Approach to the Minimum Size k -Arc Connected Subgraph Problem
  53. Altmetric Badge
    Chapter 52 Classical and quantum partition bound and detector inefficiency
  54. Altmetric Badge
    Chapter 53 Testing Similar Means
  55. Altmetric Badge
    Chapter 54 The Parameterized Complexity of k -Edge Induced Subgraphs
  56. Altmetric Badge
    Chapter 55 Converting Online Algorithms to Local Computation Algorithms
  57. Altmetric Badge
    Chapter 56 Assigning Sporadic Tasks to Unrelated Parallel Machines
  58. Altmetric Badge
    Chapter 57 A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
  59. Altmetric Badge
    Chapter 58 The Power of Recourse for Online MST and TSP
  60. Altmetric Badge
    Chapter 59 Geometry of Online Packing Linear Programs
  61. Altmetric Badge
    Chapter 60 Self-assembly with Geometric Tiles
  62. Altmetric Badge
    Chapter 61 Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
  63. Altmetric Badge
    Chapter 62 Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions
  64. Altmetric Badge
    Chapter 63 Parameterized Tractability of Multiway Cut with Parity Constraints
  65. Altmetric Badge
    Chapter 64 Set Cover Revisited: Hypergraph Cover with Hard Capacities
  66. Altmetric Badge
    Chapter 65 On the Limits of Sparsification
  67. Altmetric Badge
    Chapter 66 Certifying 3-Connectivity in Linear Time
  68. Altmetric Badge
    Chapter 67 Epsilon-Net Method for Optimizations over Separable States
  69. Altmetric Badge
    Chapter 68 Faster Algorithms for Privately Releasing Marginals
  70. Altmetric Badge
    Chapter 69 Stochastic Matching with Commitment
  71. Altmetric Badge
    Chapter 70 Rademacher-Sketch : A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
  72. Altmetric Badge
    Chapter 71 A Matrix Hyperbolic Cosine Algorithm and Applications
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 5% 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
4 blogs
twitter
2 X users
wikipedia
2 Wikipedia pages
q&a
2 Q&A threads

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 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 2012
DOI 10.1007/978-3-642-31594-7
ISBNs
978-3-64-231593-0, 978-3-64-231594-7
Authors

Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer

Editors

Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 200%
Readers by discipline Count As %
Computer Science 1 100%
Psychology 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 36. 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 24 June 2021.
All research outputs
#1,142,366
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#132
of 8,229 outputs
Outputs of similar age
#6,847
of 255,923 outputs
Outputs of similar age from Lecture notes in computer science
#6
of 487 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 95th percentile: it's in the top 5% 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 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 255,923 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 487 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.