Lower bounds for set intersection queries
type: Item
instance of: scholarly article
title: Lower bounds for set intersection queries
zbMATH Open document ID: 0833.68037
DOI: 10.1007/BF01293666
author: Paul F. Dietz
author: K. Mehlhorn
author: Rajeev Raman
author: Christian Uhrig
published in: Algorithmica
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 803780
zbMATH Keywords: memory restriction
zbMATH Keywords: set intersection reporting
MaRDI profile type: Publication
cites work: Lower Bounds on the Complexity of Polytope Range Searching
cites work: The power of geometric duality
cites work: A Lower Bound on the Complexity of Orthogonal Range Queries
cites work: The Complexity of Maintaining an Array and Computing Its Partial Sums
cites work: Q3219752
cites work: Q3481743
cites work: On the Complexity of Maintaining Partial Sums
cites work: Q4763424
full work available at URL: https://doi.org/10.1007/bf01293666
OpenAlex ID: W3137191959
Recommended article: Q3140421
Recommended article: Q4375806
Recommended article: Q4886068
Recommended article: Lower bounds for intersection searching and fractional cascading in higher dimension
Recommended article: Bounded queries to arbitrary sets
Recommended article: Intersection queries in sets of disks
Recommended article: Beyond set disjointness
Recommended article: New upper bounds for generalized intersection searching problems
description: scientific article; zbMATH DE number 803780