↓ 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 Nondeterministic Streaming String Transducers
  3. Altmetric Badge
    Chapter 2 An Introduction to Randomness Extractors
  4. Altmetric Badge
    Chapter 3 Invitation to Algorithmic Uses of Inclusion–Exclusion
  5. Altmetric Badge
    Chapter 4 On the Relation between Differential Privacy and Quantitative Information Flow
  6. Altmetric Badge
    Chapter 5 A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
  7. Altmetric Badge
    Chapter 6 Rice’s Theorem for μ -Limit Sets of Cellular Automata
  8. Altmetric Badge
    Chapter 7 Fault-Tolerant Compact Routing Schemes for General Graphs
  9. Altmetric Badge
    Chapter 8 Local Matching Dynamics in Social Networks
  10. Altmetric Badge
    Chapter 9 Regular Languages of Words over Countable Linear Orderings
  11. Altmetric Badge
    Chapter 10 Algebraic Independence and Blackbox Identity Testing
  12. Altmetric Badge
    Chapter 11 A Fragment of ML Decidable by Visibly Pushdown Automata
  13. Altmetric Badge
    Chapter 12 Krivine Machines and Higher-Order Schemes
  14. Altmetric Badge
    Chapter 13 Relating Computational Effects by ⊤ ⊤-Lifting
  15. Altmetric Badge
    Chapter 14 Constructing Differential Categories and Deconstructing Categories of Games
  16. Altmetric Badge
    Chapter 15 Nondeterminism Is Essential in Small 2FAs with Few Reversals
  17. Altmetric Badge
    Chapter 16 Isomorphism of Regular Trees and Words
  18. Altmetric Badge
    Chapter 17 On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids
  19. Altmetric Badge
    Chapter 18 The Cost of Traveling between Languages
  20. Altmetric Badge
    Chapter 19 Emptiness and Universality Problems in Timed Automata with Positive Frequency
  21. Altmetric Badge
    Chapter 20 Büchi Automata Can Have Smaller Quotients
  22. Altmetric Badge
    Chapter 21 Automata-Based CSL Model Checking
  23. Altmetric Badge
    Chapter 22 A Progress Measure for Explicit-State Probabilistic Model-Checkers
  24. Altmetric Badge
    Chapter 23 Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
  25. Altmetric Badge
    Chapter 24 On the Semantics of Markov Automata
  26. Altmetric Badge
    Chapter 25 Runtime Analysis of Probabilistic Programs with Unbounded Recursion
  27. Altmetric Badge
    Chapter 26 Approximating the Termination Value of One-Counter MDPs and Stochastic Games
  28. Altmetric Badge
    Chapter 27 Generic Expression Hardness Results for Primitive Positive Formula Comparison
  29. Altmetric Badge
    Chapter 28 Guarded Negation
  30. Altmetric Badge
    Chapter 29 Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates
  31. Altmetric Badge
    Chapter 30 Modular Markovian Logic
  32. Altmetric Badge
    Chapter 31 Programming with Infinitesimals: A While -Language for Hybrid System Modeling
  33. Altmetric Badge
    Chapter 32 Model Checking the Quantitative μ -Calculus on Linear Hybrid Systems
  34. Altmetric Badge
    Chapter 33 On Reachability for Hybrid Automata over Bounded Time
  35. Altmetric Badge
    Chapter 34 Deciding Robustness against Total Store Ordering
  36. Altmetric Badge
    Chapter 35 Multiply-Recursive Upper Bounds with Higman’s Lemma
  37. Altmetric Badge
    Chapter 36 Liveness-Preserving Atomicity Abstraction
  38. Altmetric Badge
    Chapter 37 On Stabilization in Herman’s Algorithm
  39. Altmetric Badge
    Chapter 38 Online Graph Exploration: New Results on Old and New Algorithms
  40. Altmetric Badge
    Chapter 39 Distance Oracles for Vertex-Labeled Graphs
  41. Altmetric Badge
    Chapter 40 Asymptotically Optimal Randomized Rumor Spreading
  42. Altmetric Badge
    Chapter 41 Fast Convergence for Consensus in Dynamic Networks
  43. Altmetric Badge
    Chapter 42 Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
  44. Altmetric Badge
    Chapter 43 Restoring Pure Equilibria to Weighted Congestion Games
  45. Altmetric Badge
    Chapter 44 Existence and Uniqueness of Equilibria for Flows over Time
  46. Altmetric Badge
    Chapter 45 Collusion in Atomic Splittable Routing Games
  47. Altmetric Badge
    Chapter 46 Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
  48. Altmetric Badge
    Chapter 47 Adaptively Secure Non-interactive Threshold Cryptosystems
  49. Altmetric Badge
    Chapter 48 Content Search through Comparisons
  50. Altmetric Badge
    Chapter 49 Efficient Distributed Communication in Ad-Hoc Radio Networks
  51. Altmetric Badge
    Chapter 50 Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model
  52. Altmetric Badge
    Chapter 51 Convergence Time of Power-Control Dynamics
  53. Altmetric Badge
    Chapter 52 A New Approach for Analyzing Convergence Algorithms for Mobile Robots
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
twitter
4 X users
patent
2 patents
wikipedia
4 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
3 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-22012-8
ISBNs
978-3-64-222011-1, 978-3-64-222012-8
Editors

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

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 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 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Master 1 33%
Student > Ph. D. Student 1 33%
Readers by discipline Count As %
Computer Science 3 100%