Saved in:
| Main Authors: | Huang, Zengfeng, Xiong, Zhongzheng, Zhu, Xiaoyi, Wei, Zhewei |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.14250 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
by: Feng, Shiyuan, et al.
Published: (2025)
by: Feng, Shiyuan, et al.
Published: (2025)
Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams
by: Shahout, Rana, et al.
Published: (2024)
by: Shahout, Rana, et al.
Published: (2024)
Sublinear Spectral Clustering Oracle with Little Memory
by: Shen, Ranran, et al.
Published: (2026)
by: Shen, Ranran, et al.
Published: (2026)
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
by: Woodruff, David P., et al.
Published: (2024)
by: Woodruff, David P., et al.
Published: (2024)
Revisiting Local Computation of PageRank: Simple and Optimal
by: Wang, Hanzhi, et al.
Published: (2024)
by: Wang, Hanzhi, et al.
Published: (2024)
Space Complexity of Euclidean Clustering
by: Zhu, Xiaoyi, et al.
Published: (2024)
by: Zhu, Xiaoyi, et al.
Published: (2024)
Optimal Matrix Sketching over Sliding Windows
by: Yin, Hanyan, et al.
Published: (2024)
by: Yin, Hanyan, et al.
Published: (2024)
ResidualSketch: Enhancing Layer Efficiency and Error Reduction in Hierarchical Heavy Hitter Detection with ResNet Innovations
by: Liu, Xilai, et al.
Published: (2025)
by: Liu, Xilai, et al.
Published: (2025)
Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees
by: Lebeda, Christian Janos, et al.
Published: (2026)
by: Lebeda, Christian Janos, et al.
Published: (2026)
Simple and Optimal Sublinear Algorithms for Mean Estimation
by: Bertolotti, Beatrice, et al.
Published: (2024)
by: Bertolotti, Beatrice, et al.
Published: (2024)
A Simple, Nearly-Optimal Algorithm for Differentially Private All-Pairs Shortest Distances
by: Campbell, Jesse, et al.
Published: (2024)
by: Campbell, Jesse, et al.
Published: (2024)
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
by: Lebeda, Christian Janos, et al.
Published: (2023)
by: Lebeda, Christian Janos, et al.
Published: (2023)
Efficient Algorithms for Personalized PageRank Computation: A Survey
by: Yang, Mingji, et al.
Published: (2024)
by: Yang, Mingji, et al.
Published: (2024)
Optimality of Frequency Moment Estimation
by: Braverman, Mark, et al.
Published: (2024)
by: Braverman, Mark, et al.
Published: (2024)
A Simple Algorithm for Clustering Discrete Distributions
by: Mitra, Pradipta
Published: (2026)
by: Mitra, Pradipta
Published: (2026)
Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity
by: Liu, Kaiwen, et al.
Published: (2026)
by: Liu, Kaiwen, et al.
Published: (2026)
Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
by: Chen, Daoyuan, et al.
Published: (2024)
by: Chen, Daoyuan, et al.
Published: (2024)
On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
by: Kwok, Tsz Chiu, et al.
Published: (2025)
by: Kwok, Tsz Chiu, et al.
Published: (2025)
Approximating Single-Source Personalized PageRank with Absolute Error Guarantees
by: Wei, Zhewei, et al.
Published: (2024)
by: Wei, Zhewei, et al.
Published: (2024)
Differentially Private Learning of Exponential Distributions: Simple Algorithms and Tight Bounds
by: Mahpud, Bar, et al.
Published: (2025)
by: Mahpud, Bar, et al.
Published: (2025)
PageRank Centrality in Directed Graphs with Bounded In-Degree
by: Thorup, Mikkel, et al.
Published: (2025)
by: Thorup, Mikkel, et al.
Published: (2025)
A Simple Approximation Algorithm for Optimal Decision Tree
by: Zhuo, Zhengjia, et al.
Published: (2025)
by: Zhuo, Zhengjia, et al.
Published: (2025)
Simple and Faster Algorithms for Knapsack
by: He, Qizheng, et al.
Published: (2023)
by: He, Qizheng, et al.
Published: (2023)
Maximal Palindromes in MPC: Simple and Optimal
by: Pissis, Solon P.
Published: (2025)
by: Pissis, Solon P.
Published: (2025)
Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes
by: Green-Maimon, Naomi, et al.
Published: (2025)
by: Green-Maimon, Naomi, et al.
Published: (2025)
Simple Algorithms for Fully Dynamic Edge Connectivity
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)
A Simple Algorithm for Trimmed Multipoint Evaluation
by: Fischer, Nick, et al.
Published: (2025)
by: Fischer, Nick, et al.
Published: (2025)
A Simple Algorithm for Dynamic Carpooling with Recourse
by: Efron, Yuval, et al.
Published: (2024)
by: Efron, Yuval, et al.
Published: (2024)
A Simple and Fast Algorithm for Fair Cuts
by: Li, Jason, et al.
Published: (2024)
by: Li, Jason, et al.
Published: (2024)
Discrete Effort Distribution via Regret-enabled Greedy Algorithm
by: Cao, Song, et al.
Published: (2025)
by: Cao, Song, et al.
Published: (2025)
Optimal Algorithms for Augmented Testing of Discrete Distributions
by: Aliakbarpour, Maryam, et al.
Published: (2024)
by: Aliakbarpour, Maryam, et al.
Published: (2024)
Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
by: Plank, Benedikt M., et al.
Published: (2022)
by: Plank, Benedikt M., et al.
Published: (2022)
Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering
by: Adriaens, Florian, et al.
Published: (2026)
by: Adriaens, Florian, et al.
Published: (2026)
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
by: Honorato-Droguett, Nicolás, et al.
Published: (2023)
by: Honorato-Droguett, Nicolás, et al.
Published: (2023)
Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
by: Cui, Guanyu, et al.
Published: (2025)
by: Cui, Guanyu, et al.
Published: (2025)
Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
by: Wang, Hanzhi
Published: (2024)
by: Wang, Hanzhi
Published: (2024)
Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)
Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
by: Aliakbarpour, Maryam, et al.
Published: (2026)
by: Aliakbarpour, Maryam, et al.
Published: (2026)
An Optimal Algorithm for Stochastic Vertex Cover
by: Brand, Jan van den, et al.
Published: (2026)
by: Brand, Jan van den, et al.
Published: (2026)
Optimal 4-Approximation for the Correlated Pandora's Problem
by: Bansal, Nikhil, et al.
Published: (2025)
by: Bansal, Nikhil, et al.
Published: (2025)
Similar Items
-
Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
by: Feng, Shiyuan, et al.
Published: (2025) -
Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams
by: Shahout, Rana, et al.
Published: (2024) -
Sublinear Spectral Clustering Oracle with Little Memory
by: Shen, Ranran, et al.
Published: (2026) -
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
by: Woodruff, David P., et al.
Published: (2024) -
Revisiting Local Computation of PageRank: Simple and Optimal
by: Wang, Hanzhi, et al.
Published: (2024)