↓ 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 Improved Approximation for the Directed Spanner Problem
  3. Altmetric Badge
    Chapter 2 An Improved Approximation Algorithm for Minimum-Cost Subset k -Connectivity
  4. Altmetric Badge
    Chapter 3 Approximation Schemes for Capacitated Geometric Network Design
  5. Altmetric Badge
    Chapter 4 An O (log n )-Competitive Algorithm for Online Constrained Forest Problems
  6. Altmetric Badge
    Chapter 5 On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
  7. Altmetric Badge
    Chapter 6 Advice Coins for Classical and Quantum Computation
  8. Altmetric Badge
    Chapter 7 Quantum Commitments from Complexity Assumptions
  9. Altmetric Badge
    Chapter 8 Limitations on quantum dimensionality reduction
  10. Altmetric Badge
    Chapter 9 On Tree-Constrained Matchings and Generalizations
  11. Altmetric Badge
    Chapter 10 Tight Bounds for Linkages in Planar Graphs
  12. Altmetric Badge
    Chapter 11 A Tighter Insertion-Based Approximation of the Crossing Number
  13. Altmetric Badge
    Chapter 12 Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
  14. Altmetric Badge
    Chapter 13 Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
  15. Altmetric Badge
    Chapter 14 Pairwise-Interaction Games
  16. Altmetric Badge
    Chapter 15 Settling the Complexity of Local Max-Cut (Almost) Completely
  17. Altmetric Badge
    Chapter 16 Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
  18. Altmetric Badge
    Chapter 17 On Variants of File Caching
  19. Altmetric Badge
    Chapter 18 On the Advice Complexity of the k-Server Problem
  20. Altmetric Badge
    Chapter 19 Sleep Management on Multiple Machines for Energy and Flow Time
  21. Altmetric Badge
    Chapter 20 Meeting Deadlines: How Much Speed Suffices?
  22. Altmetric Badge
    Chapter 21 Range Majority in Constant Time and Linear Space
  23. Altmetric Badge
    Chapter 22 Dynamic Planar Range Maxima Queries
  24. Altmetric Badge
    Chapter 23 Compact Navigation and Distance Oracles for Graphs with Small Treewidth
  25. Altmetric Badge
    Chapter 24 Player-Centric Byzantine Agreement
  26. Altmetric Badge
    Chapter 25 Limits on the Computational Power of Random Strings
  27. Altmetric Badge
    Chapter 26 The Decimation Process in Random k -SAT
  28. Altmetric Badge
    Chapter 27 Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
  29. Altmetric Badge
    Chapter 28 The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions
  30. Altmetric Badge
    Chapter 29 Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
  31. Altmetric Badge
    Chapter 30 Submodular Cost Allocation Problem and Applications
  32. Altmetric Badge
    Chapter 31 Robust Independence Systems
  33. Altmetric Badge
    Chapter 32 Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
  34. Altmetric Badge
    Chapter 33 Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
  35. Altmetric Badge
    Chapter 34 Automata, Languages and Programming
  36. Altmetric Badge
    Chapter 35 Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
  37. Altmetric Badge
    Chapter 36 Constraint Satisfaction Parameterized by Solution Size
  38. Altmetric Badge
    Chapter 37 Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
  39. Altmetric Badge
    Chapter 38 Subset Feedback Vertex Set Is Fixed-Parameter Tractable
  40. Altmetric Badge
    Chapter 39 Domination When the Stars Are Out
  41. Altmetric Badge
    Chapter 40 A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
  42. Altmetric Badge
    Chapter 41 Recoverable Values for Independent Sets
  43. Altmetric Badge
    Chapter 42 Vertex Cover in Graphs with Locally Few Colors
  44. Altmetric Badge
    Chapter 43 Maximizing Polynomials Subject to Assignment Constraints
  45. Altmetric Badge
    Chapter 44 A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
  46. Altmetric Badge
    Chapter 45 Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width
  47. Altmetric Badge
    Chapter 46 Efficient Sample Extractors for Juntas with Applications
  48. Altmetric Badge
    Chapter 47 Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications
  49. Altmetric Badge
    Chapter 48 Robust Simulations and Significant Separations
  50. Altmetric Badge
    Chapter 49 A PCP Characterization of AM
  51. Altmetric Badge
    Chapter 50 Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
  52. Altmetric Badge
    Chapter 51 Automatizability and Simple Stochastic Games
  53. Altmetric Badge
    Chapter 52 Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds
  54. Altmetric Badge
    Chapter 53 Automata, Languages and Programming
  55. Altmetric Badge
    Chapter 54 On Minimal Unsatisfiability and Time-Space Trade-offs for k -DNF Resolution
  56. Altmetric Badge
    Chapter 55 Sorting by Transpositions Is Difficult
  57. Altmetric Badge
    Chapter 56 Popular Matchings in the Stable Marriage Problem
  58. Altmetric Badge
    Chapter 57 Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices
  59. Altmetric Badge
    Chapter 58 VC-Dimension and Shortest Path Algorithms
  60. Altmetric Badge
    Chapter 59 Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
  61. Altmetric Badge
    Chapter 60 The Complexity of Symmetric Boolean Parity Holant Problems
  62. Altmetric Badge
    Chapter 61 Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth
  63. Altmetric Badge
    Chapter 62 On the Power of Algebraic Branching Programs of Width Two
  64. Altmetric Badge
    Chapter 63 Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs
  65. Altmetric Badge
    Chapter 64 Steiner Transitive-Closure Spanners of Low-Dimensional Posets
  66. Altmetric Badge
    Chapter 65 Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
  67. Altmetric Badge
    Chapter 66 Clustering with Local Restrictions
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
1 X user

Readers on

mendeley
30 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, June 2011
DOI 10.1007/978-3-642-22006-7
ISBNs
978-3-64-222005-0, 978-3-64-222006-7
Editors

Aceto, Luca, Henzinger, Monika, Sgall, Jiří

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

Geographical breakdown

Country Count As %
United States 4 13%
Switzerland 2 7%
United Kingdom 2 7%
India 1 3%
Japan 1 3%
Canada 1 3%
Unknown 19 63%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 10 33%
Professor > Associate Professor 5 17%
Researcher 4 13%
Student > Bachelor 3 10%
Student > Postgraduate 3 10%
Other 5 17%
Readers by discipline Count As %
Computer Science 22 73%
Unspecified 2 7%
Mathematics 2 7%
Agricultural and Biological Sciences 1 3%
Social Sciences 1 3%
Other 2 7%