Lower bounds for set intersection queries

DOI10.1007/BF01293666zbMath0833.68037OpenAlexW3137191959MaRDI QIDQ1899448

Kurt Mehlhorn, Paul F. Dietz, Rajeev Raman, Christian Uhrig

Publication date: 9 October 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01293666

zbMATH Keywords

memory restrictionset intersection reporting

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (1)

Dynamic and internal longest common substring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The power of geometric duality
• Lower Bounds on the Complexity of Polytope Range Searching
• On the Complexity of Maintaining Partial Sums
• A Lower Bound on the Complexity of Orthogonal Range Queries
• The Complexity of Maintaining an Array and Computing Its Partial Sums

This page was built for publication: Lower bounds for set intersection queries