Artur Czumaj

Cited by

	All	Since 2018
Citations	4652	1364
h-index	36	22
i10-index	88	46

300

150

225

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202313 28 30 31 34 35 55 54 72 130 172 241 184 240 213 200 219 180 179 176 172 164 156 214 252 209 230 220 294 157

Public access

View all

44 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneVerified email at uni-koeln.de
Leszek A GąsieniecUniversity of LiverpoolVerified email at liverpool.ac.uk
Wojciech RytterWarsaw UniversityVerified email at mimuw.edu.pl
Berthold VöckingProfessor of Computer Science, RWTH Aachen UniversityVerified email at cs.rwth-aachen.de
Peter DaviesDurham UniversityVerified email at durham.ac.uk
Wojciech PlandowskiVerified email at uw.edu.pl
Volker StemannDeutsche BankVerified email at db.com
Friedhelm Meyer auf der HeideProfessor of Computer Science, University of PaderbornVerified email at upb.de
Thierry LecroqLITIS UR 4108, University of Rouen Normandy, FranceVerified email at univ-rouen.fr
Anna AdamaszekPostdoc, University of CopenhagenVerified email at di.ku.dk
Maxime CrochemoreKCLVerified email at kcl.ac.uk
Christian ScheidelerUniversität PaderbornVerified email at upb.de
Piotr KrystaUniversity of LiverpoolVerified email at liverpool.ac.uk
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv UniversityVerified email at csail.mit.edu
Matthias EnglertUniversity of WarwickVerified email at warwick.ac.uk
Michail FasoulakisICS-FORTH, GreeceVerified email at ics.forth.gr
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Krzysztof OnakBoston UniversityVerified email at onak.pl
Harald RäckeTechnische Universität MünchenVerified email at in.tum.de
Piotr SankowskiIDEAS NCBR, MIM Solutions, Warsaw UniversityVerified email at mimuw.edu.pl

Artur Czumaj

Professor of Computer Science, University of Warwick, UK

Verified email at warwick.ac.uk - Homepage

Theoretical Computer Science Algorithms Data structures Discrete Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Tight bounds for worst-case equilibria A Czumaj, B Vöcking ACM Transactions on Algorithms (TALG) 3 (1), 1-17, 2007	442	2007
Broadcasting algorithms in radio networks with unknown topology A Czumaj, W Rytter Journal of Algorithms 60 (2), 115-143, 2006	267	2006
Balanced allocations: The heavily loaded case P Berenbrink, A Czumaj, A Steger, B Vöcking Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	267	2000
Speeding up two string-matching algorithms M Crochemore, A Czumaj, L Gąsieniec, S Jarominek, T Lecroq, ... Algorithmica 12 (4), 247-267, 1994	265	1994
Selfish traffic allocation for server farms A Czumaj, P Krysta, B Vöcking SIAM Journal on Computing 39 (5), 1957-1987, 2010	158*	2010
Randomized allocation processes A Czumaj, V Stemann Random Structures & Algorithms 18 (4), 297-331, 2001	121*	2001
Fast practical multi-pattern matching M Crochemore, A Czumaj, L Gąsieniec, T Lecroq, W Plandowski, W Rytter Information Processing Letters 71 (3-4), 107-113, 1999	104	1999
Testing expansion in bounded-degree graphs A Czumaj, C Sohler Combinatorics, Probability and Computing 19 (5-6), 693-709, 2010	102	2010
Round compression for parallel matching algorithms A Czumaj, J Łącki, A Mądry, S Mitrović, K Onak, P Sankowski Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	93	2018
Sublinear‐time approximation algorithms for clustering via random sampling A Czumaj, C Sohler Random Structures & Algorithms 30 (1‐2), 226-256, 2007	91*	2007
Approximating the weight of the euclidean minimum spanning tree in sublinear time A Czumaj, F Ergün, L Fortnow, A Magen, I Newman, R Rubinfeld, ... SIAM Journal on Computing 35 (1), 91-109, 2005	88*	2005
Estimating the weight of metric minimum spanning trees in sublinear time A Czumaj, C Sohler SIAM Journal on Computing 39 (3), 904-922, 2009	87*	2009
Faster algorithms for finding lowest common ancestors in directed acyclic graphs A Czumaj, M Kowaluk, A Lingas Theoretical Computer Science 380 (1-2), 37-46, 2007	81	2007
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. A Czumaj, A Lingas SODA 99, 281-290, 1999	81	1999
Fault-tolerant geometric spanners A Czumaj, H Zhao Proceedings of the nineteenth annual symposium on Computational geometry, 1-10, 2003	80	2003
Testing hereditary properties of nonexpanding bounded-degree graphs A Czumaj, A Shapira, C Sohler SIAM Journal on Computing 38 (6), 2499-2510, 2009	76*	2009
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma A Czumaj, C Scheideler Random Structures & Algorithms 17 (3‐4), 213-237, 2000	71	2000
Property testing in computational geometry A Czumaj, C Sohler, M Ziegler Algorithms-ESA 2000: 8th Annual European Symposium Saarbrücken, Germany …, 2003	69	2003
Contention resolution in hashing based shared memory simulations A Czumaj, FM Heide, V Stemann SIAM Journal on Computing 29 (5), 1703-1739, 2000	69*	2000
Sequential and parallel approximation of shortest superstrings A Czumaj, L Gąsieniec, M Piotrów, W Rytter Journal of Algorithms 23 (1), 74-100, 1997	69*	1997

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors