New Data Structures and Algorithms papers from arxiv.org: data structures and analysis of algor. Thank you to arXiv for use of its open access interoperability.
Joined September 2009
- Tweets 5,610
- Following 2
- Followers 1,024
- Likes 2
610 Photos and videos
Testing Bipartiteness in Logarithmic Rounds
Yumou Fei, Ronitt Rubinfeld
arxiv.org/abs/2606.13583 [ππ.π³π]
1
96
Split Tallies: A Discrete Certificate Calculus for Auditing Dynamic Ordered Sets in Constant Memory
Faruk Alpay, Levent Sarioglu
arxiv.org/abs/2606.13272 [ππ.π³π ππ.π²π]
2
192
Sketching Intersection Profiles: A Simple Proof and Three Applications
Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi, Erasmo Tani, Andrew Tomkins
arxiv.org/abs/2606.13182 [ππ.π³π ππ.π²π²]
1
88
(Un)ranking Permutation Classes
NathanaΓ«l Hassler (LIB, UniversitΓ© Bourgogne Europe), Vincent Vajnovszki (LIB, UniversitΓ© Bourgogne Europe)
arxiv.org/abs/2606.13160 [ππ.π³π ππ.π³πΌ]
1
65
Random Generation of k-coloured Motzkin Paths
Elena Barcucci (University of Florence), Antonio Bernini (University of Florence), Stefano Bilotta (University of Florence), Renzo Pinzani (University of Florence)
arxiv.org/abs/2606.13151 [ππ.π³π ππ.π³πΌ]
1
77
Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling
Kaito Baba, Evripidis Bampis, Giorgos Mitropoulos
arxiv.org/abs/2606.13133 [ππ.π³π ππ.π»πΆ]
1
57
Binary Search Variants: A Comprehensive Analysis
Ali Dasdan
arxiv.org/abs/2606.12970 [ππ.π³π]
2
92
Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds
Ziao Wang, Lei Ying
arxiv.org/abs/2606.12879 [ππ.π³π ππππ.ππ ππππ.πΌπ» ππππ.ππ·]
2
81
A unified complexity bound for logconcave sampling
Yunbum Kook, Santosh S. Vempala
arxiv.org/abs/2606.12694 [ππ.π³π ππ.π»πΆ ππππ.πΏπ ππππ.πΌπ»]
60
Random Proposals: A Softmax-Based Local-Improvement Framework for Maximum Weighted Matching
Ahmed M. Alzuhair (Department of Information and Computer Science, King Fahd University of Petroleum and Minerals), β¦
arxiv.org/abs/2606.12692 [ππ.π³π ππ.π³πΌ]
63
Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products
Christoper Musco, Indu Ramesh
arxiv.org/abs/2606.12179 [ππ.π³π ππ.π½π° ππππ.π½π°]
1
5
299
Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
Malte Baumecker, Rustam Latypov, Yannic Maus, Jara Uitto
arxiv.org/abs/2606.11974 [ππ.π³π ππ.π³π²]
1
2
128
A Fast Gaussian Mechanism under Continual Observation, with Applications
Rasmus Pagh, Sia Sejer
arxiv.org/abs/2606.11760 [ππ.π³π ππ.π²π ππ.π³π±]
1
79
Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment
Tait Weicht, Alexander S. Wein
arxiv.org/abs/2606.11701 [ππ.π³π]
2
124
Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more
Spencer Compton, Jerry Li
arxiv.org/abs/2606.11469 [ππ.π³π ππ.π»πΆ ππππ.ππ ππππ.ππ·]
1
66
A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions
Yuzhou Gu, Xin Li, Yinzhan Xu
arxiv.org/abs/2606.11448 [ππ.π³π ππ.π²π² ππ.πΈπ ππππ.πΈπ]
1
123
The Power of Test-Time Training for Approximate Sampling
Noah Golowich, Ankur Moitra, Dhruv Rohatgi
arxiv.org/abs/2606.11437 [ππ.π³π ππ.π°πΈ ππ.π»πΆ ππππ.πΌπ»]
2
103
Fixed-Parameter Tractability of Private Synthetic Data Generation
Badih Ghazi, CristΓ³bal GuzmΓ‘n, Pritish Kamath, Alexander Knop, Ravi Kumar, Pasin Manurangsi
arxiv.org/abs/2606.11283 [ππ.π³π ππ.π»πΆ ππππ.πΌπ»]
2
140
Bayesian Probing on Graphs
Anupam Gupta, Benjamin Moseley, Rudy Zhou
arxiv.org/abs/2606.09729 [ππ.π³π]
4
158
The price of incrementality in k-center clustering
LΓ‘szlΓ³ Kozma
arxiv.org/abs/2606.08713 [ππ.π³π ππ.π²πΆ]
88