Jakub Pachocki
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
10
Venues
7
Active years
2012–2018
Best venue rank
A*
Where they publish
Papers
10 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2018 | ICLR | Emergent Complexity via Multi-Agent Competition. | Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, Igor Mordatch |
| 2018 | SODA | Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. | Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams |
| 2017 | FOCS | Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. | Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh |
| 2017 | WWW | Scalable Motif-aware Graph Clustering. | Charalampos E. Tsourakakis, Jakub Pachocki, Michael Mitzenmacher |
| 2017 | SODA | A Framework for Analyzing Resparsification Algorithms. | Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva |
| 2016 | SODA | Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. | Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala |
| 2016 | STOC | Geometric median in nearly linear time. | Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford |
| 2016 | STOC | Routing under balance. | Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford |
| 2015 | KDD | Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling. | Michael Mitzenmacher, Jakub Pachocki, Richard Peng, Charalampos E. Tsourakakis, Shen Chen Xu |
| 2012 | ISAAC | Efficient Counting of Square Substrings in a Tree. | Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |