default search action
John Peebles
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i20]Tom Gunter, Zirui Wang, Chong Wang, Ruoming Pang, Andy Narayanan, Aonan Zhang, Bowen Zhang, Chen Chen, Chung-Cheng Chiu, David Qiu, Deepak Gopinath, Dian Ang Yap, Dong Yin, Feng Nan, Floris Weers, Guoli Yin, Haoshuo Huang, Jianyu Wang, Jiarui Lu, John Peebles, Ke Ye, Mark Lee, Nan Du, Qibin Chen, Quentin Keunebroek, Sam Wiseman, Syd Evans, Tao Lei, Vivek Rathod, Xiang Kong, Xianzhi Du, Yanghao Li, Yongqiang Wang, Yuan Gao, Zaid Ahmed, Zhaoyang Xu, Zhiyun Lu, Al Rashid, Albin Madappally Jose, Alec Doane, Alfredo Bencomo, Allison Vanderby, Andrew Hansen, Ankur Jain, Anupama Mann Anupama, Areeba Kamal, Bugu Wu, Carolina Brum, Charlie Maalouf, Chinguun Erdenebileg, Chris Dulhanty, Dominik Moritz, Doug Kang, Eduardo Jimenez, Evan Ladd, Fangping Shi, Felix Bai, Frank Chu, Fred Hohman, Hadas Kotek, Hannah Gillis Coleman, Jane Li, Jeffrey P. Bigham, Jeffery Cao, Jeff Lai, Jessica Cheung, Jiulong Shan, Joe Zhou, John Li, Jun Qin, Karanjeet Singh, Karla Vega, Kelvin Zou, Laura Heckman, Lauren Gardiner, Margit Bowler, Maria Cordell, Meng Cao, Nicole Hay, Nilesh Shahdadpuri, Otto Godwin, Pranay Dighe, Pushyami Rachapudi, Ramsey Tantawi, Roman Frigg, Sam Davarnia, Sanskruti Shah, Saptarshi Guha, Sasha Sirovica, Shen Ma, Shuang Ma, Simon Wang, Sulgi Kim, Suma Jayaram, Vaishaal Shankar, Varsha Paidi, Vivek Kumar, Xin Wang, Xin Zheng, Walker Cheng:
Apple Intelligence Foundation Language Models. CoRR abs/2407.21075 (2024) - 2023
- [c15]AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan:
Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. FOCS 2023: 846-854 - [i19]AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan:
Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification. CoRR abs/2301.13541 (2023) - 2022
- [c14]Ilias Diakonikolas, Chrystalla Pavlou, John Peebles, Alistair Stewart:
Efficient Approximation Algorithms for the Inverse Semivalue Problem. AAMAS 2022: 354-362 - 2021
- [c13]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, John Peebles, Eric Price:
Optimal testing of discrete distributions with high probability. STOC 2021: 542-555 - 2020
- [j3]David Durfee, John Peebles, Richard Peng, Anup B. Rao:
Determinant-Preserving Sparsification of SDDM Matrices. SIAM J. Comput. 49(4) (2020) - [c12]William S. Peebles, John Peebles, Jun-Yan Zhu, Alexei A. Efros
, Antonio Torralba:
The Hessian Penalty: A Weak Prior for Unsupervised Disentanglement. ECCV (6) 2020: 581-597 - [c11]AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan:
High-precision Estimation of Random Walks in Small Space. FOCS 2020: 1295-1306 - [i18]William S. Peebles, John Peebles, Jun-Yan Zhu, Alexei A. Efros, Antonio Torralba:
The Hessian Penalty: A Weak Prior for Unsupervised Disentanglement. CoRR abs/2008.10599 (2020) - [i17]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, John Peebles, Eric Price:
Optimal Testing of Discrete Distributions with High Probability. CoRR abs/2009.06540 (2020) - [i16]Ilias Diakonikolas, Themis Gouleakis, Daniel Kane, John Peebles, Eric Price:
Optimal Testing of Discrete Distributions with High Probability. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j2]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Collision-Based Testers are Optimal for Uniformity and Closeness. Chic. J. Theor. Comput. Sci. 2019 (2019) - [c10]Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Towards Testing Monotonicity of Distributions Over General Posets. COLT 2019: 34-82 - [c9]Ilias Diakonikolas, Daniel M. Kane, John Peebles:
Testing Identity of Multidimensional Histograms. COLT 2019: 1107-1131 - [i15]Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Towards Testing Monotonicity of Distributions Over General Posets. CoRR abs/1907.03182 (2019) - [i14]AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan:
High-precision Estimation of Random Walks in Small Space. CoRR abs/1912.04524 (2019) - 2018
- [j1]Maryam Aliakbarpour
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. Algorithmica 80(2): 668-697 (2018) - [c8]Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford:
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. FOCS 2018: 898-909 - [c7]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Sample-Optimal Identity Testing with High Probability. ICALP 2018: 41:1-41:14 - [c6]Jerry Li, Aleksander Madry, John Peebles, Ludwig Schmidt:
On the Limitations of First-Order Approximation in GAN Dynamics. ICML 2018: 3011-3019 - [i13]Ilias Diakonikolas, Daniel M. Kane, John Peebles:
Testing Identity of Multidimensional Histograms. CoRR abs/1804.03636 (2018) - [i12]Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford:
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. CoRR abs/1811.10722 (2018) - 2017
- [c5]David Durfee, John Peebles, Richard Peng, Anup B. Rao:
Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. FOCS 2017: 926-937 - [c4]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu:
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. STOC 2017: 410-419 - [c3]David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva
Sampling random spanning trees faster than matrix multiplication. STOC 2017: 730-742 - [i11]David Durfee, John Peebles, Richard Peng, Anup B. Rao:
Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees. CoRR abs/1705.00985 (2017) - [i10]Jerry Li, Aleksander Madry, John Peebles, Ludwig Schmidt:
Towards Understanding the Dynamics of Generative Adversarial Networks. CoRR abs/1706.09884 (2017) - [i9]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Sample-Optimal Identity Testing with High Probability. CoRR abs/1708.02728 (2017) - [i8]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Sample-Optimal Identity Testing with High Probability. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c2]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. FOCS 2016: 583-592 - [i7]Maryam Aliakbarpour, Amartya Shankha Biswas, Themistoklis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation. CoRR abs/1601.04233 (2016) - [i6]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. CoRR abs/1608.03270 (2016) - [i5]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu:
Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs. CoRR abs/1611.00755 (2016) - [i4]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Collision-based Testers are Optimal for Uniformity and Closeness. CoRR abs/1611.03579 (2016) - [i3]David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva:
Sampling Random Spanning Trees Faster than Matrix Multiplication. CoRR abs/1611.07451 (2016) - [i2]Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Collision-based Testers are Optimal for Uniformity and Closeness. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c1]Jerry Li, John Peebles:
Replacing Mark Bits with Randomness in Fibonacci Heaps. ICALP (1) 2015: 886-897 - 2014
- [i1]Jerry Li, John Peebles:
Replacing Mark Bits with Randomness in Fibonacci Heaps. CoRR abs/1407.2569 (2014)
Coauthor Index
aka: Themistoklis Gouleakis
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:15 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: