default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtur Czumaj
Person information
- affiliation: University of Warwick, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j77]Artur Czumaj, Peter Davies-Peck, Merav Parter:
Component stability in low-space massively parallel computation. Distributed Comput. 37(1): 35-64 (2024)- [j76]Artur Czumaj, Christian Sohler:
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph. SIAM J. Comput. 53(2): 524-571 (2024) - [j75]Sam Coy
, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann:
Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024) - [c105]Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra:
Parallel Derandomization for Coloring (Abstract). HOPC@SPAA 2024 - [c104]Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully-Scalable MPC Algorithms for Clustering in High Dimension. ICALP 2024: 50:1-50:20 - [c103]Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra:
Parallel Derandomization for Coloring. IPDPS 2024: 1058-1069 - [c102]Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Streaming Graph Algorithms in the Massively Parallel Computation Model. PODC 2024: 496-507 - [c101]Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Log Diameter Rounds MST Verification and Sensitivity in MPC. SPAA 2024: 269-280 - [i41]Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Log Diameter Rounds MST Verification and Sensitivity in MPC. CoRR abs/2408.00398 (2024) - 2023
- [j74]Artur Czumaj:
Letter from the President. Bull. EATCS 139 (2023) - [j73]Artur Czumaj:
Letter from the President. Bull. EATCS 140 (2023) - [j72]Artur Czumaj:
Letter from the President. Bull. EATCS 141 (2023) - [j71]Artur Czumaj, Andrzej Lingas:
On parallel time in population protocols. Inf. Process. Lett. 179: 106314 (2023) - [j70]Artur Czumaj, George Kontogeorgiou, Mike Paterson:
Haystack hunting hints and locker room communication. Random Struct. Algorithms 62(4): 832-856 (2023) - [j69]Sam Coy, Artur Czumaj:
Deterministic Massively Parallel Connectivity. SIAM J. Comput. 52(5): 1269-1318 (2023) - [c100]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Optimal (Degree+1)-Coloring in Congested Clique. ICALP 2023: 46:1-46:20 - [c99]Artur Czumaj:
Modern Parallel Algorithms (Invited Talk). MFCS 2023: 3:1-3:2 - [c98]Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann:
Routing Schemes for Hybrid Communication Networks. SIROCCO 2023: 317-338 - [c97]Sam Coy, Artur Czumaj, Gopinath Mishra:
On Parallel k-Center Clustering. SPAA 2023: 65-75 - [i40]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Fast Parallel Degree+1 List Coloring. CoRR abs/2302.04378 (2023) - [i39]Sam Coy, Artur Czumaj, Gopinath Mishra:
On Parallel k-Center Clustering. CoRR abs/2304.05883 (2023) - [i38]Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra:
Optimal (degree+1)-Coloring in Congested Clique. CoRR abs/2306.12071 (2023) - [i37]Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully Scalable MPC Algorithms for Clustering in High Dimension. CoRR abs/2307.07848 (2023) - 2022
- [j68]Artur Czumaj:
Letter from the President. Bull. EATCS 136 (2022) - [j67]Artur Czumaj:
Letter from the President. Bull. EATCS 137 (2022) - [j66]Artur Czumaj:
Letter from the President. Bull. EATCS 138 (2022) - [j65]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. 51(3): 701-722 (2022) - [c96]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang:
Streaming Facility Location in High Dimension via Geometric Hashing. FOCS 2022: 450-461 - [c95]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Streaming Algorithms for Geometric Steiner Forest. ICALP 2022: 47:1-47:20 - [c94]Sam Coy, Artur Czumaj:
Deterministic massively parallel connectivity. STOC 2022: 162-175 - [e8]Artur Czumaj, Qin Xin:
18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands. LIPIcs 227, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-236-5 [contents] - [i36]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 abs/2202.08008 (2022) - [i35]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang:
Streaming Facility Location in High Dimension via New Geometric Hashing. CoRR abs/2204.02095 (2022) - [i34]Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann:
Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs. CoRR abs/2210.05333 (2022) - 2021
- [j64]Artur Czumaj:
Letter from the President. Bull. EATCS 133 (2021) - [j63]Artur Czumaj:
Letter from the President. Bull. EATCS 134 (2021) - [j62]Artur Czumaj:
Letter from the President. Bull. EATCS 135 (2021) - [j61]Artur Czumaj, Peter Davies:
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. J. ACM 68(2): 13:1-13:22 (2021) - [j60]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM J. Comput. 50(5): 1603-1626 (2021) - [j59]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Trans. Algorithms 17(2): 16:1-16:27 (2021) - [c93]Artur Czumaj, George Kontogeorgiou, Mike Paterson:
Haystack Hunting Hints and Locker Room Communication. ICALP 2021: 58:1-58:20 - [c92]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: 11:1-11:23 - [c91]Artur Czumaj, Peter Davies, Merav Parter:
Improved Deterministic (Δ+1) Coloring in Low-Space MPC. PODC 2021: 469-479 - [c90]Artur Czumaj, Peter Davies, Merav Parter:
Component Stability in Low-Space Massively Parallel Computation. PODC 2021: 481-491 - [i33]Artur Czumaj, Peter Davies, Merav Parter:
Component Stability in Low-Space Massively Parallel Computation. CoRR abs/2106.01880 (2021) - [i32]Sam Coy, Artur Czumaj:
Deterministic Massively Parallel Connectivity. CoRR abs/2108.04102 (2021) - [i31]Artur Czumaj, Andrzej Lingas:
On Truly Parallel Time in Population Protocols. CoRR abs/2108.11613 (2021) - [i30]Artur Czumaj, Peter Davies, Merav Parter:
Improved Deterministic (Δ+1)-Coloring in Low-Space MPC. CoRR abs/2112.05831 (2021) - 2020
- [j58]Artur Czumaj, Christian Konrad:
Detecting cliques in CONGEST networks. Distributed Comput. 33(6): 533-543 (2020) - [j57]Artur Czumaj:
The EATCS Award 2020 - Laudatio for Mihalis Yannakakis. Bull. EATCS 131 (2020) - [j56]Artur Czumaj:
Letter from the President. Bull. EATCS 132 (2020) - [j55]Artur Czumaj, Anca Muscholl:
Report on ICALP 2020. Bull. EATCS 132 (2020) - [j54]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49(5) (2020) - [c89]Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Testable Properties in General Graphs and Random Order Streaming. APPROX-RANDOM 2020: 16:1-16:20 - [c88]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. PODC 2020: 309-318 - [c87]Artur Czumaj, Christian Sohler:
Sublinear time approximation of the cost of a metric k-nearest neighbor graph. SODA 2020: 2973-2992 - [c86]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. SPAA 2020: 175-185 - [e7]Artur Czumaj, Anuj Dawar, Emanuela Merelli:
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference). LIPIcs 168, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-138-2 [contents] - [i29]Artur Czumaj, George Kontogeorgiou, Mike Paterson:
Combinatorial Communication in the Locker Room. CoRR abs/2008.11448 (2020) - [i28]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. CoRR abs/2009.06043 (2020) - [i27]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Streaming Algorithms for Geometric Steiner Forest. CoRR abs/2011.04324 (2020)
2010 – 2019
- 2019
- [j53]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81(3): 1205-1231 (2019) - [j52]Artur Czumaj, Marta Kwiatkowska, Éva Tardos:
The EATCS Award 2020 - Call for Nominations. Bull. EATCS 129 (2019) - [j51]Artur Czumaj, Peter Davies:
Communicating with beeps. J. Parallel Distributed Comput. 130: 98-109 (2019) - [j50]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar graphs: Random walks and bipartiteness testing. Random Struct. Algorithms 55(1): 104-124 (2019) - [j49]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15(1): 6:1-6:18 (2019) - [j48]Artur Czumaj, Peter Davies:
Leader election in multi-hop radio networks. Theor. Comput. Sci. 792: 2-11 (2019) - [c85]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: 1525-1548 - [i26]Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Testable Properties in General Graphs and Random Order Streaming. CoRR abs/1905.01644 (2019) - [i25]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 abs/1909.10647 (2019) - [i24]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. CoRR abs/1912.05390 (2019) - 2018
- [j47]Artur Czumaj, Robert Krauthgamer:
Report on HALG 2018. Bull. EATCS 126 (2018) - [j46]Artur Czumaj, Peter Davies:
Deterministic Communication in Radio Networks. SIAM J. Comput. 47(1): 218-240 (2018) - [j45]Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk:
Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. 32(4): 2720-2746 (2018) - [j44]Artur Czumaj, Robert Krauthgamer:
3rd Highlights of Algorithms (HALG 2018). SIGACT News 49(3): 74-77 (2018) - [c84]Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski:
Online Facility Location with Deletions. ESA 2018: 21:1-21:15 - [c83]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round compression for parallel matching algorithms. STOC 2018: 471-484 - [c82]Artur Czumaj, Yishay Mansour, Shai Vardi:
Sublinear Graph Augmentation for Fast Query Implementation. WAOA 2018: 181-203 - [c81]Artur Czumaj, Peter Davies:
Deterministic Blind Radio Networks. DISC 2018: 15:1-15:17 - [c80]Artur Czumaj, Christian Konrad:
Detecting Cliques in CONGEST Networks. DISC 2018: 16:1-16:15 - [c79]Artur Czumaj, Peter Davies:
Brief Announcement: Randomized Blind Radio Networks. DISC 2018: 43:1-43:3 - [p3]Artur Czumaj, Andrzej Lingas:
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [e6]Artur Czumaj:
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. SIAM 2018, ISBN 978-1-61197-503-1 [contents] - [i23]Artur Czumaj, Peter Davies:
Deterministic Blind Radio Networks. CoRR abs/1805.04838 (2018) - [i22]Artur Czumaj, Peter Davies:
Randomized Communication Without Network Knowledge. CoRR abs/1805.04842 (2018) - [i21]Artur Czumaj, Christian Konrad:
Detecting cliques in CONGEST networks. CoRR abs/1807.01070 (2018) - [i20]Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski:
Online Facility Location with Deletions. CoRR abs/1807.03839 (2018) - 2017
- [j43]Artur Czumaj, Stefano Leonardi:
Report on HALG 2016/2017. Bull. EATCS 123 (2017) - [j42]Artur Czumaj, Stefano Leonardi:
HALG: Highlights of Algorithms. SIGACT News 48(3): 83-86 (2017) - [c78]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Multi-player Approximate Nash Equilibria. AAMAS 2017: 1511-1513 - [c77]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Zero-Sum Game Techniques for Approximate Nash Equilibria. AAMAS 2017: 1514-1516 - [c76]Artur Czumaj, Peter Davies:
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. PODC 2017: 3-12 - [r10]Artur Czumaj, Christian Sohler:
Sublinear Clustering. Encyclopedia of Machine Learning and Data Mining 2017: 1205-1209 - [i19]Artur Czumaj, Peter Davies:
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. CoRR abs/1703.01859 (2017) - [i18]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. CoRR abs/1707.03478 (2017) - 2016
- [c75]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract). AAMAS 2016: 1409-1410 - [c74]Artur Czumaj, Peter Davies:
Faster Deterministic Communication in Radio Networks. ICALP 2016: 139:1-139:14 - [c73]Artur Czumaj, Peter Davies:
Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks. PODC 2016: 47-49 - [c72]Artur Czumaj, Pan Peng, Christian Sohler:
Relating two property testing models for bounded degree directed graphs. STOC 2016: 1033-1045 - [c71]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. WINE 2016: 15-28 - [r9]Artur Czumaj:
Euclidean Traveling Salesman Problem. Encyclopedia of Algorithms 2016: 653-657 - [r8]Artur Czumaj, Andrzej Lingas:
Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2016: 1318-1322 - [r7]Artur Czumaj, Berthold Vöcking:
Price of Anarchy for Machines Models. Encyclopedia of Algorithms 2016: 1614-1618 - 2015
- [c70]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Nash Equilibria with Near Optimal Social Welfare. IJCAI 2015: 504-510 - [c69]Artur Czumaj, Peter Davies:
Communicating with Beeps. OPODIS 2015: 30:1-30:16 - [c68]Artur Czumaj:
Random Permutations using Switching Networks. STOC 2015: 703-712 - [c67]Artur Czumaj, Pan Peng, Christian Sohler:
Testing Cluster Structure of Graphs. STOC 2015: 723-732 - [e5]Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko:
Surveys in Combinatorics 2015. London Mathematical Society Lecture Note Series 424, Cambridge University Press 2015, ISBN 9781316106853 [contents] - [i17]Artur Czumaj, Pan Peng, Christian Sohler:
Testing Cluster Structure of Graphs. CoRR abs/1504.03294 (2015) - [i16]Artur Czumaj, Peter Davies:
Communicating with Beeps. CoRR abs/1505.06107 (2015) - [i15]Artur Czumaj, Peter Davies:
Optimal leader election in multi-hop radio networks. CoRR abs/1505.06149 (2015) - [i14]Artur Czumaj, Peter Davies:
Almost Optimal Deterministic Broadcast in Radio Networks. CoRR abs/1506.00853 (2015) - [i13]Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani:
Distributed Methods for Computing Approximate Equilibria. CoRR abs/1512.03315 (2015) - 2014
- [j41]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding cycles and trees in sublinear time. Random Struct. Algorithms 45(2): 139-184 (2014) - [c66]Artur Czumaj, Berthold Vöcking:
Thorp Shuffling, Butterflies, and Non-Markovian Couplings. ICALP (1) 2014: 344-355 - [c65]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games. SAGT 2014: 244-254 - [i12]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. CoRR abs/1407.2109 (2014) - [i11]Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski:
Approximate well-supported Nash equilibria in symmetric bimatrix games. CoRR abs/1407.3004 (2014) - 2013
- [j40]Artur Czumaj, Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald, Xin Wang:
Fast message dissemination in random geometric networks. Distributed Comput. 26(1): 1-24 (2013) - [c64]Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler:
(1+ Є)-approximation for facility location in data streams. SODA 2013: 1710-1728 - 2012
- [c63]Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel:
Multiple-Choice Balanced Allocation in (Almost) Parallel. APPROX-RANDOM 2012: 411-422 - [c62]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-competitive algorithm for generalized caching. SODA 2012: 1681-1689 - [c61]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Optimal online buffer scheduling for block devices. STOC 2012: 589-598 - [e4]Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer:
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I. Lecture Notes in Computer Science 7391, Springer 2012, ISBN 978-3-642-31593-0 [contents] - [e3]Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer:
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II. Lecture Notes in Computer Science 7392, Springer 2012, ISBN 978-3-642-31584-8 [contents] - [i10]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j39]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22(8): 1949-1969 (2011) - [c60]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. FOCS 2011: 423-432 - [c59]