Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: John Peebles
@inproceedings{DBLP:conf/focs/AhmadinejadPPSV23,
author = {AmirMahdi Ahmadinejad and
John Peebles and
Edward Pyne and
Aaron Sidford and
Salil P. Vadhan},
title = {Singular Value Approximation and Sparsifying Random Walks on Directed
Graphs},
booktitle = {{FOCS}},
pages = {846--854},
publisher = {{IEEE}},
year = {2023}
}
@article{DBLP:journals/corr/abs-2301-13541,
author = {AmirMahdi Ahmadinejad and
John Peebles and
Edward Pyne and
Aaron Sidford and
Salil P. Vadhan},
title = {Singular Value Approximation and Reducing Directed to Undirected Graph
Sparsification},
journal = {CoRR},
volume = {abs/2301.13541},
year = {2023}
}
@inproceedings{DBLP:conf/atal/DiakonikolasPPS22,
author = {Ilias Diakonikolas and
Chrystalla Pavlou and
John Peebles and
Alistair Stewart},
title = {Efficient Approximation Algorithms for the Inverse Semivalue Problem},
booktitle = {{AAMAS}},
pages = {354--362},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022}
}
@inproceedings{DBLP:conf/stoc/DiakonikolasGKP21,
author = {Ilias Diakonikolas and
Themis Gouleakis and
Daniel M. Kane and
John Peebles and
Eric Price},
title = {Optimal testing of discrete distributions with high probability},
booktitle = {{STOC}},
pages = {542--555},
publisher = {{ACM}},
year = {2021}
}
@article{DBLP:journals/siamcomp/DurfeePPR20,
author = {David Durfee and
John Peebles and
Richard Peng and
Anup B. Rao},
title = {Determinant-Preserving Sparsification of {SDDM} Matrices},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {4},
year = {2020}
}
@inproceedings{DBLP:conf/eccv/PeeblesPZE020,
author = {William S. Peebles and
John Peebles and
Jun{-}Yan Zhu and
Alexei A. Efros and
Antonio Torralba},
title = {The Hessian Penalty: {A} Weak Prior for Unsupervised Disentanglement},
booktitle = {{ECCV} {(6)}},
series = {Lecture Notes in Computer Science},
volume = {12351},
pages = {581--597},
publisher = {Springer},
year = {2020}
}
@inproceedings{DBLP:conf/focs/AhmadinejadKMPS20,
author = {AmirMahdi Ahmadinejad and
Jonathan A. Kelner and
Jack Murtagh and
John Peebles and
Aaron Sidford and
Salil P. Vadhan},
title = {High-precision Estimation of Random Walks in Small Space},
booktitle = {{FOCS}},
pages = {1295--1306},
publisher = {{IEEE}},
year = {2020}
}
@article{DBLP:journals/corr/abs-2008-10599,
author = {William S. Peebles and
John Peebles and
Jun{-}Yan Zhu and
Alexei A. Efros and
Antonio Torralba},
title = {The Hessian Penalty: {A} Weak Prior for Unsupervised Disentanglement},
journal = {CoRR},
volume = {abs/2008.10599},
year = {2020}
}
@article{DBLP:journals/corr/abs-2009-06540,
author = {Ilias Diakonikolas and
Themis Gouleakis and
Daniel M. Kane and
John Peebles and
Eric Price},
title = {Optimal Testing of Discrete Distributions with High Probability},
journal = {CoRR},
volume = {abs/2009.06540},
year = {2020}
}
@article{DBLP:journals/eccc/DiakonikolasGKP20,
author = {Ilias Diakonikolas and
Themis Gouleakis and
Daniel Kane and
John Peebles and
Eric Price},
title = {Optimal Testing of Discrete Distributions with High Probability},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-140}},
year = {2020}
}
@article{DBLP:journals/cjtcs/DiakonikolasGPP19,
author = {Ilias Diakonikolas and
Themis Gouleakis and
John Peebles and
Eric Price},
title = {Collision-Based Testers are Optimal for Uniformity and Closeness},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2019},
year = {2019}
}
@inproceedings{DBLP:conf/colt/AliakbarpourGPR19,
author = {Maryam Aliakbarpour and
Themis Gouleakis and
John Peebles and
Ronitt Rubinfeld and
Anak Yodpinyanee},
title = {Towards Testing Monotonicity of Distributions Over General Posets},
booktitle = {{COLT}},
series = {Proceedings of Machine Learning Research},
volume = {99},
pages = {34--82},
publisher = {{PMLR}},
year = {2019}
}
@inproceedings{DBLP:conf/colt/DiakonikolasKP19,
author = {Ilias Diakonikolas and
Daniel M. Kane and
John Peebles},
title = {Testing Identity of Multidimensional Histograms},
booktitle = {{COLT}},
series = {Proceedings of Machine Learning Research},
volume = {99},
pages = {1107--1131},
publisher = {{PMLR}},
year = {2019}
}
@article{DBLP:journals/corr/abs-1907-03182,
author = {Maryam Aliakbarpour and
Themis Gouleakis and
John Peebles and
Ronitt Rubinfeld and
Anak Yodpinyanee},
title = {Towards Testing Monotonicity of Distributions Over General Posets},
journal = {CoRR},
volume = {abs/1907.03182},
year = {2019}
}
@article{DBLP:journals/corr/abs-1912-04524,
author = {AmirMahdi Ahmadinejad and
Jonathan A. Kelner and
Jack Murtagh and
John Peebles and
Aaron Sidford and
Salil P. Vadhan},
title = {High-precision Estimation of Random Walks in Small Space},
journal = {CoRR},
volume = {abs/1912.04524},
year = {2019}
}
@article{DBLP:journals/algorithmica/AliakbarpourBGP18,
author = {Maryam Aliakbarpour and
Amartya Shankha Biswas and
Themis Gouleakis and
John Peebles and
Ronitt Rubinfeld and
Anak Yodpinyanee},
title = {Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {668--697},
year = {2018}
}
@inproceedings{DBLP:conf/focs/CohenKKPPRS18,
author = {Michael B. Cohen and
Jonathan A. Kelner and
Rasmus Kyng and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford},
title = {Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse
{LU} Factorizations},
booktitle = {{FOCS}},
pages = {898--909},
publisher = {{IEEE} Computer Society},
year = {2018}
}
@inproceedings{DBLP:conf/icalp/DiakonikolasGPP18,
author = {Ilias Diakonikolas and
Themis Gouleakis and
John Peebles and
Eric Price},
title = {Sample-Optimal Identity Testing with High Probability},
booktitle = {{ICALP}},
series = {LIPIcs},
volume = {107},
pages = {41:1--41:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018}
}
@inproceedings{DBLP:conf/icml/0001MPS18,
author = {Jerry Li and
Aleksander Madry and
John Peebles and
Ludwig Schmidt},
title = {On the Limitations of First-Order Approximation in {GAN} Dynamics},
booktitle = {{ICML}},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {3011--3019},
publisher = {{PMLR}},
year = {2018}
}
@article{DBLP:journals/corr/abs-1804-03636,
author = {Ilias Diakonikolas and
Daniel M. Kane and
John Peebles},
title = {Testing Identity of Multidimensional Histograms},
journal = {CoRR},
volume = {abs/1804.03636},
year = {2018}
}
@article{DBLP:journals/corr/abs-1811-10722,
author = {Michael B. Cohen and
Jonathan A. Kelner and
Rasmus Kyng and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford},
title = {Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse
{LU} Factorizations},
journal = {CoRR},
volume = {abs/1811.10722},
year = {2018}
}
@inproceedings{DBLP:conf/focs/DurfeePPR17,
author = {David Durfee and
John Peebles and
Richard Peng and
Anup B. Rao},
title = {Determinant-Preserving Sparsification of {SDDM} Matrices with Applications
to Counting and Sampling Spanning Trees},
booktitle = {{FOCS}},
pages = {926--937},
publisher = {{IEEE} Computer Society},
year = {2017}
}
@inproceedings{DBLP:conf/stoc/CohenKPPRSV17,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford and
Adrian Vladu},
title = {Almost-linear-time algorithms for Markov chains and new spectral primitives
for directed graphs},
booktitle = {{STOC}},
pages = {410--419},
publisher = {{ACM}},
year = {2017}
}
@inproceedings{DBLP:conf/stoc/DurfeeKPRS17,
author = {David Durfee and
Rasmus Kyng and
John Peebles and
Anup B. Rao and
Sushant Sachdeva},
title = {Sampling random spanning trees faster than matrix multiplication},
booktitle = {{STOC}},
pages = {730--742},
publisher = {{ACM}},
year = {2017}
}
@article{DBLP:journals/corr/DurfeePPR17,
author = {David Durfee and
John Peebles and
Richard Peng and
Anup B. Rao},
title = {Determinant-Preserving Sparsification of {SDDM} Matrices with Applications
to Counting and Sampling Spanning Trees},
journal = {CoRR},
volume = {abs/1705.00985},
year = {2017}
}
@article{DBLP:journals/corr/0001MPS17,
author = {Jerry Li and
Aleksander Madry and
John Peebles and
Ludwig Schmidt},
title = {Towards Understanding the Dynamics of Generative Adversarial Networks},
journal = {CoRR},
volume = {abs/1706.09884},
year = {2017}
}
@article{DBLP:journals/corr/abs-1708-02728,
author = {Ilias Diakonikolas and
Themis Gouleakis and
John Peebles and
Eric Price},
title = {Sample-Optimal Identity Testing with High Probability},
journal = {CoRR},
volume = {abs/1708.02728},
year = {2017}
}
@article{DBLP:journals/eccc/DiakonikolasGPP17,
author = {Ilias Diakonikolas and
Themis Gouleakis and
John Peebles and
Eric Price},
title = {Sample-Optimal Identity Testing with High Probability},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-133}},
year = {2017}
}
@inproceedings{DBLP:conf/focs/CohenKPPSV16,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Aaron Sidford and
Adrian Vladu},
title = {Faster Algorithms for Computing the Stationary Distribution, Simulating
Random Walks, and More},
booktitle = {{FOCS}},
pages = {583--592},
publisher = {{IEEE} Computer Society},
year = {2016}
}
@article{DBLP:journals/corr/AliakbarpourBGP16,
author = {Maryam Aliakbarpour and
Amartya Shankha Biswas and
Themistoklis Gouleakis and
John Peebles and
Ronitt Rubinfeld and
Anak Yodpinyanee},
title = {Sublinear-Time Algorithms for Counting Star Subgraphs with Applications
to Join Selectivity Estimation},
journal = {CoRR},
volume = {abs/1601.04233},
year = {2016}
}
@article{DBLP:journals/corr/CohenKPPSV16,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Aaron Sidford and
Adrian Vladu},
title = {Faster Algorithms for Computing the Stationary Distribution, Simulating
Random Walks, and More},
journal = {CoRR},
volume = {abs/1608.03270},
year = {2016}
}
@article{DBLP:journals/corr/CohenKPPRSV16,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford and
Adrian Vladu},
title = {Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives
for Directed Graphs},
journal = {CoRR},
volume = {abs/1611.00755},
year = {2016}
}
@article{DBLP:journals/corr/DiakonikolasGPP16,
author = {Ilias Diakonikolas and
Themis Gouleakis and
John Peebles and
Eric Price},
title = {Collision-based Testers are Optimal for Uniformity and Closeness},
journal = {CoRR},
volume = {abs/1611.03579},
year = {2016}
}
@article{DBLP:journals/corr/DurfeeKPRS16,
author = {David Durfee and
Rasmus Kyng and
John Peebles and
Anup B. Rao and
Sushant Sachdeva},
title = {Sampling Random Spanning Trees Faster than Matrix Multiplication},
journal = {CoRR},
volume = {abs/1611.07451},
year = {2016}
}
@article{DBLP:journals/eccc/DiakonikolasGPP16,
author = {Ilias Diakonikolas and
Themis Gouleakis and
John Peebles and
Eric Price},
title = {Collision-based Testers are Optimal for Uniformity and Closeness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-178}},
year = {2016}
}
@inproceedings{DBLP:conf/icalp/LiP15,
author = {Jerry Li and
John Peebles},
title = {Replacing Mark Bits with Randomness in Fibonacci Heaps},
booktitle = {{ICALP} {(1)}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {886--897},
publisher = {Springer},
year = {2015}
}
@article{DBLP:journals/corr/LiP14,
author = {Jerry Li and
John Peebles},
title = {Replacing Mark Bits with Randomness in Fibonacci Heaps},
journal = {CoRR},
volume = {abs/1407.2569},
year = {2014}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
