Locally Private Histograms in All Privacy Regimes
Explore frequency estimation in data analysis, focusing on local differential privacy. Learn about algorithms, error bounds, and the intriguing low-privacy regime in histogram computation.
Adaptive Sparse Recovery with Limited Adaptivity
Explore techniques for efficient sparse signal recovery using limited adaptive measurements, with applications in sublinear algorithms and nearest-neighbor search.
High Dimensional Robust Sparse Regression
Explore advanced techniques for robust sparse regression in high-dimensional data, focusing on sublinear algorithms and nearest-neighbor search methods.
Graph Coloring Through the Sublinear Lens
Explore sublinear algorithms for graph coloring, examining innovative approaches and their applications in computational efficiency and problem-solving in graph theory.
Property Testing for Graphs
Explore advanced techniques in property testing for graphs, focusing on sublinear algorithms and their applications in large-scale network analysis.
Counting Subgraphs in Sublinear Time
Explore key randomization techniques for estimating subgraph counts without reading entire graphs, focusing on average degree and triangle count estimation methods.
Distribution Testing - Hypothesis Testing from Very Little or Very Private Data
Explore hypothesis testing techniques for distribution analysis using limited or private datasets, focusing on sublinear algorithms and their applications in data science.
Sketching and Randomized Linear Algebra
Explore advanced techniques in randomized linear algebra, focusing on sketching methods for efficient data analysis and algorithm design in high-dimensional spaces.
Sparsifying Set Systems for Coverage Problems
Explore recent advancements in sparsifying set systems for coverage problems, focusing on sublinear graph simplification techniques.
Improved Streaming Algorithms for Max-DICUT via Local Snapshots
Explore advanced streaming algorithms for Max-DICUT problem, focusing on local graph snapshots to surpass the 4/9 approximation in sublinear space.
Approximating Maximum Matching Requires Almost Quadratic Time
Explore algorithms for estimating maximum matching size, focusing on recent advancements and lower bounds. Gain insights into subquadratic time complexity and its limitations in graph theory.
Online Algorithms for Spectral Hypergraph Sparsification
Explore online algorithms for spectral hypergraph sparsification, focusing on space-efficient methods for handling streaming hyperedges and producing accurate sparsifiers.
Stochastic Minimum Vertex Cover with Few Queries: A 3/2-Approximation
Explore a 3/2-approximation algorithm for stochastic vertex cover using O(n/p) non-adaptive queries, improving upon previous 2-approximation methods and discussing extensions to correlated edge realizations.
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
Explore advanced algorithms for dynamic maximum matching using Ordered Ruzsa-Szemeredi Graphs, improving update time to n^{o(1)} * ORS(n) and reducing the problem to a combinatorial bound.
New Algorithms for Directed Spanner Problems and Generalizations
Explore recent advancements in directed spanner algorithms, including online and offline settings, weighted variants, and buy-at-bulk extensions.
Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs - Towards Constructive Matching Sparsifiers
Explore approaches for designing fast dynamic algorithms for approximate matchings, focusing on fully dynamic settings and the concept of matching sparsifiers in graph theory.
Maximum Matching in O(log log n) Passes in Dynamic Streams
Explore an algorithm for approximating maximum matching in dynamic streams, achieving O(1)-approximation in O(log log n) passes and O(n poly log n) space, with lower bound proof.
Planar Partition Oracles for Bounded Degree Graphs in Polynomial Time
Explore planar graph partition oracles for bounded degree graphs, focusing on hyperfinite decompositions and their applications in sublinear algorithms and property testing.
Subgraph Counting and Seed Counting in Graph Theory
Explore sublinear subgraph counting and sampling techniques, focusing on the advantages of counting seeds in graph analysis.
Graph Connectivity Using Star Contraction
Explore edge connectivity in simple graphs using cut queries, introducing star contraction for efficient graph simplification and discussing randomized and quantum algorithms for connectivity determination.
Linear Sketching Hypergraph Sparsifiers
Explore linear sketching techniques for hypergraph sparsification, examining upper and lower bounds, dynamic streaming algorithms, and novel methods like random fingerprinting for efficient cut preservation.