↓ 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 On Multiple Keyword Sponsored Search Auctions with Budgets
  3. Altmetric Badge
    Chapter 2 A Theory Independent Curry-De Bruijn-Howard Correspondence
  4. Altmetric Badge
    Chapter 3 Standing on the Shoulders of a Giant
  5. Altmetric Badge
    Chapter 4 Session Types and Distributed Computing
  6. Altmetric Badge
    Chapter 5 Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations
  7. Altmetric Badge
    Chapter 6 Randomized Mechanisms for Multi-unit Auctions
  8. Altmetric Badge
    Chapter 7 Algebraic Synchronization Trees and Processes
  9. Altmetric Badge
    Chapter 8 Streaming Tree Transducers
  10. Altmetric Badge
    Chapter 9 Causal Graph Dynamics
  11. Altmetric Badge
    Chapter 10 Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers
  12. Altmetric Badge
    Chapter 11 Monadic Datalog Containment
  13. Altmetric Badge
    Chapter 12 A Machine-Independent Characterization of Timed Languages
  14. Altmetric Badge
    Chapter 13 Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
  15. Altmetric Badge
    Chapter 14 Toward Model Theory with Data Values
  16. Altmetric Badge
    Chapter 15 Robust Reachability in Timed Automata: A Game-Based Approach
  17. Altmetric Badge
    Chapter 16 Minimizing Expected Termination Time in One-Counter Markov Decision Processes
  18. Altmetric Badge
    Chapter 17 Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata
  19. Altmetric Badge
    Chapter 18 A Saturation Method for Collapsible Pushdown Systems
  20. Altmetric Badge
    Chapter 19 Regular Languages Are Church-Rosser Congruential
  21. Altmetric Badge
    Chapter 20 Automata, Languages, and Programming
  22. Altmetric Badge
    Chapter 21 Nominal Completion for Rewrite Systems with Binders
  23. Altmetric Badge
    Chapter 22 Automata, Languages, and Programming
  24. Altmetric Badge
    Chapter 23 Computing Game Metrics on Markov Decision Processes
  25. Altmetric Badge
    Chapter 24 Deciding First Order Properties of Matroids
  26. Altmetric Badge
    Chapter 25 Pebble Games with Algebraic Rules
  27. Altmetric Badge
    Chapter 26 Exponential Lower Bounds and Separation for Query Rewriting
  28. Altmetric Badge
    Chapter 27 Lattices of Logical Fragments over Words
  29. Altmetric Badge
    Chapter 28 On the Expressive Power of Cost Logics over Infinite Words
  30. Altmetric Badge
    Chapter 29 Coalgebraic Predicate Logic
  31. Altmetric Badge
    Chapter 30 Algorithmic Games for Full Ground References
  32. Altmetric Badge
    Chapter 31 Two-Level Game Semantics, Intersection Types, and Recursion Schemes
  33. Altmetric Badge
    Chapter 32 An Automata-Theoretic Model of Idealized Algol
  34. Altmetric Badge
    Chapter 33 Towards a Unified Theory of Operational and Axiomatic Semantics
  35. Altmetric Badge
    Chapter 34 Loader and Urzyczyn Are Logically Related
  36. Altmetric Badge
    Chapter 35 Languages of Profinite Words and the Limitedness Problem
  37. Altmetric Badge
    Chapter 36 The Complexity of Mean-Payoff Automaton Expression
  38. Altmetric Badge
    Chapter 37 On the Locality of Some NP-Complete Problems
  39. Altmetric Badge
    Chapter 38 Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs
  40. Altmetric Badge
    Chapter 39 Super-Fast Distributed Algorithms for Metric Facility Location
  41. Altmetric Badge
    Chapter 40 Preventing Unraveling in Social Networks: The Anchored k-Core Problem
  42. Altmetric Badge
    Chapter 41 Edge Fault Tolerance on Sparse Networks
  43. Altmetric Badge
    Chapter 42 Incentive Ratios of Fisher Markets
  44. Altmetric Badge
    Chapter 43 Computational Complexity of Traffic Hijacking under BGP and S-BGP
  45. Altmetric Badge
    Chapter 44 Efficiency-Revenue Trade-Offs in Auctions
  46. Altmetric Badge
    Chapter 45 Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
  47. Altmetric Badge
    Chapter 46 A QPTAS for -Envy-Free Profit-Maximizing Pricing on Line Graphs
  48. Altmetric Badge
    Chapter 47 Minimizing Rosenthal Potential in Multicast Games
  49. Altmetric Badge
    Chapter 48 Multiparty Proximity Testing with Dishonest Majority from Equality Testing
  50. Altmetric Badge
    Chapter 49 Anonymous Card Shuffling and Its Applications to Parallel Mixnets
  51. Altmetric Badge
    Chapter 50 Byzantine Agreement with a Rational Adversary
  52. Altmetric Badge
    Chapter 51 Random Hyperbolic Graphs: Degree Sequence and Clustering
  53. Altmetric Badge
    Chapter 52 Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks
  54. Altmetric Badge
    Chapter 53 Automata, Languages, and Programming
  55. Altmetric Badge
    Chapter 54 k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
  56. Altmetric Badge
    Chapter 55 Contention Issues in Congestion Games
  57. Altmetric Badge
    Chapter 56 Automata, Languages, and Programming
  58. Altmetric Badge
    Chapter 57 Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization
  59. Altmetric Badge
    Chapter 58 Distributed Algorithms for Network Diameter and Girth
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

1 tweeter


3 Dimensions

Readers on

7 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 2012
DOI 10.1007/978-3-642-31585-5
978-3-64-231584-8, 978-3-64-231585-5

Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer, Czumaj, Artur, Mehlhorn, Kurt, Pitts, Andrew, Wattenhofer, Roger


Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 3 43%
Student > Ph. D. Student 1 14%
Professor > Associate Professor 1 14%
Professor 1 14%
Unknown 1 14%
Readers by discipline Count As %
Computer Science 5 71%
Engineering 1 14%
Unknown 1 14%

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 09 August 2017.
All research outputs
of 15,295,635 outputs
Outputs from Lecture notes in computer science
of 7,557 outputs
Outputs of similar age
of 344,369 outputs
Outputs of similar age from Lecture notes in computer science
of 1,104 outputs
Altmetric has tracked 15,295,635 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 7,557 research outputs from this source. They receive a mean Attention Score of 4.5. This one is in the 14th percentile – i.e., 14% of its peers scored the same or lower than it.
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 344,369 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 18th percentile – i.e., 18% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 1,104 others from the same source and published within six weeks on either side of this one. This one is in the 13th percentile – i.e., 13% of its contemporaries scored the same or lower than it.