Personal information

Emails & domains

Verified email domains

Websites & social links

Personal homepage

Activities

Collapse all

Works (6)

Walking randomly, massively, and efficiently

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
2020-06-22 | Conference paper
DOI: 10.1145/3357713.3384303
Source: Self-asserted source
Krzysztof Onak

Round Compression for Parallel Matching Algorithms

SIAM Journal on Computing
2020-01 | Journal article
DOI: 10.1137/18m1197655
Part of ISSN: 0097-5397
Part of ISSN: 1095-7111
Source: Self-asserted source
Krzysztof Onak

Parallel algorithms for geometric graph problems

Proceedings of the forty-sixth annual ACM symposium on Theory of computing
2014-05-31 | Conference paper
DOI: 10.1145/2591796.2591805
Source: Self-asserted source
Krzysztof Onak

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

2010 IEEE 51st Annual Symposium on Foundations of Computer Science
2010-10 | Conference paper
DOI: 10.1109/focs.2010.43
Source: Self-asserted source
Krzysztof Onak

Maintaining a large matching and a small vertex cover

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10
2010-06 | Conference paper
DOI: 10.1145/1806689.1806753
Source: Self-asserted source
Krzysztof Onak

Constant-Time Approximation Algorithms via Local Improvements

2008 49th Annual IEEE Symposium on Foundations of Computer Science
2008-10 | Conference paper
DOI: 10.1109/focs.2008.81
Source: Self-asserted source
Krzysztof Onak
How many people are using ORCID?