↓ 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 Algorithms, Networks, and Social Phenomena
  3. Altmetric Badge
    Chapter 2 Recent Advances for a Classical Scheduling Problem
  4. Altmetric Badge
    Chapter 3 Formalizing and Reasoning about Quality
  5. Altmetric Badge
    Chapter 4 The Square Root Phenomenon in Planar Graphs
  6. Altmetric Badge
    Chapter 5 A Guided Tour in Random Intersection Graphs
  7. Altmetric Badge
    Chapter 6 To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous
  8. Altmetric Badge
    Chapter 7 Decision Problems for Additive Regular Functions
  9. Altmetric Badge
    Chapter 8 Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
  10. Altmetric Badge
    Chapter 9 A Maximal Entropy Stochastic Process for a Timed Automaton,
  11. Altmetric Badge
    Chapter 10 Complexity of Two-Variable Logic on Finite Trees
  12. Altmetric Badge
    Chapter 11 Nondeterminism in the Presence of a Diverse or Unknown Future
  13. Altmetric Badge
    Chapter 12 Coalgebraic Announcement Logics
  14. Altmetric Badge
    Chapter 13 Self-shuffling Words
  15. Altmetric Badge
    Chapter 14 Block-Sorted Quantified Conjunctive Queries
  16. Altmetric Badge
    Chapter 15 From Security Protocols to Pushdown Automata
  17. Altmetric Badge
    Chapter 16 Efficient Separability of Regular Languages by Subsequences and Suffixes
  18. Altmetric Badge
    Chapter 17 On the Complexity of Verifying Regular Properties on Flat Counter Systems,
  19. Altmetric Badge
    Chapter 18 Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
  20. Altmetric Badge
    Chapter 19 Component Reconfiguration in the Presence of Conflicts
  21. Altmetric Badge
    Chapter 20 Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method
  22. Altmetric Badge
    Chapter 21 Reachability in Two-Clock Timed Automata Is PSPACE-Complete
  23. Altmetric Badge
    Chapter 22 Ramsey Goes Visibly Pushdown
  24. Altmetric Badge
    Chapter 23 Checking Equality and Regularity for Normed BPA with Silent Moves
  25. Altmetric Badge
    Chapter 24 FO Model Checking of Interval Graphs
  26. Altmetric Badge
    Chapter 25 Strategy Composition in Compositional Games
  27. Altmetric Badge
    Chapter 26 Asynchronous Games over Tree Architectures
  28. Altmetric Badge
    Chapter 27 Querying the Guarded Fragment with Transitivity
  29. Altmetric Badge
    Chapter 28 Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types
  30. Altmetric Badge
    Chapter 29 Algebras, Automata and Logic for Languages of Labeled Birooted Trees
  31. Altmetric Badge
    Chapter 30 One-Variable Word Equations in Linear Time
  32. Altmetric Badge
    Chapter 31 The IO and OI Hierarchies Revisited
  33. Altmetric Badge
    Chapter 32 Evolving Graph-Structures and Their Implicit Computational Complexity
  34. Altmetric Badge
    Chapter 33 Rational Subsets and Submonoids of Wreath Products
  35. Altmetric Badge
    Chapter 34 Fair Subtyping for Open Session Types
  36. Altmetric Badge
    Chapter 35 Coeffects: Unified Static Analysis of Context-Dependence
  37. Altmetric Badge
    Chapter 36 Proof Systems for Retracts in Simply Typed Lambda Calculus
  38. Altmetric Badge
    Chapter 37 Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
  39. Altmetric Badge
    Chapter 38 Revisiting the Equivalence Problem for Finite Multitape Automata
  40. Altmetric Badge
    Chapter 39 Silent Transitions in Automata with Storage
  41. Altmetric Badge
    Chapter 40 New Online Algorithms for Story Scheduling in Web Advertising
  42. Altmetric Badge
    Chapter 41 Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
  43. Altmetric Badge
    Chapter 42 Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds
  44. Altmetric Badge
    Chapter 43 On Revenue Maximization for Agents with Costly Information Acquisition
  45. Altmetric Badge
    Chapter 44 Price of Stability in Polynomial Congestion Games
  46. Altmetric Badge
    Chapter 45 Localization for a System of Colliding Robots
  47. Altmetric Badge
    Chapter 46 Fast Collaborative Graph Exploration
  48. Altmetric Badge
    Chapter 47 Deterministic Polynomial Approach in the Plane
  49. Altmetric Badge
    Chapter 48 Outsourced Pattern Matching
  50. Altmetric Badge
    Chapter 49 Learning a Ring Cheaply and Fast
  51. Altmetric Badge
    Chapter 50 Competitive Auctions for Markets with Positive Externalities
  52. Altmetric Badge
    Chapter 51 Efficient Computation of Balanced Structures
  53. Altmetric Badge
    Chapter 52 A Refined Complexity Analysis of Degree Anonymization in Graphs
  54. Altmetric Badge
    Chapter 53 Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks
  55. Altmetric Badge
    Chapter 54 Locally Stable Marriage with Strict Preferences
  56. Altmetric Badge
    Chapter 55 Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices
  57. Altmetric Badge
    Chapter 56 Secure Equality and Greater-Than Tests with Sublinear Online Complexity
  58. Altmetric Badge
    Chapter 57 Temporal Network Optimization Subject to Connectivity Constraints
  59. Altmetric Badge
    Chapter 58 Strong Bounds for Evolution in Networks
  60. Altmetric Badge
    Chapter 59 Fast Distributed Coloring Algorithms for Triangle-Free Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
8 X users
wikipedia
3 Wikipedia pages
q&a
1 Q&A thread

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
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.
Title
Automata, Languages, and Programming
Published by
Springer, Berlin, Heidelberg, January 2013
DOI 10.1007/978-3-642-39212-2
ISBNs
978-3-64-239211-5, 978-3-64-239212-2
Editors

Fedor V. Fomin, Rūsiņš Freivalds, Marta Kwiatkowska, David Peleg

X Demographics

X Demographics

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

Geographical breakdown

Country Count As %
Unknown 13 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 8%
Unknown 12 92%
Readers by discipline Count As %
Computer Science 1 8%
Unknown 12 92%