↓ 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 59 Philosophical issues in Kolmogorov complexity
  3. Altmetric Badge
    Chapter 60 Circuit complexity and the expressive power of generalized first-order formulas
  4. Altmetric Badge
    Chapter 61 One-message statistical Zero-Knowledge Proofs and space-bounded verifier
  5. Altmetric Badge
    Chapter 62 Abelian squares are avoidable on 4 letters
  6. Altmetric Badge
    Chapter 63 Polynomial size test sets for context-free languages
  7. Altmetric Badge
    Chapter 64 Quasi-deterministic 0L systems
  8. Altmetric Badge
    Chapter 65 On growing context-sensitive languages
  9. Altmetric Badge
    Chapter 66 Numeration systems, linear recurrences, and regular sets
  10. Altmetric Badge
    Chapter 67 The equality problem for rational series with multiplicities in the tropical semiring is undecidable
  11. Altmetric Badge
    Chapter 68 Semi-commutations and rational expressions
  12. Altmetric Badge
    Chapter 69 New results concerning synchronized finite automata
  13. Altmetric Badge
    Chapter 70 A Greibach normal form for context-free graph grammars
  14. Altmetric Badge
    Chapter 71 On reverse and general definite tree languages
  15. Altmetric Badge
    Chapter 72 Reductions to sets of low information content
  16. Altmetric Badge
    Chapter 73 UP and the low and high hierarchies: A relativized separation
  17. Altmetric Badge
    Chapter 74 Analytic analysis of algorithms
  18. Altmetric Badge
    Chapter 75 How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems
  19. Altmetric Badge
    Chapter 76 The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
  20. Altmetric Badge
    Chapter 77 Polynomial hash functions are reliable
  21. Altmetric Badge
    Chapter 78 Adaptive pattern matching
  22. Altmetric Badge
    Chapter 79 Randomized interpolation and approximation of sparse polynomials stPreliminary version
  23. Altmetric Badge
    Chapter 80 Two strikes against perfect phylogeny
  24. Altmetric Badge
    Chapter 81 Disjunctive systems and L-Domains
  25. Altmetric Badge
    Chapter 82 Optimal parallel algorithms for periods, palindromes and squares
  26. Altmetric Badge
    Chapter 83 Near-perfect token distribution
  27. Altmetric Badge
    Chapter 84 Fast integer merging on the EREW PRAM
  28. Altmetric Badge
    Chapter 85 Approximation algorithms for graph augmentation
  29. Altmetric Badge
    Chapter 86 Fast incremental planarity testing
  30. Altmetric Badge
    Chapter 87 Maintenance of triconnected components of graphs
  31. Altmetric Badge
    Chapter 88 Suboptimal cuts: Their enumeration, weight and number
  32. Altmetric Badge
    Chapter 89 Gröbner bases: An introduction
  33. Altmetric Badge
    Chapter 90 Buchberger's algorithm: The term rewriter's point of view
  34. Altmetric Badge
    Chapter 91 Completion of rewrite systems with membership constraints
  35. Altmetric Badge
    Chapter 92 A new metric between polygons, and how to compute it
  36. Altmetric Badge
    Chapter 93 On nearest-neighbor graphs
  37. Altmetric Badge
    Chapter 94 A tail estimate for Mulmuley's segment intersection algorithm
  38. Altmetric Badge
    Chapter 95 Lower bounds on the complexity of simplex range reporting on a pointer machine
  39. Altmetric Badge
    Chapter 96 Infinitary logic for computer science
  40. Altmetric Badge
    Chapter 97 Characterization of temporal property classes
  41. Altmetric Badge
    Chapter 98 Lazy Lambda calculus: Theories, models and local structure characterization
  42. Altmetric Badge
    Chapter 99 Logic programming semantics made easy
  43. Altmetric Badge
    Chapter 100 On the complexity of dataflow analysis of logic programs
  44. Altmetric Badge
    Chapter 101 Comparison of abstract interpretations
  45. Altmetric Badge
    Chapter 102 A proposed categorical semantics for Pure ML
  46. Altmetric Badge
    Chapter 103 What good are digital clocks?
  47. Altmetric Badge
    Chapter 104 Behavioural abstraction in TCCS
  48. Altmetric Badge
    Chapter 105 Timing Petri Nets categorically
  49. Altmetric Badge
    Chapter 106 Asynchronous cellular automata for infinite traces
  50. Altmetric Badge
    Chapter 107 A trace semantics for Petri Nets
  51. Altmetric Badge
    Chapter 108 Asynchronous communication of Petri Nets and the refinement of transitions
  52. Altmetric Badge
    Chapter 109 A parametric approach to localities
  53. Altmetric Badge
    Chapter 110 Proved trees
  54. Altmetric Badge
    Chapter 111 Interfaces between languages for communicating systems
  55. Altmetric Badge
    Chapter 112 Toward formal development of programs from algebraic specifications: Model-theoretic foundations
  56. Altmetric Badge
    Chapter 113 Program composition via unification
  57. Altmetric Badge
    Chapter 114 Barbed bisimulation
  58. Altmetric Badge
    Chapter 115 Checking equivalences between concurrent systems of finite agents (Extended abstract)
  59. Altmetric Badge
    Chapter 116 Testing preorders for probabilistic processes
Attention for Chapter 77: Polynomial hash functions are reliable
Altmetric Badge

Mentioned by

patent
1 patent
wikipedia
1 Wikipedia page

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
16 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
Polynomial hash functions are reliable
Chapter number 77
Book title
Automata, Languages and Programming
Published by
Springer, Berlin, Heidelberg, July 1992
DOI 10.1007/3-540-55719-9_77
Book ISBNs
978-3-54-055719-7, 978-3-54-047278-0
Authors

M. Dietzfelbinger, J. Gil, Y. Matias, N. Pippenger, Dietzfelbinger, M., Gil, J., Matias, Y., Pippenger, N.

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 16 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 4 25%
Professor 2 13%
Student > Ph. D. Student 2 13%
Professor > Associate Professor 2 13%
Student > Master 1 6%
Other 1 6%
Unknown 4 25%
Readers by discipline Count As %
Computer Science 9 56%
Physics and Astronomy 3 19%
Unknown 4 25%