default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Pachocki
Person information
- affiliation: OpenAI, San Francisco, CA, USA
- affiliation: Harvard University, Cambridge, MA, USA
- affiliation (PhD): Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, USA
- affiliation: University of Warsaw, Faculty of Mathematics, Informatics and Mechanics, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Shuo Li, Jakub Pachocki, Jakub Radoszewski:
A Note on the Maximum Number of k-Powers in a Finite Word. Electron. J. Comb. 31(3) (2024)- 2022
- [i21]Greg Yang, Edward J. Hu, Igor Babuschkin, Szymon Sidor, Xiaodong Liu, David Farhi, Nick Ryder, Jakub Pachocki, Weizhu Chen, Jianfeng Gao:
Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer. CoRR abs/2203.03466 (2022) - 2021
- [c15]Ge Yang, Edward J. Hu, Igor Babuschkin, Szymon Sidor, Xiaodong Liu, David Farhi, Nick Ryder, Jakub Pachocki, Weizhu Chen, Jianfeng Gao:
Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer. NeurIPS 2021: 17084-17097 - 2020
- [j6]Marcin Andrychowicz, Bowen Baker, Maciek Chociej, Rafal Józefowicz, Bob McGrew, Jakub Pachocki, Arthur Petron
, Matthias Plappert, Glenn Powell, Alex Ray, Jonas Schneider, Szymon Sidor, Josh Tobin, Peter Welinder, Lilian Weng, Wojciech Zaremba:
Learning dexterous in-hand manipulation. Int. J. Robotics Res. 39(1) (2020) - [j5]Michael B. Cohen, Cameron Musco, Jakub Pachocki:
Online Row Sampling. Theory Comput. 16: 1-25 (2020)
2010 – 2019
- 2019
- [c14]Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki:
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. ECML/PKDD (1) 2019: 378-394 - [i20]Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, Jakub Pachocki:
Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. CoRR abs/1904.08178 (2019) - [i19]Christopher Berner, Greg Brockman, Brooke Chan, Vicki Cheung, Przemyslaw Debiak, Christy Dennison, David Farhi, Quirin Fischer, Shariq Hashme, Christopher Hesse, Rafal Józefowicz, Scott Gray, Catherine Olsson, Jakub Pachocki, Michael Petrov, Henrique Pondé de Oliveira Pinto, Jonathan Raiman, Tim Salimans, Jeremy Schlatter, Jonas Schneider, Szymon Sidor, Ilya Sutskever, Jie Tang, Filip Wolski, Susan Zhang:
Dota 2 with Large Scale Deep Reinforcement Learning. CoRR abs/1912.06680 (2019) - 2018
- [j4]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the string consensus problem and the Manhattan sequence consensus problem. Theor. Comput. Sci. 710: 126-138 (2018) - [c13]Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, Igor Mordatch:
Emergent Complexity via Multi-Agent Competition. ICLR (Poster) 2018 - [c12]Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams:
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. SODA 2018: 1374-1392 - [i18]OpenAI, Marcin Andrychowicz, Bowen Baker, Maciek Chociej, Rafal Józefowicz, Bob McGrew, Jakub Pachocki, Arthur Petron, Matthias Plappert, Glenn Powell, Alex Ray, Jonas Schneider, Szymon Sidor, Josh Tobin, Peter Welinder, Lilian Weng, Wojciech Zaremba:
Learning Dexterous In-Hand Manipulation. CoRR abs/1808.00177 (2018) - [i17]Timothy Chu, Michael B. Cohen, Jakub W. Pachocki, Richard Peng:
Constant Arboricity Spectral Sparsifiers. CoRR abs/1808.05662 (2018) - 2017
- [j3]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. J. ACM 64(3): 18:1-18:22 (2017) - [c11]Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh:
Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. FOCS 2017: 475-486 - [c10]Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva:
A Framework for Analyzing Resparsification Algorithms. SODA 2017: 2032-2043 - [c9]Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher:
Scalable Motif-aware Graph Clustering. WWW 2017: 1451-1460 - [i16]Jelani Nelson, Jakub Pachocki, Zhengyu Wang:
Optimal lower bounds for universal relation, samplers, and finding duplicates. CoRR abs/1703.08139 (2017) - [i15]Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh:
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams. CoRR abs/1704.00633 (2017) - [i14]Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, Igor Mordatch:
Emergent Complexity via Multi-Agent Competition. CoRR abs/1710.03748 (2017) - 2016
- [c8]Michael B. Cohen, Cameron Musco, Jakub Pachocki:
Online Row Sampling. APPROX-RANDOM 2016: 7:1-7:18 - [c7]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. SODA 2016: 1643-1649 - [c6]Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Geometric median in nearly linear time. STOC 2016: 9-21 - [c5]Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Routing under balance. STOC 2016: 598-611 - [i13]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. CoRR abs/1602.05016 (2016) - [i12]Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Routing under Balance. CoRR abs/1603.09009 (2016) - [i11]Michael B. Cohen, Cameron Musco, Jakub Pachocki:
Online Row Sampling. CoRR abs/1604.05448 (2016) - [i10]Jakub Pachocki:
Analysis of Resparsification. CoRR abs/1605.08194 (2016) - [i9]Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Geometric Median in Nearly Linear Time. CoRR abs/1606.05225 (2016) - [i8]Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher:
Scalable motif-aware graph clustering. CoRR abs/1606.06235 (2016) - [i7]Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams:
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. CoRR abs/1611.00721 (2016) - [i6]Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva:
A Framework for Analyzing Resparsification Algorithms. CoRR abs/1611.06940 (2016) - 2015
- [c4]Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu:
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. KDD 2015: 815-824 - [i5]Marek Cygan, Jakub Pachocki, Arkadiusz Socala:
The Hardness of Subgraph Isomorphism. CoRR abs/1504.02876 (2015) - 2014
- [j2]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient counting of square substrings in a tree. Theor. Comput. Sci. 544: 60-73 (2014) - [c3]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE 2014: 244-255 - [c2]Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu:
Solving SDD linear systems in nearly mlog1/2n time. STOC 2014: 343-352 - [i4]Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Shen Chen Xu:
Stretching Stretch. CoRR abs/1401.2454 (2014) - [i3]Michael B. Cohen, Rasmus Kyng, Jakub W. Pachocki, Richard Peng, Anup B. Rao:
Preconditioning in Expectation. CoRR abs/1401.6236 (2014) - [i2]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. CoRR abs/1407.6144 (2014) - 2013
- [j1]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113(3): 74-77 (2013) - 2012
- [c1]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Counting of Square Substrings in a Tree. ISAAC 2012: 207-216 - [i1]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A Note on Efficient Computation of All Abelian Periods in a String. CoRR abs/1208.3313 (2012)
Coauthor Index
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-10-07 22:11 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:
