Equivalence of free boolean graphs can be decided probabilistically in polynomial time
- Manuel Blum
- Ashok K. Chandra
- et al.
- 1980
- Information Processing Letters
Publications
Date
Featured collections
Popular topics
39 results for Mark Wegman
New classes and applications of hash functions
- Mark N. Wegman
- J. Lawrence Carter
- 1979
- FOCS 1979
Universal classes of hash functions
- J. Lawrence Carter
- Mark N. Wegman
- 1979
- Journal of Computer and System Sciences
Exact and approximate membership testers
- Larry Carter
- Robert Floyd
- et al.
- 1978
- STOC 1978
Linear unification
- M.S. Paterson
- Mark N. Wegman
- 1978
- Journal of Computer and System Sciences
Universal classes of hash functions
- J. Lawrence Carter
- Mark N. Wegman
- 1977
- STOC 1977
Computer analysis of nucleic acid regulatory sequences
- Laurence Jay Korn
- Cary Queen
- et al.
- 1977
- PNAS
Linear unification
- M.S. Paterson
- Mark N. Wegman
- 1976
- STOC 1976
A Fast and Usually Linear Algorithm for Global Flow Analysis
- Susan L. Graham
- Mark Wegman
- 1976
- Journal of the ACM