John Peebles

According to our database1, John Peebles authored at least 21 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification.
CoRR, 2023

Singular Value Approximation and Sparsifying Random Walks on Directed Graphs.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Efficient Approximation Algorithms for the Inverse Semivalue Problem.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2020
Determinant-Preserving Sparsification of SDDM Matrices.
SIAM J. Comput., 2020

Optimal Testing of Discrete Distributions with High Probability.
Electron. Colloquium Comput. Complex., 2020

High-precision Estimation of Random Walks in Small Space.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

The Hessian Penalty: A Weak Prior for Unsupervised Disentanglement.
Proceedings of the Computer Vision - ECCV 2020, 2020

2019
Collision-Based Testers are Optimal for Uniformity and Closeness.
Chic. J. Theor. Comput. Sci., 2019

Testing Identity of Multidimensional Histograms.
Proceedings of the Conference on Learning Theory, 2019

Towards Testing Monotonicity of Distributions Over General Posets.
Proceedings of the Conference on Learning Theory, 2019

2018
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling.
Algorithmica, 2018

On the Limitations of First-Order Approximation in GAN Dynamics.
Proceedings of the 35th International Conference on Machine Learning, 2018

Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Sample-Optimal Identity Testing with High Probability.
Electron. Colloquium Comput. Complex., 2017

Towards Understanding the Dynamics of Generative Adversarial Networks.
CoRR, 2017

Sampling random spanning trees faster than matrix multiplication.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation.
CoRR, 2016

Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Replacing Mark Bits with Randomness in Fibonacci Heaps.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015


  Loading...