Artur Czumaj
Artur Czumaj
Professor of Computer Science, University of Warwick, UK
Потвърден имейл адрес: warwick.ac.uk - Начална страница
Заглавие
Позовавания
Позовавания
Година
Tight bounds for worst-case equilibria
A Czumaj, B Vöcking
ACM Transactions on Algorithms (TALG) 3 (1), 1-17, 2007
4172007
Speeding up two string-matching algorithms
M Crochemore, A Czumaj, L Gąsieniec, S Jarominek, T Lecroq, ...
Algorithmica 12 (4), 247-267, 1994
2731994
Broadcasting algorithms in radio networks with unknown topology
A Czumaj, W Rytter
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
2512003
Balanced allocations: The heavily loaded case
P Berenbrink, A Czumaj, A Steger, B Vöcking
SIAM Journal on Computing 35 (6), 1350-1385, 2006
212*2006
Selfish traffic allocation for server farms
A Czumaj, P Krysta, B Vöcking
SIAM Journal on Computing 39 (5), 1957-1987, 2010
151*2010
Randomized allocation processes
A Czumaj, V Stemann
Random Structures & Algorithms 18 (4), 297-331, 2001
102*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
891999
Testing expansion in bounded-degree graphs
A Czumaj, C Sohler
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 570-578, 2007
832007
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
79*2005
Sublinear‐time approximation algorithms for clustering via random sampling
A Czumaj, C Sohler
Random Structures & Algorithms 30 (1‐2), 226-256, 2007
78*2007
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
712007
Estimating the weight of metric minimum spanning trees in sublinear time
A Czumaj, C Sohler
SIAM Journal on Computing 39 (3), 904-922, 2009
69*2009
On approximability of the minimum-cost k-connected spanning subgraph problem
A Czumaj, A Lingas
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms …, 1999
681999
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
65*1997
Fault-tolerant geometric spanners
A Czumaj, H Zhao
Discrete & Computational Geometry 32 (2), 207-230, 2004
642004
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
622000
Property testing in computational geometry
A Czumaj, C Sohler, M Ziegler
European Symposium on Algorithms, 155-166, 2000
622000
Testing hereditary properties of nonexpanding bounded-degree graphs
A Czumaj, A Shapira, C Sohler
SIAM Journal on Computing 38 (6), 2499-2510, 2009
60*2009
Primal dual gives almost optimal energy-efficient online algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017
562017
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems
A Czumaj, C Scheideler
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
532000
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20