The Case for External Graph Sketching
Fuente:
arXiv
Saved in:
| Main Authors: | Bender, Michael A., Farach-Colton, Martín, Jacob, Riko, Komlós, Hanna, Tench, David, West, Evan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Layered List Labeling
by: Bender, Michael A., et al.
Published: (2024)
by: Bender, Michael A., et al.
Published: (2024)
Nearly Optimal List Labeling
by: Bender, Michael A., et al.
Published: (2024)
by: Bender, Michael A., et al.
Published: (2024)
Fast and Compact Sketch-Based Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2025)
by: De Man, Quinten, et al.
Published: (2025)
Bounding the Fragmentation of B-Trees Subject to Batched Insertions
by: Bender, Michael A., et al.
Published: (2026)
by: Bender, Michael A., et al.
Published: (2026)
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)
by: De Man, Quinten, et al.
Published: (2026)
Adaptive Quotient Filters
by: Wen, Richard, et al.
Published: (2024)
by: Wen, Richard, et al.
Published: (2024)
Time To Replace Your Filter: How Maplets Simplify System Design
by: Bender, Michael A., et al.
Published: (2025)
by: Bender, Michael A., et al.
Published: (2025)
Optimal Bounds for Open Addressing Without Reordering
by: Farach-Colton, Martin, et al.
Published: (2025)
by: Farach-Colton, Martin, et al.
Published: (2025)
A Nearly Quadratic Improvement for Memory Reallocation
by: Farach-Colton, Martin, et al.
Published: (2024)
by: Farach-Colton, Martin, et al.
Published: (2024)
History-Independent Concurrent Hash Tables
by: Attiya, Hagit, et al.
Published: (2025)
by: Attiya, Hagit, et al.
Published: (2025)
Fast Concurrent Primitives Despite Contention
by: Bender, Michael A., et al.
Published: (2026)
by: Bender, Michael A., et al.
Published: (2026)
On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)
by: Goswami, Mayank, et al.
Published: (2022)
Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)
by: Kogan, Dmitry, et al.
Published: (2014)
Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)
by: Conway, Alex, et al.
Published: (2025)
LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics
by: Hilgendorf, Martin, et al.
Published: (2025)
by: Hilgendorf, Martin, et al.
Published: (2025)
On Sketching Trimmed Statistics
by: Lin, Honghao, et al.
Published: (2025)
by: Lin, Honghao, et al.
Published: (2025)
On Sketching Quadratic Forms
by: Andoni, Alexandr, et al.
Published: (2015)
by: Andoni, Alexandr, et al.
Published: (2015)
Fast Sampling Based Sketches for Tensors
by: Swartworth, William, et al.
Published: (2024)
by: Swartworth, William, et al.
Published: (2024)
Almost Linear Size Edit Distance Sketch
by: Koucký, Michal, et al.
Published: (2024)
by: Koucký, Michal, et al.
Published: (2024)
Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
by: Duan, Hongyi, et al.
Published: (2025)
by: Duan, Hongyi, et al.
Published: (2025)
Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
by: Assadi, Sepehr, et al.
Published: (2025)
by: Assadi, Sepehr, et al.
Published: (2025)
Average-Distortion Sketching
by: Bao, Yiqiao, et al.
Published: (2024)
by: Bao, Yiqiao, et al.
Published: (2024)
Fast Similarity Sketching
by: Dahlgaard, Søren, et al.
Published: (2017)
by: Dahlgaard, Søren, et al.
Published: (2017)
Multipass Linear Sketches for Geometric LP-Type Problems
by: Çekirge, N. Efe, et al.
Published: (2025)
by: Çekirge, N. Efe, et al.
Published: (2025)
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
by: Gribelyuk, Elena, et al.
Published: (2025)
by: Gribelyuk, Elena, et al.
Published: (2025)
Sketching and Streaming for Dictionary Compression
by: Becker, Ruben, et al.
Published: (2023)
by: Becker, Ruben, et al.
Published: (2023)
Count-Min Sketch with Conservative Updates: Worst-Case Analysis
by: Mazziane, Younes Ben, et al.
Published: (2024)
by: Mazziane, Younes Ben, et al.
Published: (2024)
On Differential Privacy for Adaptively Solving Search Problems via Sketching
by: Feng, Shiyuan, et al.
Published: (2025)
by: Feng, Shiyuan, et al.
Published: (2025)
Approximating Tensor Network Contraction with Sketches
by: Heddes, Mike, et al.
Published: (2026)
by: Heddes, Mike, et al.
Published: (2026)
Optimal Non-Oblivious Open Addressing
by: Bender, Michael A., et al.
Published: (2025)
by: Bender, Michael A., et al.
Published: (2025)
Tight Bounds for Classical Open Addressing
by: Bender, Michael A., et al.
Published: (2024)
by: Bender, Michael A., et al.
Published: (2024)
On the External Validity of Average-Case Analyses of Graph Algorithms
by: Bläsius, Thomas, et al.
Published: (2022)
by: Bläsius, Thomas, et al.
Published: (2022)
The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
by: Li, Yi, et al.
Published: (2022)
by: Li, Yi, et al.
Published: (2022)
A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
by: Gribelyuk, Elena, et al.
Published: (2024)
by: Gribelyuk, Elena, et al.
Published: (2024)
MagnifierSketch: Quantile Estimation Centered at One Point
by: Guo, Jiarui, et al.
Published: (2025)
by: Guo, Jiarui, et al.
Published: (2025)
SimiSketch: Efficiently Estimating Similarity of streaming Multisets
by: Dong, Fenghao, et al.
Published: (2024)
by: Dong, Fenghao, et al.
Published: (2024)
Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
by: Ahmadian, Sara, et al.
Published: (2024)
by: Ahmadian, Sara, et al.
Published: (2024)
History-Independent Load Balancing
by: Bender, Michael A., et al.
Published: (2026)
by: Bender, Michael A., et al.
Published: (2026)
Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
by: Cohen, Edith, et al.
Published: (2025)
by: Cohen, Edith, et al.
Published: (2025)
Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
by: Khanna, Sanjeev, et al.
Published: (2024)
by: Khanna, Sanjeev, et al.
Published: (2024)
Similar Items
-
Layered List Labeling
by: Bender, Michael A., et al.
Published: (2024) -
Nearly Optimal List Labeling
by: Bender, Michael A., et al.
Published: (2024) -
Fast and Compact Sketch-Based Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2025) -
Bounding the Fragmentation of B-Trees Subject to Batched Insertions
by: Bender, Michael A., et al.
Published: (2026) -
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)