English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Lower bounds for set intersection queries

Dietz, P., Mehlhorn, K., Raman, R., & Uhrig, C. (1995). Lower bounds for set intersection queries. Algorithmica, 14, 154-168.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC40-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC41-2
Genre: Journal Article

Files

show Files
hide Files
:
Mehlhorn98.pdf (Publisher version), 831KB
 
File Permalink:
-
Name:
Mehlhorn98.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Dietz, Paul, Author
Mehlhorn, Kurt1, Author           
Raman, Rajeev1, Author           
Uhrig, Christian1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2007-12-191995
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344413
Other: Local-ID: C1256428004B93B8-8040226255218E13C125645A0038FF7F-Mehlhorn-Uhrig95
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 14 Sequence Number: - Start / End Page: 154 - 168 Identifier: ISSN: 0178-4617