↓ 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 Game Semantics: Achievements and Prospects
  3. Altmetric Badge
    Chapter 2 Clique Is Hard to Approximate within n 1 - o (1)
  4. Altmetric Badge
    Chapter 3 Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
  5. Altmetric Badge
    Chapter 4 Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming
  6. Altmetric Badge
    Chapter 5 A Statically Allocated Parallel Functional Language
  7. Altmetric Badge
    Chapter 6 An Optimal Minimum Spanning Tree Algorithm
  8. Altmetric Badge
    Chapter 7 Improved Shortest Paths on the Word RAM
  9. Altmetric Badge
    Chapter 8 Improved Algorithms for Finding Level Ancestors in Dynamic Trees
  10. Altmetric Badge
    Chapter 9 Lax Logical Relations
  11. Altmetric Badge
    Chapter 10 Reasoning about Idealized ALGOL Using Regular Languages
  12. Altmetric Badge
    Chapter 11 The Measurement Process in Domain Theory
  13. Altmetric Badge
    Chapter 12 Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution
  14. Altmetric Badge
    Chapter 13 Monotone Proofs of the Pigeon Hole Principle
  15. Altmetric Badge
    Chapter 14 Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models
  16. Altmetric Badge
    Chapter 15 Algebraic Models for Contextual Nets
  17. Altmetric Badge
    Chapter 16 Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
  18. Altmetric Badge
    Chapter 17 Measures of Nondeterminism in Finite Automata
  19. Altmetric Badge
    Chapter 18 LTL Is Expressively Complete for Mazurkiewicz Traces
  20. Altmetric Badge
    Chapter 19 An Automata-Theoretic Completeness Proof for Interval Temporal Logic
  21. Altmetric Badge
    Chapter 20 Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?
  22. Altmetric Badge
    Chapter 21 Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search
  23. Altmetric Badge
    Chapter 22 Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
  24. Altmetric Badge
    Chapter 23 Variable Independence, Quantifier Elimination, and Constraint Representations
  25. Altmetric Badge
    Chapter 24 Constraint Satisfaction Problems and Finite Algebras
  26. Altmetric Badge
    Chapter 25 An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
  27. Altmetric Badge
    Chapter 26 Resource Augmentation for Online Bounded Space Bin Packing
  28. Altmetric Badge
    Chapter 27 Optimal Projective Algorithms for the List Update Problem
  29. Altmetric Badge
    Chapter 28 Efficient Verification Algorithms for One-Counter Processes
  30. Altmetric Badge
    Chapter 29 On the Complexity of Bisimulation Problems for Basic Parallel Processes
  31. Altmetric Badge
    Chapter 30 Decidable First-Order Transition Logics for PA-Processes
  32. Altmetric Badge
    Chapter 31 Non Interference for the Analysis of Cryptographic Protocols
  33. Altmetric Badge
    Chapter 32 Average Bit-Complexity of Euclidean Algorithms
  34. Altmetric Badge
    Chapter 33 Planar Maps and Airy Phenomena
  35. Altmetric Badge
    Chapter 34 Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System
  36. Altmetric Badge
    Chapter 35 Information Flow vs. Resource Access in the Asynchronous Pi-Calculus (Extended Abstract)
  37. Altmetric Badge
    Chapter 36 The Genomics Revolution and Its Challenges for Algorithmic Research
  38. Altmetric Badge
    Chapter 37 Alternating the Temporal Picture for Safety
  39. Altmetric Badge
    Chapter 38 Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations
  40. Altmetric Badge
    Chapter 39 Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP
  41. Altmetric Badge
    Chapter 40 A New Unfolding Approach to LTL Model Checking
  42. Altmetric Badge
    Chapter 41 Reasoning about Message Passing in Finite State Environments
  43. Altmetric Badge
    Chapter 42 Extended Notions of Security for Multicast Public Key Cryptosystems
  44. Altmetric Badge
    Chapter 43 One-Round Secure Computation and Secure Autonomous Mobile Agents
  45. Altmetric Badge
    Chapter 44 Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing
  46. Altmetric Badge
    Chapter 45 On the Centralizer of a Finite Set
  47. Altmetric Badge
    Chapter 46 On the Power of Tree-Walking Automata
  48. Altmetric Badge
    Chapter 47 Determinization of Transducers over Infinite Words
  49. Altmetric Badge
    Chapter 48 Constraint Programming and Graph Algorithms
  50. Altmetric Badge
    Chapter 49 Scalable Secure Storage when Half the System Is Faulty
  51. Altmetric Badge
    Chapter 50 Generating Partial and Multiple Transversals of a Hypergraph
  52. Altmetric Badge
    Chapter 51 Revisiting the Correspondence between Cut Elimination and Normalisation
  53. Altmetric Badge
    Chapter 52 Negation Elimination from Simple Equational Formulae
  54. Altmetric Badge
    Chapter 53 Hardness of Set Cover with Intersection 1
  55. Altmetric Badge
    Chapter 54 Strong Inapproximability of the Basic k -Spanner Problem
  56. Altmetric Badge
    Chapter 55 Infinite Series-Parallel Posets: Logic and Languages
  57. Altmetric Badge
    Chapter 56 On Deciding if Deterministic Rabin Language Is in Büchi Class
  58. Altmetric Badge
    Chapter 57 On Message Sequence Graphs and Finitely Generated Regular MSC Languages
  59. Altmetric Badge
    Chapter 58 Pseudorandomness
  60. Altmetric Badge
    Chapter 59 A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
  61. Altmetric Badge
    Chapter 60 Deterministic Radio Broadcasting
  62. Altmetric Badge
    Chapter 61 An ω-Complete Equational Specification of Interleaving
  63. Altmetric Badge
    Chapter 62 A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors
  64. Altmetric Badge
    Chapter 63 Tight Size Bounds for Packet Headers in Narrow Meshes
  65. Altmetric Badge
    Chapter 64 Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link
  66. Altmetric Badge
    Chapter 65 On the Logical Characterisation of Performability Properties
  67. Altmetric Badge
    Chapter 66 On the Representation of Timed Polyhedra
  68. Altmetric Badge
    Chapter 67 Min-wise Independent Permutations: Theory and Practice
  69. Altmetric Badge
    Chapter 68 Testing Acyclicity of Directed Graphs in Sublinear Time
  70. Altmetric Badge
    Chapter 69 Computing the Girth of a Planar Graph
  71. Altmetric Badge
    Chapter 70 Lower Bounds Are Not Easier over the Reals: Inside PH
  72. Altmetric Badge
    Chapter 71 Unlearning Helps
  73. Altmetric Badge
    Chapter 72 Fast Approximation Schemes for Euclidean Multi-connectivity Problems
  74. Altmetric Badge
    Chapter 73 Approximate TSP in Graphs with Forbidden Minors
  75. Altmetric Badge
    Chapter 74 Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling
  76. Altmetric Badge
    Chapter 75 The Many Faces of a Translation
  77. Altmetric Badge
    Chapter 76 Gales and the Constructive Dimension of Individual Sequences
  78. Altmetric Badge
    Chapter 77 The Global Power of Additional Queries to p-Random Oracles
  79. Altmetric Badge
    Chapter 78 Homogenization and the Polynomial Calculus
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
4 Wikipedia pages

Readers on

mendeley
2 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, August 2003
DOI 10.1007/3-540-45022-x
ISBNs
978-3-54-045022-1, 978-3-54-067715-4
Editors

Montanari, Ugo, Rolim, José D. P., Welzl, Emo

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 100%
Readers by discipline Count As %
Engineering 2 100%