Artur Czumaj

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 103

Top Venues

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
Fully-Scalable MPC Algorithms for Clustering in High Dimension. ICALP (2024)
Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra
Parallel Derandomization for Coloring. IPDPS (2024)
Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra
Parallel Derandomization for Coloring (Abstract). HOPC@SPAA (2024)
Artur Czumaj, Gopinath Mishra, Anish Mukherjee
Streaming Graph Algorithms in the Massively Parallel Computation Model. PODC (2024)
Artur Czumaj, Christian Sohler
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph. SIAM J. Comput. 53 (2) (2024)
Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee
Log Diameter Rounds MST Verification and Sensitivity in MPC. SPAA (2024)
Artur Czumaj, Peter Davies-Peck, Merav Parter
Component stability in low-space massively parallel computation. Distributed Comput. 37 (1) (2024)
Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann
Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985 (2024)
Artur Czumaj
Letter from the President. Bull. EATCS 140 (2023)
Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra
Optimal (degree+1)-Coloring in Congested Clique. CoRR (2023)
Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra
Fast Parallel Degree+1 List Coloring. CoRR (2023)
Artur Czumaj
Modern Parallel Algorithms (Invited Talk). MFCS (2023)
Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra
Optimal (Degree+1)-Coloring in Congested Clique. ICALP (2023)
Artur Czumaj
Letter from the President. Bull. EATCS 141 (2023)
Sam Coy, Artur Czumaj, Gopinath Mishra
On Parallel k-Center Clustering. SPAA (2023)
Artur Czumaj
Letter from the President. Bull. EATCS 139 (2023)
Sam Coy, Artur Czumaj
Deterministic Massively Parallel Connectivity. SIAM J. Comput. 52 (5) (2023)
Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann
Routing Schemes for Hybrid Communication Networks. SIROCCO (2023)
Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
Fully Scalable MPC Algorithms for Clustering in High Dimension. CoRR (2023)
Artur Czumaj, Andrzej Lingas
On parallel time in population protocols. Inf. Process. Lett. 179 (2023)
Sam Coy, Artur Czumaj, Gopinath Mishra
On Parallel k-Center Clustering. CoRR (2023)
Artur Czumaj, George Kontogeorgiou, Mike Paterson
Haystack hunting hints and locker room communication. Random Struct. Algorithms 62 (4) (2023)
Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang
Streaming Facility Location in High Dimension via New Geometric Hashing. CoRR (2022)
Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
Streaming Algorithms for Geometric Steiner Forest. ICALP (2022)
Artur Czumaj
Letter from the President. Bull. EATCS 137 (2022)
Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs
Near-Shortest Path Routing in Hybrid Communication Networks. CoRR (2022)
Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann
Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs. CoRR (2022)
Sam Coy, Artur Czumaj
Deterministic massively parallel connectivity. STOC (2022)
Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang
Streaming Facility Location in High Dimension via Geometric Hashing. FOCS (2022)
Artur Czumaj
Letter from the President. Bull. EATCS 136 (2022)
Artur Czumaj
Letter from the President. Bull. EATCS 138 (2022)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. 51 (3) (2022)
Artur Czumaj, Peter Davies, Merav Parter
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Trans. Algorithms 17 (2) (2021)
Artur Czumaj, George Kontogeorgiou, Mike Paterson
Haystack Hunting Hints and Locker Room Communication. ICALP (2021)
Artur Czumaj
Letter from the President. Bull. EATCS 134 (2021)
Artur Czumaj, Peter Davies, Merav Parter
Improved Deterministic (Δ+1) Coloring in Low-Space MPC. PODC (2021)
Artur Czumaj, Peter Davies, Merav Parter
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM J. Comput. 50 (5) (2021)
Artur Czumaj
Letter from the President. Bull. EATCS 135 (2021)
Sam Coy, Artur Czumaj
Deterministic Massively Parallel Connectivity. CoRR (2021)
Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs
Near-Shortest Path Routing in Hybrid Communication Networks. OPODIS (2021)
Artur Czumaj, Andrzej Lingas
On Truly Parallel Time in Population Protocols. CoRR (2021)
Artur Czumaj, Peter Davies, Merav Parter
Component Stability in Low-Space Massively Parallel Computation. CoRR (2021)
Artur Czumaj
Letter from the President. Bull. EATCS 133 (2021)
Artur Czumaj, Peter Davies, Merav Parter
Component Stability in Low-Space Massively Parallel Computation. PODC (2021)
Artur Czumaj, Peter Davies, Merav Parter
Improved Deterministic (Δ+1)-Coloring in Low-Space MPC. CoRR (2021)
Artur Czumaj, Peter Davies
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. J. ACM 68 (2) (2021)
Artur Czumaj
Letter from the President. Bull. EATCS 132 (2020)
Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
Streaming Algorithms for Geometric Steiner Forest. CoRR (2020)
Artur Czumaj, Peter Davies, Merav Parter
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. SPAA (2020)
Artur Czumaj, Peter Davies, Merav Parter
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. CoRR (2020)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49 (5) (2020)
Artur Czumaj
The EATCS Award 2020 - Laudatio for Mihalis Yannakakis. Bull. EATCS 131 (2020)
Artur Czumaj, Christian Konrad
Detecting cliques in CONGEST networks. Distributed Comput. 33 (6) (2020)
Artur Czumaj, Christian Sohler
-nearest neighbor graph. SODA (2020)
Artur Czumaj, Anca Muscholl
Report on ICALP 2020. Bull. EATCS 132 (2020)
Artur Czumaj, George Kontogeorgiou, Mike Paterson
Combinatorial Communication in the Locker Room. CoRR (2020)
Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler
Testable Properties in General Graphs and Random Order Streaming. APPROX-RANDOM (2020)
Artur Czumaj, Peter Davies, Merav Parter
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. PODC (2020)
Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler
Planar graphs: Random walks and bipartiteness testing. Random Struct. Algorithms 55 (1) (2019)
Artur Czumaj, Peter Davies
Communicating with beeps. J. Parallel Distributed Comput. 130 (2019)
Artur Czumaj, Peter Davies
Leader election in multi-hop radio networks. Theor. Comput. Sci. 792 (2019)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15 (1) (2019)
Artur Czumaj, Marta Kwiatkowska, Éva Tardos
The EATCS Award 2020 - Call for Nominations. Bull. EATCS 129 (2019)
Artur Czumaj, Christian Sohler
A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs). FOCS (2019)
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81 (3) (2019)
Artur Czumaj, Peter Davies, Merav Parter
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. CoRR (2019)
Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler
Testable Properties in General Graphs and Random Order Streaming. CoRR (2019)
Artur Czumaj, Christian Sohler
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs). CoRR (2019)
Artur Czumaj, Peter Davies
Deterministic Blind Radio Networks. CoRR (2018)
Artur Czumaj, Christian Konrad
Detecting cliques in CONGEST networks. CoRR (2018)
Artur Czumaj, Peter Davies
Deterministic Communication in Radio Networks. SIAM J. Comput. 47 (1) (2018)
Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
Online Facility Location with Deletions. ESA (2018)
Artur Czumaj, Peter Davies
Randomized Communication Without Network Knowledge. CoRR (2018)
Artur Czumaj, Peter Davies
Brief Announcement: Randomized Blind Radio Networks. DISC (2018)
Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
Online Facility Location with Deletions. CoRR (2018)
Artur Czumaj, Yishay Mansour, Shai Vardi
Sublinear Graph Augmentation for Fast Query Implementation. WAOA (2018)
Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. 32 (4) (2018)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round compression for parallel matching algorithms. STOC (2018)
Artur Czumaj, Robert Krauthgamer
3rd Highlights of Algorithms (HALG 2018). SIGACT News 49 (3) (2018)
Artur Czumaj, Robert Krauthgamer
Report on HALG 2018. Bull. EATCS 126 (2018)
Artur Czumaj, Peter Davies
Deterministic Blind Radio Networks. DISC (2018)
Artur Czumaj, Christian Konrad
Detecting Cliques in CONGEST Networks. DISC (2018)
Artur Czumaj, Peter Davies
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. PODC (2017)
Artur Czumaj, Peter Davies
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. CoRR (2017)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Zero-Sum Game Techniques for Approximate Nash Equilibria. AAMAS (2017)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Multi-player Approximate Nash Equilibria. AAMAS (2017)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round Compression for Parallel Matching Algorithms. CoRR (2017)
Artur Czumaj, Stefano Leonardi
HALG: Highlights of Algorithms. SIGACT News 48 (3) (2017)
Artur Czumaj, Stefano Leonardi
Report on HALG 2016/2017. Bull. EATCS 123 (2017)
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
Distributed Methods for Computing Approximate Equilibria. WINE (2016)
Artur Czumaj, Peter Davies
Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks. PODC (2016)
Artur Czumaj, Pan Peng, Christian Sohler
Relating two property testing models for bounded degree directed graphs. STOC (2016)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract). AAMAS (2016)
Artur Czumaj, Peter Davies
Faster Deterministic Communication in Radio Networks. ICALP (2016)
Artur Czumaj, Peter Davies
Communicating with Beeps. OPODIS (2015)
Artur Czumaj, Pan Peng, Christian Sohler
Testing Cluster Structure of Graphs. STOC (2015)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Approximate Nash Equilibria with Near Optimal Social Welfare. IJCAI (2015)
Artur Czumaj, Pan Peng, Christian Sohler
Testing Cluster Structure of Graphs. CoRR (2015)
Artur Czumaj, Peter Davies
Optimal leader election in multi-hop radio networks. CoRR (2015)
Artur Czumaj, Peter Davies
Almost Optimal Deterministic Broadcast in Radio Networks. CoRR (2015)

Artur Czumaj.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Artur Czumaj