Graphs, hypergraphs and hashing-Reference-Cited by-同舟云学术

Graphs, hypergraphs and hashing

Published:1994 Issue: Volume: Page:153-165
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Havas George,Majewski Bohdan S.,Wormald Nicholas C.,Czech Zbigniew J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57899-4_49.pdf

Reference50 articles.

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

2. M.D. Brain and A.L. Tharp. Near-perfect hashing of large word sets. Software — Practice and Experience 19 (1989) 967–978.

3. M.D. Brain and A.L. Tharp. Perfect hashing using sparse matrix packing. Information Systems, 15 (1990) 281–290.

4. J.L. Carter and M.N. Wegman. Universal classes of hash functions. In 9th Annual ACM Symposium on Theory of Computing — STOC'77, 106–112, 1977.

5. J.L. Carter and M.N. Wegman. New classes and applications of hash functions. In 20th Annual Symposium on Foundations of Computer Science — FOCS'79, 175–182, 1979a.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bloomier Filters on 3-Hypergraphs;Lecture Notes in Computer Science;2024

2. Lightweight Acquisition and Ranging of Flows in the Data Plane;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2023-12-07

3. PSI from PaXoS: Fast, Malicious Private Set Intersection;Advances in Cryptology – EUROCRYPT 2020;2020

4. Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications;LEIBNIZ INT PR INFOR;2019

5. The stripping process can be slow: Part I;Random Structures & Algorithms;2018-02-04