Lower Bounds for Set Intersection Queries

Dietz, Paul; Mehlhorn, Kurt; Raman, Rajeev; Uhrig, Christian

doi:10.5555/313559.313686

Local TagsRelease HistoryDetailsSummary

Lower Bounds for Set Intersection Queries

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ADCB-6 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-2950-A

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Dietz, Paul¹, Author
Mehlhorn, Kurt², Author
Raman, Rajeev², Author
Uhrig, Christian², Author

Affiliations:
1Max Planck Society, ou_persistent13
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2005-08-12Date issued: 1993

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344519
Other: Local-ID: C1256428004B93B8-C5442FD2A1D71DB8C125705B0042826D-Mehlhorn93f
DOI: 10.5555/313559.313686
BibTex Citekey: Mehlhorn-et-al_SODA93

Degree: -

Event

show

hide

Title: Fourth Annual ACM-SIAM Symposium on Discrete Algorithms

Place of Event: Austin, TX, USA

Start-/End Date: 1993-01-25 - 1993-01-27

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms

Abbreviation : SODA 1993

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, USA : ACM / SIAM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 194 - 201 Identifier: ISBN: 978-0-89871-313-8