↓ 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 Algorithmic verification of linear temporal logic specifications
  3. Altmetric Badge
    Chapter 2 On existentially first-order definable languages and their relation to NP
  4. Altmetric Badge
    Chapter 3 An algebraic approach to communication complexity
  5. Altmetric Badge
    Chapter 4 Deciding global partial-order properties
  6. Altmetric Badge
    Chapter 5 Simple linear-time algorithms for minimal fixed points
  7. Altmetric Badge
    Chapter 6 Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method
  8. Altmetric Badge
    Chapter 7 Simpler and faster dictionaries on the AC0 RAM
  9. Altmetric Badge
    Chapter 8 Partial-congruence factorization of bisimilarity induced by open maps
  10. Altmetric Badge
    Chapter 9 Reset nets between decidability and undecidability
  11. Altmetric Badge
    Chapter 10 Geometric algorithms for robotic manipulation
  12. Altmetric Badge
    Chapter 11 Compact encodings of planar graphs via canonical orderings and multiple parentheses
  13. Altmetric Badge
    Chapter 12 Reducing simple polygons to triangles - A proof for an improved conjecture -
  14. Altmetric Badge
    Chapter 13 Difficult configurations — on the complexity of LTrL
  15. Altmetric Badge
    Chapter 14 On the expressiveness of real and integer arithmetic automata
  16. Altmetric Badge
    Chapter 15 Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees
  17. Altmetric Badge
    Chapter 16 Independent sets with domination constraints
  18. Altmetric Badge
    Chapter 17 Robust asynchronous protocols are finite-state
  19. Altmetric Badge
    Chapter 18 Deciding bisimulation-like equivalences with finite-state processes
  20. Altmetric Badge
    Chapter 19 Do probabilistic algorithms outperform deterministic ones?
  21. Altmetric Badge
    Chapter 20 A degree-decreasing Lemma for (MOD q, MOD p) circuits
  22. Altmetric Badge
    Chapter 21 Improved pseudorandom generators for combinatorial rectangles
  23. Altmetric Badge
    Chapter 22 Translation validation for synchronous languages
  24. Altmetric Badge
    Chapter 23 An efficient and unified approach to the decidability of equivalence of propositional programs
  25. Altmetric Badge
    Chapter 24 On branching programs with bounded uncertainty
  26. Altmetric Badge
    Chapter 25 CONS-free programs with tree input
  27. Altmetric Badge
    Chapter 26 Concatenable graph processes: Relating processes and derivation traces
  28. Altmetric Badge
    Chapter 27 Axioms for contextual net processes
  29. Altmetric Badge
    Chapter 28 Existential types: Logical relations and operational equivalence
  30. Altmetric Badge
    Chapter 29 Optimal sampling strategies in quicksort
  31. Altmetric Badge
    Chapter 30 Automata, Languages and Programming
  32. Altmetric Badge
    Chapter 31 A modular approach to denotational semantics
  33. Altmetric Badge
    Chapter 32 Generalised flowcharts and games
  34. Altmetric Badge
    Chapter 33 Efficient minimization of numerical summation errors
  35. Altmetric Badge
    Chapter 34 Efficient approximation algorithms for the subset-sums equality problem
  36. Altmetric Badge
    Chapter 35 Structural recursive definitions in type theory
  37. Altmetric Badge
    Chapter 36 A good class of tree automata. Application to inductive theorem proving
  38. Altmetric Badge
    Chapter 37 Locally periodic infinite words and a chaotic behaviour
  39. Altmetric Badge
    Chapter 38 Bridges for concatenation hierarchies
  40. Altmetric Badge
    Chapter 39 Complete proof systems for observation congruences in finite-control π-calculus
  41. Altmetric Badge
    Chapter 40 Concurrent constraints in the fusion calculus
  42. Altmetric Badge
    Chapter 41 On computing the entropy of cellular automata
  43. Altmetric Badge
    Chapter 42 On the determinization of weighted finite automata
  44. Altmetric Badge
    Chapter 43 Bulk-synchronous parallel multiplication of boolean matrices
  45. Altmetric Badge
    Chapter 44 A complex example of a simplifying rewrite system
  46. Altmetric Badge
    Chapter 45 On a duality between Kruskal and Dershowitz theorems
  47. Altmetric Badge
    Chapter 46 A total AC-compatible reduction ordering on higher-order terms
  48. Altmetric Badge
    Chapter 47 Model checking game properties of multi-agent systems
  49. Altmetric Badge
    Chapter 48 Limited wavelength conversion in all-optical tree networks
  50. Altmetric Badge
    Chapter 49 Computing mimicking networks
  51. Altmetric Badge
    Chapter 50 Metric semantics for true concurrent real time
  52. Altmetric Badge
    Chapter 51 The regular real-time languages
  53. Altmetric Badge
    Chapter 52 Static and dynamic low-congested interval routing schemes
  54. Altmetric Badge
    Chapter 53 Low-bandwidth routing and electrical power networks
  55. Altmetric Badge
    Chapter 54 Constraint automata and the complexity of recursive subtype entailment
  56. Altmetric Badge
    Chapter 55 Reasoning about the past with two-way automata
  57. Altmetric Badge
    Chapter 56 A neuroidal architecture for cognitive computation
  58. Altmetric Badge
    Chapter 57 Deterministic polylog approximation for minimum communication spanning trees
  59. Altmetric Badge
    Chapter 58 A polynomial time approximation scheme for euclidean minimum cost k-connectivity
  60. Altmetric Badge
    Chapter 59 Global/local subtyping and capability inference for a distributed π-calculus
  61. Altmetric Badge
    Chapter 60 Checking strong/Weak bisimulation equivalences and observation congruence for the π-calculus
  62. Altmetric Badge
    Chapter 61 Inversion of circulant matrices over Zm
  63. Altmetric Badge
    Chapter 62 Application of Lempel-Ziv encodings to the solution of word equations
  64. Altmetric Badge
    Chapter 63 Explicit substitutitions for constructive necessity
  65. Altmetric Badge
    Chapter 64 The relevance of proof-irrelevance
  66. Altmetric Badge
    Chapter 65 New horizons in quantum information processing
  67. Altmetric Badge
    Chapter 66 Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP
  68. Altmetric Badge
    Chapter 67 Image density is complete for non-interactive-SZK
  69. Altmetric Badge
    Chapter 68 Randomness spaces
  70. Altmetric Badge
    Chapter 69 Totality, definability and boolean circuits
  71. Altmetric Badge
    Chapter 70 Quantum counting
  72. Altmetric Badge
    Chapter 71 On the complexity of deriving score functions from examples for problems in molecular biology
  73. Altmetric Badge
    Chapter 72 A hierarchy of equivalences for asynchronous calculi
  74. Altmetric Badge
    Chapter 73 On asynchrony in name-passing calculi
  75. Altmetric Badge
    Chapter 74 Protection in programming-language translations
  76. Altmetric Badge
    Chapter 75 Efficient simulations by queue machines
  77. Altmetric Badge
    Chapter 76 Power of cooperation and multihead finite systems
  78. Altmetric Badge
    Chapter 77 A simple solution to type specialization
  79. Altmetric Badge
    Chapter 78 Multi-stage programming: axiomatization and type safety
Attention for Chapter 70: Quantum counting
Altmetric Badge

Mentioned by

wikipedia
3 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
127 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.
Chapter title
Quantum counting
Chapter number 70
Book title
Automata, Languages and Programming
Published in
arXiv, July 1998
DOI 10.1007/bfb0055105
Book ISBNs
978-3-54-064781-2, 978-3-54-068681-1
Authors

Gilles Brassard, Peter HØyer, Alain Tapp, Peter Hoyer, Brassard, Gilles, HØyer, Peter, Tapp, Alain

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 3 2%
Belgium 2 2%
United Kingdom 1 <1%
Brazil 1 <1%
Canada 1 <1%
Unknown 119 94%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 29 23%
Researcher 23 18%
Student > Master 15 12%
Student > Bachelor 8 6%
Professor > Associate Professor 7 6%
Other 18 14%
Unknown 27 21%
Readers by discipline Count As %
Computer Science 52 41%
Physics and Astronomy 33 26%
Mathematics 4 3%
Engineering 4 3%
Chemistry 2 2%
Other 5 4%
Unknown 27 21%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 21 February 2023.
All research outputs
#7,692,405
of 23,402,852 outputs
Outputs from arXiv
#171,797
of 965,513 outputs
Outputs of similar age
#10,298
of 33,815 outputs
Outputs of similar age from arXiv
#39
of 117 outputs
Altmetric has tracked 23,402,852 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 965,513 research outputs from this source. They receive a mean Attention Score of 3.9. This one has done well, scoring higher than 80% of its peers.
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 33,815 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 8th percentile – i.e., 8% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 117 others from the same source and published within six weeks on either side of this one. This one is in the 29th percentile – i.e., 29% of its contemporaries scored the same or lower than it.