scientific article; zbMATH DE number 7053300

zbMath1423.68126MaRDI QIDQ5743421

John Iacono, Mihai Pǎtraşcu

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095164

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (4)

Optimal Hashing in External Memory ⋮ Lower Bounds for External Memory Integer Sorting via Network Coding ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• The buffer tree: A technique for designing batched external data structures
• On dynamic bit-probe complexity
• The limits of buffering
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• The Power of Simple Tabulation Hashing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: