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
[j78]Artur Czumaj, Peter Davies-Peck, Merav Parter:
Component stability in low-space massively parallel computation. Distributed Comput. 37(1): 35-64 (2024)- [j77]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) - [j76]Artur Czumaj
, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Streaming Algorithms for Geometric Steiner Forest. ACM Trans. Algorithms 20(4): 28:1-28:38 (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]Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk:
Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) 2011: 25-36 - [c58]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Almost tight bounds for reordering buffer management. STOC 2011: 607-616 - 2010
- [j38]Artur Czumaj, Christian Sohler:
Testing Expansion in Bounded-Degree Graphs. Comb. Probab. Comput. 19(5-6): 693-709 (2010) - [j37]Anna Adamaszek, Artur Czumaj, Andrzej Lingas:
Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. 21(6): 893-904 (2010) - [j36]Artur Czumaj, Christian Sohler:
Small Space Representations for Metric Min-sum k-Clustering and Their Applications. Theory Comput. Syst. 46(3): 416-442 (2010) - [j35]Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Selfish Traffic Allocation for Server Farms. SIAM J. Comput. 39(5): 1957-1987 (2010) - [c57]Artur Czumaj:
Local Graph Exploration and Fast Property Testing. ESA (1) 2010: 410-414 - [c56]Michal Adamaszek, Artur Czumaj, Christian Sohler:
Testing Monotone Continuous Distributions on High-dimensional Real Cubes. SODA 2010: 56-65 - [p2]Artur Czumaj, Christian Sohler:
Sublinear-time Algorithms. Property Testing 2010: 41-64 - [p1]Michal Adamaszek, Artur Czumaj, Christian Sohler:
Testing Monotone Continuous Distributions on High-Dimensional Real Cubes. Property Testing 2010: 228-233 - [r6]Artur Czumaj, Christian Sohler:
Sublinear Clustering. Encyclopedia of Machine Learning 2010: 933-937 - [i9]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. CoRR abs/1007.4230 (2010)
2000 – 2009
- 2009
- [j34]Artur Czumaj, Asaf Shapira, Christian Sohler:
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput. 38(6): 2499-2510 (2009) - [j33]Artur Czumaj, Andrzej Lingas:
Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication. SIAM J. Comput. 39(2): 431-444 (2009) - [j32]Artur Czumaj, Christian Sohler:
Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time. SIAM J. Comput. 39(3): 904-922 (2009) - [c55]Anna Adamaszek, Artur Czumaj, Andrzej Lingas:
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k. ISAAC 2009: 994-1003 - [c54]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180 - [i8]Anna Adamaszek, Artur Czumaj, Andrzej Lingas:
PTAS for k-tour cover problem on the plane for moderately large values of k. CoRR abs/0904.2576 (2009) - 2008
- [j31]Artur Czumaj, Christian Sohler:
Testing Euclidean minimum spanning trees in the plane. ACM Trans. Algorithms 4(3): 31:1-31:23 (2008) - [e2]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
Sublinear Algorithms, 17.08. - 22.08.2008. Dagstuhl Seminar Proceedings 08341, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r5]Artur Czumaj:
Euclidean Traveling Salesperson Problem. Encyclopedia of Algorithms 2008 - [r4]Artur Czumaj, Andrzej Lingas:
Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2008 - [r3]Artur Czumaj, Berthold Vöcking:
Price of Anarchy for Machines Models. Encyclopedia of Algorithms 2008 - [i7]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
08341 Abstracts Collection - Sublinear Algorithms. Sublinear Algorithms 2008 - [i6]Artur Czumaj, S. Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
08341 Executive Summary - Sublinear Algorithms. Sublinear Algorithms 2008 - 2007
- [j30]Artur Czumaj, Christian Sohler:
Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms 30(1-2): 226-256 (2007) - [j29]Artur Czumaj, Berthold Vöcking:
Tight bounds for worst-case equilibria. ACM Trans. Algorithms 3(1): 4:1-4:17 (2007) - [j28]Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas:
Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci. 380(1-2): 37-46 (2007) - [c53]Artur Czumaj, Gereon Frahling, Christian Sohler:
Efficient Kinetic Data Structures for MaxCut. CCCG 2007: 157-160 - [c52]Artur Czumaj, Christian Sohler:
Testing Expansion in Bounded-Degree Graphs. FOCS 2007: 570-578 - [c51]Artur Czumaj, Xin Wang:
Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. ISAAC 2007: 220-231 - [c50]Artur Czumaj, Xin Wang:
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks. SAGA 2007: 70-81 - [c49]Artur Czumaj, Christian Sohler:
On testable properties in bounded degree graphs. SODA 2007: 494-501 - [c48]Artur Czumaj, Andrzej Lingas:
Finding a heaviest triangle is not harder than matrix multiplication. SODA 2007: 986-994 - [c47]Artur Czumaj, Christian Sohler:
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. STACS 2007: 536-548 - [r2]Artur Czumaj, Andrzej Lingas:
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i5]Artur Czumaj, Asaf Shapira, Christian Sohler:
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j27]Artur Czumaj, Christian Sohler:
Sublinear-Time Algorithms. Bull. EATCS 89: 23-47 (2006) - [j26]Artur Czumaj, Wojciech Rytter:
Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2): 115-143 (2006) - [j25]Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking:
Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35(6): 1350-1385 (2006) - [j24]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Computing equilibria for a service provider game with (Im)perfect information. ACM Trans. Algorithms 2(4): 679-706 (2006) - [e1]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
Sublinear Algorithms, 17.07. - 22.07.2005. Dagstuhl Seminar Proceedings 05291, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i4]Artur Czumaj, Andrzej Lingas:
Finding a Heaviest Triangle is not Harder than Matrix Multiplication. Electron. Colloquium Comput. Complex. TR06 (2006) - [i3]Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas:
Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j23]Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson:
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Inf. Process. Lett. 94(2): 49-53 (2005) - [j22]Artur Czumaj, Christian Sohler:
Abstract Combinatorial Programs and Efficient Property Testers. SIAM J. Comput. 34(3): 580-615 (2005) - [j21]Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler:
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM J. Comput. 35(1): 91-109 (2005) - [j20]Artur Czumaj, Christian Sohler:
Testing hypergraph colorability. Theor. Comput. Sci. 331(1): 37-52 (2005) - [c46]André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao:
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA 2005: 472-483 - [c45]Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler:
Facility Location in Sublinear Time. ICALP 2005: 866-877 - [i2]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms 2005 - 2004
- [j19]Artur Czumaj, Hairong Zhao:
Fault-Tolerant Geometric Spanners. Discret. Comput. Geom. 32(2): 207-230 (2004) - [c44]Artur Czumaj, Christian Sohler:
Sublinear-Time Approximation for Clustering Via Random Sampling. ICALP 2004: 396-407 - [c43]Artur Czumaj, Amir Ronen:
On the expected payment of mechanisms for task allocation. PODC 2004: 98-106 - [c42]Artur Czumaj, Amir Ronen:
On the expected payment of mechanisms for task allocation: [extended abstract]. EC 2004: 252-253 - [c41]Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, Hairong Zhao:
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA 2004: 496-505 - [c40]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755 - [c39]Artur Czumaj, Christian Sohler:
Estimating the weight of metric minimum spanning trees in sublinear-time. STOC 2004: 175-183 - [r1]Artur Czumaj:
Selfish Routing on the Internet. Handbook of Scheduling 2004 - 2003
- [j18]Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito:
On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. 302(1-3): 489-495 (2003) - [c38]Artur Czumaj, Hairong Zhao:
Fault-tolerant geometric spanners. SCG 2003: 1-10 - [c37]Artur Czumaj, Wojciech Rytter:
Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS 2003: 492-501 - [c36]Artur Czumaj, Andrzej Lingas, Johan Nilsson:
Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. ISAAC 2003: 544-553 - [c35]Artur Czumaj, Chris Riley, Christian Scheideler:
Perfectly Balanced Allocation. RANDOM-APPROX 2003: 240-251 - [c34]Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler:
Sublinear-time approximation of Euclidean minimum spanning tree. SODA 2003: 813-822 - 2002
- [c33]Artur Czumaj, Christian Sohler:
Abstract Combinatorial Programs and Efficient Property Testers. FOCS 2002: 83-92 - [c32]Artur Czumaj, Andrzej Lingas, Hairong Zhao:
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP 2002: 973-984 - [c31]Artur Czumaj, Berthold Vöcking:
Tight bounds for worst-case equilibria. SODA 2002: 413-420 - [c30]Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Selfish traffic allocation for server farms. STOC 2002: 287-296 - 2001
- [j17]Artur Czumaj, Volker Stemann:
Randomized allocation processes. Random Struct. Algorithms 18(4): 297-331 (2001) - [j16]Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient web searching using temporal factors. Theor. Comput. Sci. 262(1): 569-582 (2001) - [c29]Artur Czumaj, Christian Sohler:
Property Testing with Geometric Queries. ESA 2001: 266-277 - [c28]Artur Czumaj, Christian Sohler:
Testing Hypergraph Coloring. ICALP 2001: 493-505 - [c27]Artur Czumaj, Christian Sohler:
Soft kinetic data structures. SODA 2001: 865-872 - 2000
- [j15]Artur Czumaj:
Recovery Time of Dynamic Allocation Processes. Theory Comput. Syst. 33(5/6): 465-487 (2000) - [j14]Artur Czumaj, Christian Scheideler:
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms 17(3-4): 213-237 (2000) - [j13]Artur Czumaj, Miroslaw Kutylowski:
Delayed path coupling and generating random permutations. Random Struct. Algorithms 17(3-4): 238-259 (2000) - [j12]Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Contention Resolution in Hashing Based Shared Memory Simulations. SIAM J. Comput. 29(5): 1703-1739 (2000) - [j11]Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski:
Algorithms for the parallel alternating direction access machine. Theor. Comput. Sci. 245(2): 151-173 (2000) - [c26]Artur Czumaj, Leszek Gasieniec:
On the Complexity of Determining the Period of a String. CPM 2000: 412-422 - [c25]Artur Czumaj, Christian Sohler, Martin Ziegler:
Property Testing in Computational Geometry. ESA 2000: 155-166 - [c24]Artur Czumaj, Andrzej Lingas:
Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ICALP 2000: 856-868 - [c23]Artur Czumaj, Christian Scheideler:
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. SODA 2000: 30-39 - [c22]Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya:
Infinite parallel job allocation (extended abstract). SPAA 2000: 99-108 - [c21]Artur Czumaj, Christian Scheideler:
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). STOC 2000: 38-47 - [c20]Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking:
Balanced allocations: the heavily loaded case. STOC 2000: 745-754
1990 – 1999
- 1999
- [j10]Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Fast Practical Multi-Pattern Matching. Inf. Process. Lett. 71(3-4): 107-113 (1999) - [c19]Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. SODA 1999: 271-280 - [c18]Artur Czumaj, Andrzej Lingas:
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. SODA 1999: 281-290 - [c17]Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient Web Searching Using Temporal Factors. WADS 1999: 294-305 - 1998
- [j9]Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Fast Generation of Random Permutations Via Networks Simulation. Algorithmica 21(1): 2-20 (1998) - [j8]Artur Czumaj, Leszek Gasieniec, Andrzej Pelc:
Time and Cost Trade-Offs in Gossiping. SIAM J. Discret. Math. 11(3): 400-413 (1998) - [c16]Artur Czumaj, Andrzej Lingas:
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. ICALP 1998: 682-694 - [c15]Artur Czumaj:
Recovery Time of Dynamic Allocation Processes. SPAA 1998: 202-211 - 1997
- [j7]Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Inf. Comput. 137(2): 103-120 (1997) - [j6]Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide:
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett. 62(2): 103-110 (1997) - [j5]Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter:
Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms 23(1): 74-100 (1997) - [c14]Artur Czumaj, Willy-Bernhard Strothmann:
Bounded Degree Spanning Trees (Extended Abstract). ESA 1997: 104-117 - [c13]Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn:
Routing on the PADAM: Degrees of Optimality. Euro-Par 1997: 272-279 - [c12]Artur Czumaj, Volker Stemann:
Randomized Allocation Processes. FOCS 1997: 194-203 - [c11]Artur Czumaj, Paolo Ferragina, Leszek Gasieniec, S. Muthukrishnan, Jesper Larsson Träff:
The Architecture of a Software Library for String Processing. WAE 1997: 166-176 - 1996
- [j4]Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka:
Parallel Maximum Independent Set in Convex Bipartite Graphs. Inf. Process. Lett. 59(6): 289-294 (1996) - [j3]Artur Czumaj:
Very Fast Approximation of the Matrix Chain Product Problem. J. Algorithms 21(1): 71-79 (1996) - [j2]Artur Czumaj, Alan Gibbons:
Guthrie's Problem: New Equivalences and Rapid Reductions. Theor. Comput. Sci. 154(1): 3-22 (1996) - [c10]Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Fast Generation of Random Permutations via Networks Simulation. ESA 1996: 246-260 - [c9]Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski:
Parallel Alternating-Direction Access Machine. MFCS 1996: 267-278 - [i1]Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Fast Generation of Random Permutations via Networks Simulation. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-26 (1996) - 1995
- [b1]Artur Czumaj:
Parallel Algorithmic Techniques: PRAM algorithms and PRAM simulations. University of Paderborn, Germany, HNI-Verlagsschriftenreihe 8, 1995, ISBN 978-3-931466-07-7, pp. 1-152 - [c8]Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Shared Memory Simulations with Triple-Logarithmic Delay. ESA 1995: 46-59 - [c7]Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. ISTCS 1995: 11-19 - [c6]Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski:
Work-time-optimal parallel algorithms for string problems. STOC 1995: 713-722 - 1994
- [j1]Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. Algorithmica 12(4/5): 247-267 (1994) - [c5]Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter:
Parallel and Sequential Approximations of Shortest Superstrings. SWAT 1994: 95-106 - 1993
- [c4]Artur Czumaj, Alan Gibbons:
Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. ICALP 1993: 88-101 - [c3]Artur Czumaj:
Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract). STACS 1993: 294-305 - 1992
- [c2]Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600 - [c1]Artur Czumaj:
An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. SWAT 1992: 62-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
