Pseudorandom Graphs in Data Structures

DOI10.1007/978-3-662-43948-7_78MaRDI QIDQ5167805zbMATH OpenOpenAlexFDO

Authors Omer Reingold, Ron D. Rothblum, Udi Wieder

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43948-7_78

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Data structures (68P05)

Recommendations

• Pseudo-random graphs
• scientific article; zbMATH DE number 4027516
• Pseudo-random hypergraphs
• scientific article; zbMATH DE number 903461
• Randomised reproducing graphs
• scientific article; zbMATH DE number 7478535
• scientific article; zbMATH DE number 4099367
• Pseudorandom Graphs from Elliptic Curves
• scientific article; zbMATH DE number 459046

Cited in

(8)

• Pseudorandomness for network algorithms
• Almost random graphs with simple hash functions
• Applications of a Splitting Trick
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• Power of \(d\) choices with simple tabulation
• scientific article; zbMATH DE number 7478535 (Why is no real title available?)
• Fast pseudorandomness for independence and load balancing (extended abstract)
• Data structures with dynamical random transitions

This page was built for publication: Pseudorandom Graphs in Data Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5167805)