Lower bounds for set intersection queries
- 1 August 1995
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 14 (2) , 154-168
- https://doi.org/10.1007/bf01293666
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- On the Complexity of Maintaining Partial SumsSIAM Journal on Computing, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Data Structures and Algorithms 3Published by Springer Nature ,1984
- The Complexity of Maintaining an Array and Computing Its Partial SumsJournal of the ACM, 1982
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- Probabilistic computations: Toward a unified measure of complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Zur Theorie der GesellschaftsspieleMathematische Annalen, 1928