Artur Czumaj - RankMe

256 papers A* 57A 18B 18Journal 124Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Parallel derandomization for coloring. Theor. Comput. Sci. Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra
2025	A*	`conf`	Fully Scalable MPC Algorithms for Euclidean k-Center. ICALP Artur Czumaj, Guichen Gao, Mohsen Ghaffari, Shaofeng H.-C. Jiang
2025	J	`jnl`	Fully Scalable MPC Algorithms for Euclidean k-Center. CoRR Artur Czumaj, Guichen Gao, Mohsen Ghaffari, Shaofeng H.-C. Jiang
2025	J	`jnl`	Log-Diameter MST Verification and Sensitivity in MPC. Algorithmica Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee
2025	J	`jnl`	Property Testing of Computational Networks. CoRR Artur Czumaj, Christian Sohler
2025	J	`jnl`	Streaming Graph Algorithms in the Massively Parallel Computation Model. CoRR Artur Czumaj, Gopinath Mishra, Anish Mukherjee
2025	A	`conf`	Testing Depth First Search Numbering. ESA Artur Czumaj, Christian Sohler, Stefan Walzer
2025	J	`jnl`	Testing Depth First Search Numbering. CoRR Artur Czumaj, Christian Sohler, Stefan Walzer
2024	J	`jnl`	Component stability in low-space massively parallel computation. Distributed Comput. Artur Czumaj, Peter Davies-Peck, Merav Parter
2024	A*	`conf`	Fully-Scalable MPC Algorithms for Clustering in High Dimension. ICALP Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
2024	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2024	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2024	B	`conf`	Log Diameter Rounds MST Verification and Sensitivity in MPC. SPAA Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee
2024	J	`jnl`	Log Diameter Rounds MST Verification and Sensitivity in MPC. CoRR Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee
2024	—	`conf`	Parallel Derandomization for Coloring (Abstract). HOPC@SPAA Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra
2024	A	`conf`	Parallel Derandomization for Coloring. IPDPS Sam Coy, Artur Czumaj, Peter Davies-Peck, Gopinath Mishra
2024	J	`jnl`	Routing schemes for hybrid communication networks. Theor. Comput. Sci. Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann
2024	J	`jnl`	Streaming Algorithms for Geometric Steiner Forest. ACM Trans. Algorithms Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
2024	A*	`conf`	Streaming Graph Algorithms in the Massively Parallel Computation Model. PODC Artur Czumaj, Gopinath Mishra, Anish Mukherjee
2024	J	`jnl`	Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph. SIAM J. Comput. Artur Czumaj, Christian Sohler
2023	J	`jnl`	Deterministic Massively Parallel Connectivity. SIAM J. Comput. Sam Coy, Artur Czumaj
2023	J	`jnl`	Fast Parallel Degree+1 List Coloring. CoRR Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra
2023	J	`jnl`	Fully Scalable MPC Algorithms for Clustering in High Dimension. CoRR Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
2023	J	`jnl`	Haystack hunting hints and locker room communication. Random Struct. Algorithms Artur Czumaj, George Kontogeorgiou, Mike Paterson
2023	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2023	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2023	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2023	B	`conf`	Modern Parallel Algorithms (Invited Talk). MFCS Artur Czumaj
2023	B	`conf`	On Parallel k-Center Clustering. SPAA Sam Coy, Artur Czumaj, Gopinath Mishra
2023	J	`jnl`	On Parallel k-Center Clustering. CoRR Sam Coy, Artur Czumaj, Gopinath Mishra
2023	J	`jnl`	On parallel time in population protocols. Inf. Process. Lett. Artur Czumaj, Andrzej Lingas
2023	A*	`conf`	Optimal (Degree+1)-Coloring in Congested Clique. ICALP Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra
2023	J	`jnl`	Optimal (degree+1)-Coloring in Congested Clique. CoRR Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra
2023	B	`conf`	Routing Schemes for Hybrid Communication Networks. SIROCCO Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann
2022	—	`ed.`	18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, Tórshavn, Faroe Islands, June 27-29, 2022 SWAT Artur Czumaj, Qin Xin
2022	J	`jnl`	Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2022	A*	`conf`	Deterministic massively parallel connectivity. STOC Sam Coy, Artur Czumaj
2022	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2022	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2022	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2022	J	`jnl`	Near-Shortest Path Routing in Hybrid Communication Networks. CoRR Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs
2022	J	`jnl`	Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs. CoRR Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann
2022	A*	`conf`	Streaming Algorithms for Geometric Steiner Forest. ICALP Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
2022	A*	`conf`	Streaming Facility Location in High Dimension via Geometric Hashing. FOCS Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang
2022	J	`jnl`	Streaming Facility Location in High Dimension via New Geometric Hashing. CoRR Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang
2021	A*	`conf`	Component Stability in Low-Space Massively Parallel Computation. PODC Artur Czumaj, Peter Davies, Merav Parter
2021	J	`jnl`	Component Stability in Low-Space Massively Parallel Computation. CoRR Artur Czumaj, Peter Davies, Merav Parter
2021	J	`jnl`	Deterministic Massively Parallel Connectivity. CoRR Sam Coy, Artur Czumaj
2021	J	`jnl`	Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. J. ACM Artur Czumaj, Peter Davies
2021	J	`jnl`	Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Trans. Algorithms Artur Czumaj, Peter Davies, Merav Parter
2021	A*	`conf`	Haystack Hunting Hints and Locker Room Communication. ICALP Artur Czumaj, George Kontogeorgiou, Mike Paterson
2021	A*	`conf`	Improved Deterministic (Δ+1) Coloring in Low-Space MPC. PODC Artur Czumaj, Peter Davies, Merav Parter
2021	J	`jnl`	Improved Deterministic (Δ+1)-Coloring in Low-Space MPC. CoRR Artur Czumaj, Peter Davies, Merav Parter
2021	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2021	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2021	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2021	B	`conf`	Near-Shortest Path Routing in Hybrid Communication Networks. OPODIS Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs
2021	J	`jnl`	On Truly Parallel Time in Population Protocols. CoRR Artur Czumaj, Andrzej Lingas
2021	J	`jnl`	Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM J. Comput. Artur Czumaj, Peter Davies, Merav Parter
2020	A*	`ed.`	47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Saarbrücken, Germany (Virtual Conference), July 8-11, 2020 ICALP Artur Czumaj, Anuj Dawar, Emanuela Merelli
2020	J	`jnl`	Combinatorial Communication in the Locker Room. CoRR Artur Czumaj, George Kontogeorgiou, Mike Paterson
2020	J	`jnl`	Detecting cliques in CONGEST networks. Distributed Comput. Artur Czumaj, Christian Konrad
2020	B	`conf`	Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. SPAA Artur Czumaj, Peter Davies, Merav Parter
2020	J	`jnl`	Letter from the President. Bull. EATCS Artur Czumaj
2020	J	`jnl`	Report on ICALP 2020. Bull. EATCS Artur Czumaj, Anca Muscholl
2020	J	`jnl`	Round Compression for Parallel Matching Algorithms. SIAM J. Comput. Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2020	A*	`conf`	Simple, Deterministic, Constant-Round Coloring in the Congested Clique. PODC Artur Czumaj, Peter Davies, Merav Parter
2020	J	`jnl`	Simple, Deterministic, Constant-Round Coloring in the Congested Clique. CoRR Artur Czumaj, Peter Davies, Merav Parter
2020	J	`jnl`	Streaming Algorithms for Geometric Steiner Forest. CoRR Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
2020	A*	`conf`	Sublinear time approximation of the cost of a metric SODA Artur Czumaj, Christian Sohler
2020	—	`conf`	Testable Properties in General Graphs and Random Order Streaming. APPROX-RANDOM Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler
2020	J	`jnl`	The EATCS Award 2020 - Laudatio for Mihalis Yannakakis. Bull. EATCS Artur Czumaj
2019	A*	`conf`	A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs). FOCS Artur Czumaj, Christian Sohler
2019	J	`jnl`	A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs). CoRR Artur Czumaj, Christian Sohler
2019	J	`jnl`	An ACM Trans. Algorithms Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2019	J	`jnl`	Communicating with beeps. J. Parallel Distributed Comput. Artur Czumaj, Peter Davies
2019	J	`jnl`	Distributed Methods for Computing Approximate Equilibria. Algorithmica Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2019	J	`jnl`	Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. CoRR Artur Czumaj, Peter Davies, Merav Parter
2019	J	`jnl`	Leader election in multi-hop radio networks. Theor. Comput. Sci. Artur Czumaj, Peter Davies
2019	J	`jnl`	Planar graphs: Random walks and bipartiteness testing. Random Struct. Algorithms Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler
2019	J	`jnl`	Testable Properties in General Graphs and Random Order Streaming. CoRR Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler
2019	J	`jnl`	The EATCS Award 2020 - Call for Nominations. Bull. EATCS Artur Czumaj, Marta Kwiatkowska, Éva Tardos
2018	J	`jnl`	3rd Highlights of Algorithms (HALG 2018). SIGACT News Artur Czumaj, Robert Krauthgamer
2018	J	`jnl`	Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
2018	—	`ch.`	Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics (2) Artur Czumaj, Andrzej Lingas
2018	A	`conf`	Brief Announcement: Randomized Blind Radio Networks. DISC Artur Czumaj, Peter Davies
2018	A	`conf`	Detecting Cliques in CONGEST Networks. DISC Artur Czumaj, Christian Konrad
2018	J	`jnl`	Detecting cliques in CONGEST networks. CoRR Artur Czumaj, Christian Konrad
2018	A	`conf`	Deterministic Blind Radio Networks. DISC Artur Czumaj, Peter Davies
2018	J	`jnl`	Deterministic Blind Radio Networks. CoRR Artur Czumaj, Peter Davies
2018	J	`jnl`	Deterministic Communication in Radio Networks. SIAM J. Comput. Artur Czumaj, Peter Davies
2018	A	`conf`	Online Facility Location with Deletions. ESA Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
2018	J	`jnl`	Online Facility Location with Deletions. CoRR Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
2018	A*	`ed.`	Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 SODA Artur Czumaj
2018	J	`jnl`	Randomized Communication Without Network Knowledge. CoRR Artur Czumaj, Peter Davies
2018	J	`jnl`	Report on HALG 2018. Bull. EATCS Artur Czumaj, Robert Krauthgamer
2018	A*	`conf`	Round compression for parallel matching algorithms. STOC Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2018	B	`conf`	Sublinear Graph Augmentation for Fast Query Implementation. WAOA Artur Czumaj, Yishay Mansour, Shai Vardi
2017	A*	`conf`	Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. PODC Artur Czumaj, Peter Davies
2017	J	`jnl`	Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. CoRR Artur Czumaj, Peter Davies
2017	J	`jnl`	HALG: Highlights of Algorithms. SIGACT News Artur Czumaj, Stefano Leonardi
2017	A	`conf`	Multi-player Approximate Nash Equilibria. AAMAS Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
2017	J	`jnl`	Report on HALG 2016/2017. Bull. EATCS Artur Czumaj, Stefano Leonardi
2017	J	`jnl`	Round Compression for Parallel Matching Algorithms. CoRR Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2017	—	`ch.`	Sublinear Clustering. Encyclopedia of Machine Learning and Data Mining Artur Czumaj, Christian Sohler
2017	A	`conf`	Zero-Sum Game Techniques for Approximate Nash Equilibria. AAMAS Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
2016	A	`conf`	Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract). AAMAS Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
2016	A*	`conf`	Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks. PODC Artur Czumaj, Peter Davies
2016	—	`conf`	Distributed Methods for Computing Approximate Equilibria. WINE Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2016	—	`ch.`	Euclidean Traveling Salesman Problem. Encyclopedia of Algorithms Artur Czumaj
2016	A*	`conf`	Faster Deterministic Communication in Radio Networks. ICALP Artur Czumaj, Peter Davies
2016	—	`ch.`	Minimum Encyclopedia of Algorithms Artur Czumaj, Andrzej Lingas
2016	—	`ch.`	Price of Anarchy for Machines Models. Encyclopedia of Algorithms Artur Czumaj, Berthold Vöcking
2016	A*	`conf`	Relating two property testing models for bounded degree directed graphs. STOC Artur Czumaj, Pan Peng, Christian Sohler
2015	J	`jnl`	Almost Optimal Deterministic Broadcast in Radio Networks. CoRR Artur Czumaj, Peter Davies
2015	A*	`conf`	Approximate Nash Equilibria with Near Optimal Social Welfare. IJCAI Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
2015	B	`conf`	Communicating with Beeps. OPODIS Artur Czumaj, Peter Davies
2015	J	`jnl`	Communicating with Beeps. CoRR Artur Czumaj, Peter Davies
2015	J	`jnl`	Distributed Methods for Computing Approximate Equilibria. CoRR Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2015	J	`jnl`	Optimal leader election in multi-hop radio networks. CoRR Artur Czumaj, Peter Davies
2015	A*	`conf`	Random Permutations using Switching Networks. STOC Artur Czumaj
2015	—	`book`	Surveys in Combinatorics 2015 Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko
2015	A*	`conf`	Testing Cluster Structure of Graphs. STOC Artur Czumaj, Pan Peng, Christian Sohler
2015	J	`jnl`	Testing Cluster Structure of Graphs. CoRR Artur Czumaj, Pan Peng, Christian Sohler
2014	B	`conf`	Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games. SAGT Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
2014	J	`jnl`	Approximate well-supported Nash equilibria in symmetric bimatrix games. CoRR Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
2014	J	`jnl`	Finding cycles and trees in sublinear time. Random Struct. Algorithms Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler
2014	J	`jnl`	Planar Graphs: Random Walks and Bipartiteness Testing. CoRR Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler
2014	—	`conf`	Thorp Shuffling, Butterflies, and Non-Markovian Couplings. ICALP (1) Artur Czumaj, Berthold Vöcking
2013	A*	`conf`	(1+ Є)-approximation for facility location in data streams. SODA Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler
2013	J	`jnl`	Fast message dissemination in random geometric networks. Distributed Comput. Artur Czumaj, Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald, Xin Wang
2012	A*	`conf`	An SODA Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2012	—	`ed.`	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I ICALP (1) Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer
2012	—	`ed.`	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II ICALP (2) Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer
2012	J	`jnl`	Finding Cycles and Trees in Sublinear Time. Electron. Colloquium Comput. Complex. Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler
2012	—	`conf`	Multiple-Choice Balanced Allocation in (Almost) Parallel. APPROX-RANDOM Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel
2012	A*	`conf`	Optimal online buffer scheduling for block devices. STOC Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2011	A*	`conf`	Almost tight bounds for reordering buffer management. STOC Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
2011	J	`jnl`	Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
2011	—	`conf`	Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk
2011	A*	`conf`	Planar Graphs: Random Walks and Bipartiteness Testing. FOCS Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler
2010	J	`jnl`	Finding Cycles and Trees in Sublinear Time CoRR Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler
2010	—	`conf`	Local Graph Exploration and Fast Property Testing. ESA (1) Artur Czumaj
2010	J	`jnl`	Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. Anna Adamaszek, Artur Czumaj, Andrzej Lingas
2010	J	`jnl`	Selfish Traffic Allocation for Server Farms. SIAM J. Comput. Artur Czumaj, Piotr Krysta, Berthold Vöcking
2010	J	`jnl`	Small Space Representations for Metric Min-sum Theory Comput. Syst. Artur Czumaj, Christian Sohler
2010	—	`ch.`	Sublinear Clustering. Encyclopedia of Machine Learning Artur Czumaj, Christian Sohler
2010	—	`ch.`	Sublinear-time Algorithms. Property Testing Artur Czumaj, Christian Sohler
2010	J	`jnl`	Testing Expansion in Bounded-Degree Graphs. Comb. Probab. Comput. Artur Czumaj, Christian Sohler
2010	—	`ch.`	Testing Monotone Continuous Distributions on High-Dimensional Real Cubes. Property Testing Michal Adamaszek, Artur Czumaj, Christian Sohler
2010	A*	`conf`	Testing Monotone Continuous Distributions on High-dimensional Real Cubes. SODA Michal Adamaszek, Artur Czumaj, Christian Sohler
2009	B	`conf`	Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
2009	J	`jnl`	Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time. SIAM J. Comput. Artur Czumaj, Christian Sohler
2009	J	`jnl`	Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication. SIAM J. Comput. Artur Czumaj, Andrzej Lingas
2009	B	`conf`	PTAS for ISAAC Anna Adamaszek, Artur Czumaj, Andrzej Lingas
2009	J	`jnl`	PTAS for k-tour cover problem on the plane for moderately large values of k CoRR Anna Adamaszek, Artur Czumaj, Andrzej Lingas
2009	J	`jnl`	Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput. Artur Czumaj, Asaf Shapira, Christian Sohler
2008	—	`conf`	08341 Abstracts Collection - Sublinear Algorithms. Sublinear Algorithms Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler
2008	—	`conf`	08341 Executive Summary - Sublinear Algorithms. Sublinear Algorithms Artur Czumaj, S. Muthukrishnan, Ronitt Rubinfeld, Christian Sohler
2008	—	`ch.`	Euclidean Traveling Salesperson Problem. Encyclopedia of Algorithms Artur Czumaj
2008	—	`ch.`	Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms Artur Czumaj, Andrzej Lingas
2008	—	`ch.`	Price of Anarchy for Machines Models. Encyclopedia of Algorithms Artur Czumaj, Berthold Vöcking
2008	—	`ed.`	Sublinear Algorithms, 17.08. - 22.08.2008 Sublinear Algorithms Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler
2008	J	`jnl`	Testing Euclidean minimum spanning trees in the plane. ACM Trans. Algorithms Artur Czumaj, Christian Sohler
2007	—	`ch.`	Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics Artur Czumaj, Andrzej Lingas
2007	—	`conf`	Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks. SAGA Artur Czumaj, Xin Wang
2007	—	`conf`	Efficient Kinetic Data Structures for MaxCut. CCCG Artur Czumaj, Gereon Frahling, Christian Sohler
2007	B	`conf`	Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. ISAAC Artur Czumaj, Xin Wang
2007	J	`jnl`	Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci. Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
2007	A*	`conf`	Finding a heaviest triangle is not harder than matrix multiplication. SODA Artur Czumaj, Andrzej Lingas
2007	A*	`conf`	On testable properties in bounded degree graphs. SODA Artur Czumaj, Christian Sohler
2007	A	`conf`	Small Space Representations for Metric Min-Sum STACS Artur Czumaj, Christian Sohler
2007	J	`jnl`	Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms Artur Czumaj, Christian Sohler
2007	A*	`conf`	Testing Expansion in Bounded-Degree Graphs. FOCS Artur Czumaj, Christian Sohler
2007	J	`jnl`	Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electron. Colloquium Comput. Complex. Artur Czumaj, Asaf Shapira, Christian Sohler
2007	J	`jnl`	Tight bounds for worst-case equilibria. ACM Trans. Algorithms Artur Czumaj, Berthold Vöcking
2006	J	`jnl`	Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
2006	J	`jnl`	Broadcasting algorithms in radio networks with unknown topology. J. Algorithms Artur Czumaj, Wojciech Rytter
2006	J	`jnl`	Computing equilibria for a service provider game with (Im)perfect information. ACM Trans. Algorithms René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
2006	J	`jnl`	Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electron. Colloquium Comput. Complex. Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
2006	J	`jnl`	Finding a Heaviest Triangle is not Harder than Matrix Multiplication. Electron. Colloquium Comput. Complex. Artur Czumaj, Andrzej Lingas
2006	—	`ed.`	Sublinear Algorithms, 17.07. - 22.07.2005 Sublinear Algorithms Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler
2006	J	`jnl`	Sublinear-Time Algorithms. Bull. EATCS Artur Czumaj, Christian Sohler
2005	—	`conf`	05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler
2005	J	`jnl`	Abstract Combinatorial Programs and Efficient Property Testers. SIAM J. Comput. Artur Czumaj, Christian Sohler
2005	J	`jnl`	Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM J. Comput. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
2005	A	`conf`	Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao
2005	J	`jnl`	Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Inf. Process. Lett. Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson
2005	A*	`conf`	Facility Location in Sublinear Time. ICALP Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler
2005	J	`jnl`	Testing hypergraph colorability. Theor. Comput. Sci. Artur Czumaj, Christian Sohler
2004	A*	`conf`	Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, Hairong Zhao
2004	A*	`conf`	Computing equilibria for congestion games with (im)perfect information. SODA René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
2004	A*	`conf`	Estimating the weight of metric minimum spanning trees in sublinear-time. STOC Artur Czumaj, Christian Sohler
2004	J	`jnl`	Fault-Tolerant Geometric Spanners. Discret. Comput. Geom. Artur Czumaj, Hairong Zhao
2004	A*	`conf`	On the expected payment of mechanisms for task allocation. PODC Artur Czumaj, Amir Ronen
2004	A*	`conf`	On the expected payment of mechanisms for task allocation: [extended abstract]. EC Artur Czumaj, Amir Ronen
2004	—	`ch.`	Selfish Routing on the Internet. Handbook of Scheduling Artur Czumaj
2004	A*	`conf`	Sublinear-Time Approximation for Clustering Via Random Sampling. ICALP Artur Czumaj, Christian Sohler
2003	A*	`conf`	Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS Artur Czumaj, Wojciech Rytter
2003	—	`conf`	Fault-tolerant geometric spanners. SCG Artur Czumaj, Hairong Zhao
2003	B	`conf`	Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. ISAAC Artur Czumaj, Andrzej Lingas, Johan Nilsson
2003	J	`jnl`	On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
2003	—	`conf`	Perfectly Balanced Allocation. RANDOM-APPROX Artur Czumaj, Chris Riley, Christian Scheideler
2003	A*	`conf`	Sublinear-time approximation of Euclidean minimum spanning tree. SODA Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
2002	A*	`conf`	Abstract Combinatorial Programs and Efficient Property Testers. FOCS Artur Czumaj, Christian Sohler
2002	A*	`conf`	Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP Artur Czumaj, Andrzej Lingas, Hairong Zhao
2002	A*	`conf`	Selfish traffic allocation for server farms. STOC Artur Czumaj, Piotr Krysta, Berthold Vöcking
2002	A*	`conf`	Tight bounds for worst-case equilibria. SODA Artur Czumaj, Berthold Vöcking
2001	J	`jnl`	Efficient web searching using temporal factors. Theor. Comput. Sci. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
2001	A	`conf`	Property Testing with Geometric Queries. ESA Artur Czumaj, Christian Sohler
2001	J	`jnl`	Randomized allocation processes. Random Struct. Algorithms Artur Czumaj, Volker Stemann
2001	A*	`conf`	Soft kinetic data structures. SODA Artur Czumaj, Christian Sohler
2001	A*	`conf`	Testing Hypergraph Coloring. ICALP Artur Czumaj, Christian Sohler
2000	A*	`conf`	A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). STOC Artur Czumaj, Christian Scheideler
2000	J	`jnl`	Algorithms for the parallel alternating direction access machine. Theor. Comput. Sci. Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
2000	A*	`conf`	Balanced allocations: the heavily loaded case. STOC Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
2000	A*	`conf`	Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. SODA Artur Czumaj, Christian Scheideler
2000	J	`jnl`	Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms Artur Czumaj, Christian Scheideler
2000	J	`jnl`	Contention Resolution in Hashing Based Shared Memory Simulations. SIAM J. Comput. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
2000	J	`jnl`	Delayed path coupling and generating random permutations. Random Struct. Algorithms Artur Czumaj, Miroslaw Kutylowski
2000	A*	`conf`	Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ICALP Artur Czumaj, Andrzej Lingas
2000	B	`conf`	Infinite parallel job allocation (extended abstract). SPAA Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya
2000	B	`conf`	On the Complexity of Determining the Period of a String. CPM Artur Czumaj, Leszek Gasieniec
2000	A	`conf`	Property Testing in Computational Geometry. ESA Artur Czumaj, Christian Sohler, Martin Ziegler
2000	J	`jnl`	Recovery Time of Dynamic Allocation Processes. Theory Comput. Syst. Artur Czumaj
1999	A*	`conf`	Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. SODA Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
1999	B	`conf`	Efficient Web Searching Using Temporal Factors. WADS Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
1999	J	`jnl`	Fast Practical Multi-Pattern Matching. Inf. Process. Lett. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
1999	A*	`conf`	On Approximability of the Minimum-Cost SODA Artur Czumaj, Andrzej Lingas
1998	A*	`conf`	A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. ICALP Artur Czumaj, Andrzej Lingas
1998	J	`jnl`	Fast Generation of Random Permutations Via Networks Simulation. Algorithmica Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
1998	B	`conf`	Recovery Time of Dynamic Allocation Processes. SPAA Artur Czumaj
1998	J	`jnl`	Time and Cost Trade-Offs in Gossiping. SIAM J. Discret. Math. Artur Czumaj, Leszek Gasieniec, Andrzej Pelc
1997	A	`conf`	Bounded Degree Spanning Trees (Extended Abstract). ESA Artur Czumaj, Willy-Bernhard Strothmann
1997	A*	`conf`	Randomized Allocation Processes. FOCS Artur Czumaj, Volker Stemann
1997	—	`conf`	Routing on the PADAM: Degrees of Optimality. Euro-Par Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn
1997	J	`jnl`	Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
1997	J	`jnl`	Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Inf. Comput. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
1997	—	`conf`	The Architecture of a Software Library for String Processing. WAE Artur Czumaj, Paolo Ferragina, Leszek Gasieniec, S. Muthukrishnan, Jesper Larsson Träff
1997	J	`jnl`	Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett. Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide
1996	J	`jnl`	Fast Generation of Random Permutations via Networks Simulation Universität Trier, Mathematik/Informatik, Forschungsbericht Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
1996	A	`conf`	Fast Generation of Random Permutations via Networks Simulation. ESA Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
1996	J	`jnl`	Guthrie's Problem: New Equivalences and Rapid Reductions. Theor. Comput. Sci. Artur Czumaj, Alan Gibbons
1996	B	`conf`	Parallel Alternating-Direction Access Machine. MFCS Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
1996	J	`jnl`	Parallel Maximum Independent Set in Convex Bipartite Graphs. Inf. Process. Lett. Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka
1996	J	`jnl`	Very Fast Approximation of the Matrix Chain Product Problem. J. Algorithms Artur Czumaj
1995	—	`conf`	Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. ISTCS Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
1995	—	`—`	Parallel Algorithmic Techniques: PRAM algorithms and PRAM simulations. Artur Czumaj
1995	A	`conf`	Shared Memory Simulations with Triple-Logarithmic Delay. ESA Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
1995	A*	`conf`	Work-time-optimal parallel algorithms for string problems. STOC Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski
1994	—	`conf`	Parallel and Sequential Approximations of Shortest Superstrings. SWAT Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
1994	J	`jnl`	Speeding Up Two String-Matching Algorithms. Algorithmica Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
1993	A	`conf`	Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract). STACS Artur Czumaj
1993	A*	`conf`	Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. ICALP Artur Czumaj, Alan Gibbons
1992	—	`conf`	An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. SWAT Artur Czumaj
1992	A	`conf`	Speeding Up Two String-Matching Algorithms. STACS Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter