Near-Linear Time Construction of Sparse Neighborhood Covers
From MaRDI portal
Publication:4210147
Recommendations
Cited in
(only showing first 100 items - show all)- Approximate \(k\)-flat nearest neighbor search
- Optimal data-dependent hashing for approximate near neighbors
- Randomized rounding for the largest simplex problem
- Sum-of-squares Lower Bounds for Planted Clique
- Random permutations using switching networks
- Randomized composable core-sets for distributed submodular maximization
- Polynomially low error PCPs with \(\operatorname{polyloglog} n\) queries via modular composition
- Beyond the Euler characteristic: approximating the genus of general graphs (extended abstract)
- Inapproximability of combinatorial problems via small LPs and SDPs
- An interactive information odometer and applications
- Lower bounds on the size of semidefinite programming relaxations
- High Parallel Complexity Graphs and Memory-Hard Functions
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Dimensionality reduction for \(k\)-means clustering and low rank approximation
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
- Testing cluster structure of graphs
- Edge-disjoint spanners of complete graphs and complete digraphs
- Secretary Problems with Non-Uniform Arrival Order
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
- Bypassing KLS: Gaussian cooling and an \(O^\ast(n^3)\) volume algorithm
- Faster canonical forms for primitive coherent configurations (extended abstract)
- New pairwise spanners
- Sparse quantum codes from quantum circuits
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
- From independence to expansion and back again
- Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- On the complexity of Nash equilibria in anonymous games
- Ramsey partitions and proximity data structures
- Greedy algorithms for Steiner forest
- A parallel bio-inspired shortest path algorithm
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
- On the Lovász theta function for independent sets in sparse graphs
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Solving the shortest vector problem in \(2^n\) time using discrete Gaussian sampling (extended abstract)
- Small stretch pairwise spanners and approximate \(D\)-preservers
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
- FPTAS for \#BIS with degree bounds on one side
- Deterministic global minimum cut of a simple graph in near-linear time
- Adjacency labeling schemes and induced-universal graphs
- Non-malleable reductions and applications
- Fast matrix multiplication: limitations of the Coppersmith-Winograd method (extended abstract)
- Clustered Integer 3SUM via Additive Combinatorics
- New graph decompositions with applications to emulations
- Fast distributed network decompositions and covers
- Forrelation: a problem that optimally separates quantum from classical computing
- Approximate distance oracles with improved bounds
- The directed grid theorem
- Shortest-path queries in static networks
- Proof of the satisfiability conjecture for large \(k\)
- Quantum information complexity
- Efficiently learning Ising models on arbitrary graphs (extended abstract)
- The Power of Dynamic Distance Oracles
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Nearly-linear time positive LP solver with faster convergence rate
- Inapproximability of Nash equilibrium
- Sketching and embedding are equivalent for norms
- Minimizing flow-time on unrelated machines
- Preserving statistical validity in adaptive data analysis (extended abstract)
- Fast deterministic distributed algorithms for sparse spanners
- Test-and-set in optimal space
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- Computing with Tangles
- Leveled fully homomorphic signatures from standard lattices
- How well can graphs represent wireless interference?
- Almost Optimal Pseudorandom Generators for Spherical Caps
- Local, private, efficient protocols for succinct histograms
- Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
- Succinct randomized encodings and their applications
- Excluded grid theorem: improved and simplified
- Learning Arbitrary Statistical Mixtures of Discrete Distributions
- Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory's theorem
- Approximating the Nash social welfare with indivisible items
- On the complexity of random satisfiability problems with planted solutions (extended abstract)
- Sum of squares lower bounds from pairwise independence (extended abstract)
- Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Garbled RAM from one-way functions
- Tight bounds for learning a mixture of two Gaussians (extended abstract)
- Sublinear fully distributed partition with applications
- Dictionary learning and tensor decomposition via the sum-of-squares method
- Small value parallel repetition for general games
- Learning mixtures of Gaussians in high dimensions
- Exponential Separation of Information and Communication for Boolean Functions
- Rectangles Are Nonnegative Juntas
- The complexity of the simplex method
- Super-resolution, extremal functions and the condition number of Vandermonde matrices
- Online submodular welfare maximization: greedy beats 1/2 in random order
- Hardness of Graph Pricing Through Generalized Max-Dicut
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Reed-Muller codes for random erasures and errors
- A polynomial-time bicriteria approximation scheme for planar bisection
- \(\ell_p\) row sampling by Lewis weights
- A characterization of the capacity of online (causal) binary channels
- Time lower bounds for nonadaptive turnstile streaming algorithms
- Analysis of a classical matrix preconditioning algorithm
- Faster algorithms for all-pairs small stretch distances in weighted graphs
- Spectral sparsification and regret minimization beyond matrix multiplicative updates
This page was built for publication: Near-Linear Time Construction of Sparse Neighborhood Covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210147)
