Dynamic Set Intersection
From MaRDI portal
Publication:3449844
DOI10.1007/978-3-319-21840-3_39zbMath1451.68081arXiv1407.6755OpenAlexW1574727208MaRDI QIDQ3449844
Seth Pettie, Ely Porat, Tsvi Kopelowitz
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.6755
Related Items (8)
Dynamic Set Intersection ⋮ Simultaneously load balancing for every p-norm, with reassignments ⋮ Mind the gap! ⋮ Internal masked prefix sums and its connection to fully internal measurement queries ⋮ Finding small complete subgraphs efficiently ⋮ Online recognition of dictionary with one gap ⋮ Parameterized aspects of triangle enumeration ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges
Cites Work
- Unnamed Item
- Unnamed Item
- Fast set intersection and two-patterns matching
- A faster algorithm computing string edit distances
- Surpassing the information theoretic bound with fusion trees
- Improved parallel integer sorting without concurrent writing
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
- Subquadratic algorithms for 3SUM
- Towards polynomial lower bounds for dynamic problems
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time
- Dynamic Set Intersection
- Arboricity and Subgraph Listing Algorithms
- Finding a Minimum Circuit in a Graph
- A Four Russians algorithm for regular expression pattern matching
- Threesomes, Degenerates, and Love Triangles
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Listing Triangles
- Combinatorial Pattern Matching
- Four Soviets Walk the Dog—with an Application to Alt's Conjecture
- Fast Evaluation of Union-Intersection Expressions
This page was built for publication: Dynamic Set Intersection
