Item

ITEM ACTIONS

This item is discarded!DetailsSummary

Discarded

Report

Lower Bounds for Set Intersection Queries

MPS-Authors

/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)

(No access)

Supplementary Material (public)

There is no public supplementary material available

Citation

Dietz, P., Mehlhorn, K., Raman, R., & Uhrig, C.(1992). Lower Bounds for Set Intersection Queries (MPI-I-92-127). Saarbrücken: Max-Planck-Institut für Informatik.

Abstract

There is no abstract available