Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Artur Czumaj
2010 – today
- 2013
[j40]Artur Czumaj, Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald, Xin Wang: Fast message dissemination in random geometric networks. Distributed Computing 26(1): 1-24 (2013)- [c66]Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler: (1+ Є)-approximation for facility location in data streams. SODA 2013: 1710-1728
- 2012
- [c65]Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel: Multiple-Choice Balanced Allocation in (Almost) Parallel. APPROX-RANDOM 2012: 411-422
- [c64]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke: An O(log k)-competitive algorithm for generalized caching. SODA 2012: 1681-1689
- [c63]Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke: Optimal online buffer scheduling for block devices. STOC 2012: 589-598
- [e3]Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer (Eds.): 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
- [e2]Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer (Eds.): 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
- [i7]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler: Finding Cycles and Trees in Sublinear Time. Electronic Colloquium on Computational Complexity (ECCC) 19: 35 (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)
- [c62]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler: Planar Graphs: Random Walks and Bipartiteness Testing. FOCS 2011: 423-432
- [c61]Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk: Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) 2011: 25-36
- [c60]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. Combinatorics, Probability & Computing 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)
- [c59]
- [c58]
- [c57]Michal Adamaszek, Artur Czumaj, Christian Sohler: Testing Monotone Continuous Distributions on High-Dimensional Real Cubes. Property Testing 2010: 228-233
- [c56]Michal Adamaszek, Artur Czumaj, Christian Sohler: Testing Monotone Continuous Distributions on High-dimensional Real Cubes. SODA 2010: 56-65
- [r4]Artur Czumaj, Christian Sohler: Sublinear Clustering. Encyclopedia of Machine Learning 2010: 933-937
- [i6]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
- [i5]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 Transactions on Algorithms 4(3) (2008)
- [r3]
- [r2]Artur Czumaj, Andrzej Lingas: Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2008
- [r1]Artur Czumaj, Berthold Vöcking: Price of Anarchy for Machines Models. Encyclopedia of 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 Transactions on Algorithms 3(1) (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]
- [c51]Artur Czumaj, Xin Wang: Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. ISAAC 2007: 220-231
- [c50]
- [c49]
- [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
- [i4]Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(083) (2007)
- 2006
- [j27]
- [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 Transactions on Algorithms 2(4): 679-706 (2006)
- [e1]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler (Eds.): Sublinear Algorithms, 17.07. - 22.07.2005. Dagstuhl Seminar Proceedings 05291, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- [i3]Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas: Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electronic Colloquium on Computational Complexity (ECCC) 13(111) (2006)
- [i2]Artur Czumaj, Andrzej Lingas: Finding a Heaviest Triangle is not Harder than Matrix Multiplication. Electronic Colloquium on Computational Complexity (ECCC) 13(115) (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]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler: 05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms 2005
- [c45]André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao: Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA 2005: 472-483
- [c44]Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler: Facility Location in Sublinear Time. ICALP 2005: 866-877
- 2004
- [j19]Artur Czumaj, Hairong Zhao: Fault-Tolerant Geometric Spanners. Discrete & Computational Geometry 32(2): 207-230 (2004)
- [c43]Artur Czumaj, Christian Sohler: Sublinear-Time Approximation for Clustering Via Random Sampling. ICALP 2004: 396-407
- [c42]Artur Czumaj, Amir Ronen: On the expected payment of mechanisms for task allocation. PODC 2004: 98-106
- [c41]Artur Czumaj, Amir Ronen: On the expected payment of mechanisms for task allocation: [extended abstract]. ACM Conference on Electronic Commerce 2004: 252-253
- [c40]Artur Czumaj, Michelangelo Grigni, Papa Sissokho, Hairong Zhao: Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA 2004: 496-505
- [c39]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking: Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755
- [c38]Artur Czumaj, Christian Sohler: Estimating the weight of metric minimum spanning trees in sublinear-time. STOC 2004: 175-183
- 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)
- [c37]Artur Czumaj, Hairong Zhao: Fault-tolerant geometric spanners. Symposium on Computational Geometry 2003: 1-10
- [c36]Artur Czumaj, Wojciech Rytter: Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS 2003: 492-501
- [c35]Artur Czumaj, Andrzej Lingas, Johan Nilsson: Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. ISAAC 2003: 544-553
- [c34]Artur Czumaj, Chris Riley, Christian Scheideler: Perfectly Balanced Allocation. RANDOM-APPROX 2003: 240-251
- [c33]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
- [c32]Artur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. FOCS 2002: 83-92
- [c31]Artur Czumaj, Andrzej Lingas, Hairong Zhao: Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP 2002: 973-984
- [c30]
- [c29]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)
- [c28]
- [c27]
- [c26]
- 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)
- [c25]Artur Czumaj, Leszek Gasieniec: On the Complexity of Determining the Period of a String. CPM 2000: 412-422
- [c24]Artur Czumaj, Christian Sohler, Martin Ziegler: Property Testing in Computational Geometry. ESA 2000: 155-166
- [c23]Artur Czumaj, Andrzej Lingas: Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ICALP 2000: 856-868
- [c22]Artur Czumaj, Christian Scheideler: Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. SODA 2000: 30-39
- [c21]Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya: Infinite parallel job allocation (extended abstract). SPAA 2000: 99-108
- [c20]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
- [c19]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)
- [c18]Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys: Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. SODA 1999: 271-280
- [c17]Artur Czumaj, Andrzej Lingas: On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. SODA 1999: 281-290
- [c16]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. Discrete Math. 11(3): 400-413 (1998)
- [c15]Artur Czumaj, Andrzej Lingas: A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. ICALP 1998: 682-694
- [c14]
- 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)
- [c13]Artur Czumaj, Willy-Bernhard Strothmann: Bounded Degree Spanning Trees (Extended Abstract). ESA 1997: 104-117
- [c12]Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn: Routing on the PADAM: Degrees of Optimality. Euro-Par 1997: 272-279
- [c11]
- 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
- [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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:54 CEST by the dblp team