Alternation and redundancy analysis of the intersection problem
From MaRDI portal
Publication:4962696
DOI10.1145/1328911.1328915zbMath1445.68338MaRDI QIDQ4962696
Jérémy Barbay, Claire M. Kenyon
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1328911.1328915
randomized algorithm; intersection; redundancy analysis; adaptive analysis; intersection of sorted arrays; alternation analysis
68W40: Analysis of algorithms
68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)
68P20: Information storage and retrieval of data
68W20: Randomized algorithms
Related Items
An efficient method to evaluate intersections on big data sets, New algorithms on wavelet trees and applications to information retrieval, Adaptive searching in succinctly encoded binary relations and tree-structured documents