English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Lower Bounds for Set Intersection queries

Dietz, P., Mehlhorn, K., Raman, R., & Uhrig, C. (1993). Lower Bounds for Set Intersection queries. In Discrete algorithms (SODA-93): 4th annual ACM-SIAM symposium (pp. 194-201). New York, USA: ACM / SIAM.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Dietz, Paul1, Author
Mehlhorn, Kurt2, Author           
Raman, Rajeev2, Author           
Uhrig, Christian2, 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: 2005-08-121993
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM / SIAM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344519
Other: Local-ID: C1256428004B93B8-C5442FD2A1D71DB8C125705B0042826D-Mehlhorn93f
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Austin, USA
Start-/End Date: 1993-01-25

Legal Case

show

Project information

show

Source 1

show
hide
Title: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium
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: 0-89871-313-7