Alternation and redundancy analysis of the intersection problem

DOI10.1145/1328911.1328915zbMath1445.68338OpenAlexW2100474856MaRDI 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

zbMATH Keywords

randomized algorithmintersectionredundancy analysisadaptive analysisintersection of sorted arraysalternation analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

Related Items (3)

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

This page was built for publication: Alternation and redundancy analysis of the intersection problem