Pseudorandom graphs in data structures

Omer Reingold; Ron D. Rothblum; Udi Wieder

doi:10.1007/978-3-662-43948-7_78

Pseudorandom graphs in data structures

Omer Reingold
, Ron D. Rothblum
, Udi Wieder

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We prove that the hash functions required for several data structure applications could be instantiated using the hash functions of Celis et al. (SIAM J. Comput., 2013). These functions simultaneously enjoy short description length as well as fast evaluation time. The applications we consider are: (1) Cuckoo Hashing, (2) Cuckoo Hashing with Stash and (3) the Power of Two Choices paradigm for load balancing. Our analysis relies on a notion of sparse pseudorandom graphs that are similar to random graphs in having no large connected component and no dense subgraph. Such graphs may be of independent interest. Relating pseudorandom graphs to the two-choice paradigm relies on a very simple new proof we give (at the price of somewhat worse parameters).

Original language	English
Title of host publication	Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings
Pages	943-954
Number of pages	12
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-662-43948-7_78
State	Published - 2014
Externally published	Yes
Event	41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 - Copenhagen, Denmark Duration: 8 Jul 2014 → 11 Jul 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	8572 LNCS

Conference

Conference	41st International Colloquium on Automata, Languages, and Programming, ICALP 2014
Country/Territory	Denmark
City	Copenhagen
Period	8/07/14 → 11/07/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-43948-7_78

Cite this

Reingold, O., Rothblum, R. D., & Wieder, U. (2014). Pseudorandom graphs in data structures. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings (PART 1 ed., pp. 943-954). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8572 LNCS, No. PART 1). https://doi.org/10.1007/978-3-662-43948-7_78

@inproceedings{34305bfa530b46789e027de9c1027243,

title = "Pseudorandom graphs in data structures",

abstract = "We prove that the hash functions required for several data structure applications could be instantiated using the hash functions of Celis et al. (SIAM J. Comput., 2013). These functions simultaneously enjoy short description length as well as fast evaluation time. The applications we consider are: (1) Cuckoo Hashing, (2) Cuckoo Hashing with Stash and (3) the Power of Two Choices paradigm for load balancing. Our analysis relies on a notion of sparse pseudorandom graphs that are similar to random graphs in having no large connected component and no dense subgraph. Such graphs may be of independent interest. Relating pseudorandom graphs to the two-choice paradigm relies on a very simple new proof we give (at the price of somewhat worse parameters).",

author = "Omer Reingold and Rothblum, \{Ron D.\} and Udi Wieder",

year = "2014",

doi = "10.1007/978-3-662-43948-7\_78",

language = "English",

isbn = "9783662439470",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "943--954",

booktitle = "Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings",

edition = "PART 1",

note = "41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 ; Conference date: 08-07-2014 Through 11-07-2014",

}

Reingold, O, Rothblum, RD & Wieder, U 2014, Pseudorandom graphs in data structures. in Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 8572 LNCS, pp. 943-954, 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014, Copenhagen, Denmark, 8/07/14. https://doi.org/10.1007/978-3-662-43948-7_78

Pseudorandom graphs in data structures. / Reingold, Omer; Rothblum, Ron D.; Wieder, Udi.
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1. ed. 2014. p. 943-954 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8572 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Pseudorandom graphs in data structures

AU - Reingold, Omer

AU - Rothblum, Ron D.

AU - Wieder, Udi

PY - 2014

Y1 - 2014

N2 - We prove that the hash functions required for several data structure applications could be instantiated using the hash functions of Celis et al. (SIAM J. Comput., 2013). These functions simultaneously enjoy short description length as well as fast evaluation time. The applications we consider are: (1) Cuckoo Hashing, (2) Cuckoo Hashing with Stash and (3) the Power of Two Choices paradigm for load balancing. Our analysis relies on a notion of sparse pseudorandom graphs that are similar to random graphs in having no large connected component and no dense subgraph. Such graphs may be of independent interest. Relating pseudorandom graphs to the two-choice paradigm relies on a very simple new proof we give (at the price of somewhat worse parameters).

AB - We prove that the hash functions required for several data structure applications could be instantiated using the hash functions of Celis et al. (SIAM J. Comput., 2013). These functions simultaneously enjoy short description length as well as fast evaluation time. The applications we consider are: (1) Cuckoo Hashing, (2) Cuckoo Hashing with Stash and (3) the Power of Two Choices paradigm for load balancing. Our analysis relies on a notion of sparse pseudorandom graphs that are similar to random graphs in having no large connected component and no dense subgraph. Such graphs may be of independent interest. Relating pseudorandom graphs to the two-choice paradigm relies on a very simple new proof we give (at the price of somewhat worse parameters).

UR - https://www.scopus.com/pages/publications/84904192306

U2 - 10.1007/978-3-662-43948-7_78

DO - 10.1007/978-3-662-43948-7_78

M3 - Conference contribution

SN - 9783662439470

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 943

EP - 954

BT - Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings

T2 - 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014

Y2 - 8 July 2014 through 11 July 2014

ER -

Reingold O, Rothblum RD, Wieder U. Pseudorandom graphs in data structures. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. 2014. p. 943-954. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-662-43948-7_78

Pseudorandom graphs in data structures

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this