English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Lower Bounds for Set Intersection Queries

MPS-Authors

Dietz,  Paul
Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45250

Raman,  Rajeev
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45646

Uhrig,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Dietz, P., Mehlhorn, K., Raman, R., & Uhrig, C. (1993). Lower Bounds for Set Intersection Queries. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 194-201). New York, USA: ACM / SIAM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ADCB-6
Abstract
There is no abstract available