The following pages link to Lev Reyzin (Q465251):
Displayed 24 items.
- Data stability in clustering: a closer look (Q465252) (← links)
- On the longest path algorithm for reconstructing trees from distance matrices (Q845904) (← links)
- Optimally learning social networks with activations and suppressions (Q982645) (← links)
- Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
- On the computational complexity of MapReduce (Q1664122) (← links)
- A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
- On biased random walks, corrupted intervals, and learning under adversarial design (Q2202524) (← links)
- Network construction with subgraph connectivity constraints (Q2253960) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
- (Q2880953) (← links)
- On Coloring Resilient Graphs (Q2922638) (← links)
- On Noise-Tolerant Learning of Sparse Parities and Related Problems (Q3093968) (← links)
- Data Stability in Clustering: A Closer Look (Q3164820) (← links)
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (Q3520066) (← links)
- Optimally Learning Social Networks with Activations and Suppressions (Q3529928) (← links)
- Learning Finite Automata Using Label Queries (Q3648751) (← links)
- Statistical Algorithms and a Lower Bound for Detecting Planted Cliques (Q4640281) (← links)
- Inferring Social Networks from Outbreaks (Q4930692) (← links)
- Lower Bounds on Learning Random Structures with Statistical Queries (Q4930699) (← links)
- Network installation under convex costs (Q4985046) (← links)
- On the Complexity of Learning a Class Ratio from Unlabeled Data (Q5145827) (← links)
- Learning Large-Alphabet and Analog Circuits with Value Injection Queries (Q5432425) (← links)
- Statistical algorithms and a lower bound for detecting planted cliques (Q5495836) (← links)
- Applications of Littlestone dimension to query learning and to compression (Q6454175) (← links)
