The following pages link to John Peebles (Q1709590):
Displayed 8 items.
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Replacing Mark Bits with Randomness in Fibonacci Heaps (Q3448845) (← links)
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs (Q4977989) (← links)
- Sampling random spanning trees faster than matrix multiplication (Q4978019) (← links)
- Optimal Identity Testing with High Probability (Q5002714) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- Collision-based Testers are Optimal for Uniformity and Closeness (Q5232537) (← links)
- Optimal testing of discrete distributions with high probability (Q6087025) (← links)