Jakub W. Pachocki

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A note on the maximum number of $k$-powers in a finite word The Electronic Journal of Combinatorics	2024-10-07	Paper
A note on the maximum number of $k$-powers in a finite word	2022-05-20	Paper
Online row sampling Theory of Computing	2021-04-01	Paper
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
A framework for analyzing resparsification algorithms Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Tight lower bounds on graph embedding problems Journal of the ACM	2018-05-17	Paper
Online row sampling	2018-04-19	Paper
Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners	2018-03-15	Paper
On the string consensus problem and the Manhattan sequence consensus problem Theoretical Computer Science	2018-02-16	Paper
Geometric median in nearly linear time Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2017-09-29	Paper
Routing under balance Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2017-09-29	Paper
Scalable motif-aware graph clustering	2016-06-20	Paper
Solving SDD linear systems in nearly $m \log^{1/2} n$ time Proceedings of the forty-sixth annual ACM symposium on Theory of computing	2015-06-26	Paper
On the string consensus problem and the Manhattan sequence consensus problem String Processing and Information Retrieval	2015-02-10	Paper
Efficient counting of square substrings in a tree Theoretical Computer Science	2014-07-07	Paper
Efficient counting of square substrings in a tree Algorithms and Computation	2013-03-21	Paper
A note on efficient computation of all abelian periods in a string Information Processing Letters	2013-03-20	Paper

Research outcomes over time

This page was built for person: Jakub W. Pachocki

Publication	Date of Publication	Type
A note on the maximum number of \(k\)-powers in a finite word The Electronic Journal of Combinatorics	2024-10-07	Paper
A note on the maximum number of $k$-powers in a finite word	2022-05-20	Paper
Online row sampling Theory of Computing	2021-04-01	Paper
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
A framework for analyzing resparsification algorithms Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Tight lower bounds on graph embedding problems Journal of the ACM	2018-05-17	Paper
Online row sampling	2018-04-19	Paper
Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners	2018-03-15	Paper
On the string consensus problem and the Manhattan sequence consensus problem Theoretical Computer Science	2018-02-16	Paper
Geometric median in nearly linear time Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2017-09-29	Paper
Routing under balance Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2017-09-29	Paper
Scalable motif-aware graph clustering	2016-06-20	Paper
Solving SDD linear systems in nearly \(m \log^{1/2} n\) time Proceedings of the forty-sixth annual ACM symposium on Theory of computing	2015-06-26	Paper
On the string consensus problem and the Manhattan sequence consensus problem String Processing and Information Retrieval	2015-02-10	Paper
Efficient counting of square substrings in a tree Theoretical Computer Science	2014-07-07	Paper
Efficient counting of square substrings in a tree Algorithms and Computation	2013-03-21	Paper
A note on efficient computation of all abelian periods in a string Information Processing Letters	2013-03-20	Paper