The following pages link to Jonathan A. Kelner (Q201076):
Displaying 30 items.
- Spectral sparsification in the semi-streaming setting (Q372976) (← links)
- (Q553346) (redirect page) (← links)
- Electric routing and concurrent flow cutting (Q553348) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- Topology discovery of sparse random graphs with few participants (Q2844081) (← links)
- A randomized polynomial-time simplex algorithm for linear programming (Q2931369) (← links)
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method (Q2941498) (← links)
- Randomized accuracy-aware program transformations for efficient approximate computations (Q2942894) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- (Q3099402) (← links)
- (Q3113709) (← links)
- Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus (Q3581004) (← links)
- Electric Routing and Concurrent Flow Cutting (Q3652265) (← links)
- Multiple description vector quantization with a coarse lattice (Q4544829) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs (Q4977989) (← links)
- Local Graph Partitions for Approximation and Testing (Q5171159) (← links)
- Faster Generation of Random Spanning Trees (Q5171207) (← links)
- Higher Eigenvalues of Graphs (Q5171229) (← links)
- Rounding sum-of-squares relaxations (Q5259536) (← links)
- An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (Q5383975) (← links)
- Faster approximate multicommodity flow using quadratically coupled flows (Q5415461) (← links)
- Hypercontractivity, sum-of-squares proofs, and their applications (Q5415483) (← links)
- Global computation in a poorly connected world (Q5415528) (← links)
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (Q5419097) (← links)
- Stochastic Shortest Paths Via Quasi-convex Maximization (Q5449558) (← links)
- Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus (Q5470718) (← links)
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (Q5495863) (← links)
- Quantized frame expansions with erasures (Q5942634) (← links)
- Learning Mixtures of Gaussians Using Diffusion Models (Q6532579) (← links)
