Jakub W. Pachocki

Available identifiers

zbMath Open pachocki.jakub-wMaRDI QIDQ1698719

List of research outcomes

Publication	Date of Publication	Type
A note on the maximum number of \(k\)-powers in a finite word	2024-10-07	Paper
A note on the maximum number of $k$-powers in a finite word	2022-05-20	Paper
Online row sampling	2021-04-01	Paper
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism	2018-07-16	Paper
A framework for analyzing resparsification algorithms	2018-07-16	Paper
Tight lower bounds on graph embedding problems	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	2018-02-16	Paper
Geometric median in nearly linear time	2017-09-29	Paper
Routing under balance	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	2015-06-26	Paper
On the string consensus problem and the Manhattan sequence consensus problem	2015-02-10	Paper
Efficient counting of square substrings in a tree	2014-07-07	Paper
Efficient counting of square substrings in a tree	2013-03-21	Paper
A note on efficient computation of all abelian periods in a string	2013-03-20	Paper

Research outcomes over time

This page was built for person: Jakub W. Pachocki