Lower bounds for set intersection queries

Authors:
Paul Dietz;Kurt Mehlhorn;Rajeev Raman;Christian Uhrig
Affiliations:
Department of Computer Science, University of Rochester, Rochester, NY;Max-Planck-Institut für Informatik, Im Stadtwald, , W-6600 Saarbrüken, Germany;Max-Planck-Institut für Informatik, Im Stadtwald, , W-6600 Saarbrüken, Germany;Max-Planck-Institut für Informatik, Im Stadtwald, , W-6600 Saarbrüken, Germany
Venue:
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Year:
1993

Data Structures for Maintaining Set Partitions

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Data structures for maintaining set partitions

Random Structures & Algorithms
Fast intersection algorithms for sorted sequences

Algorithms and Applications
Experimental analysis of a fast intersection algorithm for sorted sequences

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Hi-index	0.00