Intersection reporting on two collections of disjoint sets

DOI10.1016/S0020-0255(99)80001-2zbMath0948.68063OpenAlexW2058834578MaRDI QIDQ1818976

Guido Proietti, Enrico Nardelli, Carlo Gaibisso

Publication date: 5 January 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(99)80001-2

zbMATH Keywords

data structurebinomial list

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (1)

Efficient unbalanced merge-sort

Cites Work

• Unnamed Item
• Unnamed Item
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Truly concurrent constraint programming
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
• Worst-case Analysis of Set Union Algorithms
• A data structure for manipulating priority queues

This page was built for publication: Intersection reporting on two collections of disjoint sets