Fast Evaluation of Union-Intersection Expressions

DOI10.1007/978-3-540-77120-3_64MaRDI QIDQ5387808zbMATH OpenOpenAlexFDO

Authors Philip Bille, Anna Pagh, 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

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

Recommendations

• Automata, Languages and Programming
• Fast set intersection and two-patterns matching
• Fast set intersection and two-patterns matching
• scientific article; zbMATH DE number 7650865
• Fast algorithms for uniform semi-unification
• scientific article; zbMATH DE number 3945370
• Fast Intersection Algorithms for Sorted Sequences
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 1947415

Cites work

• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• An information statistics approach to data stream and communication complexity
• An optimal bloom filter replacement
• Automata, Languages and Programming
• Communication Complexity
• Exact and approximate membership testers
• Fast Evaluation of Union-Intersection Expressions
• scientific article; zbMATH DE number 1263219 (Why is no real title available?)
• scientific article; zbMATH DE number 2119687 (Why is no real title available?)
• scientific article; zbMATH DE number 1445340 (Why is no real title available?)
• scientific article; zbMATH DE number 1445373 (Why is no real title available?)
• Improved parallel integer sorting without concurrent writing
• Membership in Constant Time and Almost-Minimum Space
• Space/time trade-offs in hash coding with allowable errors
• Universal classes of hash functions

Cited in

(18)

• Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
• Intersection reporting on two collections of disjoint sets
• \texttt{FASTSET}: a fast data structure for the representation of sets of integers
• An efficient method to evaluate intersections on big data sets
• Efficient optimally lazy algorithms for minimal-interval semantics
• scientific article; zbMATH DE number 437544 (Why is no real title available?)
• Dynamic set intersection
• Fast set intersection and two-patterns matching
• Evaluation of General Set Expressions
• scientific article; zbMATH DE number 1445373 (Why is no real title available?)
• Efficient set intersection counting algorithm for text similarity measures
• Combinatorial Pattern Matching
• Fast Evaluation of Union-Intersection Expressions
• Automata, Languages and Programming
• An output sensitive solution to the set union and intersection problem
• Trie-compressed adaptive set intersection
• Towards optimal set-disjointness and set-intersection data structures
• Fast set intersection and two-patterns matching

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387808)