Fast Evaluation of Union-Intersection Expressions

DOI10.1007/978-3-540-77120-3_64zbMath1193.68081OpenAlexW1667815028MaRDI QIDQ5387808

Anna Pagh, Philip Bille, Rasmus Pagh

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_64

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (5)

Dynamic Set Intersection ⋮ An efficient method to evaluate intersections on big data sets ⋮ Fast Evaluation of Union-Intersection Expressions ⋮ Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios ⋮ Fast set intersection and two-patterns matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An information statistics approach to data stream and communication complexity
• Universal classes of hash functions
• Improved parallel integer sorting without concurrent writing
• Membership in Constant Time and Almost-Minimum Space
• Communication Complexity
• Fast Evaluation of Union-Intersection Expressions
• Exact and approximate membership testers
• Space/time trade-offs in hash coding with allowable errors
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• Automata, Languages and Programming

This page was built for publication: Fast Evaluation of Union-Intersection Expressions