Παρακολούθηση
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
4682007
Speeding up two string-matching algorithms
M Crochemore, A Czumaj, L Gąsieniec, S Jarominek, T Lecroq, ...
Algorithmica 12 (4), 247-267, 1994
3011994
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
2972000
Broadcasting algorithms in radio networks with unknown topology
A Czumaj, W Rytter
Journal of Algorithms 60 (2), 115-143, 2006
2712006
Selfish traffic allocation for server farms
A Czumaj, P Krysta, B Vöcking
SIAM Journal on Computing 39 (5), 1957-1987, 2010
162*2010
Randomized allocation processes
A Czumaj, V Stemann
Random Structures & Algorithms 18 (4), 297-331, 2001
128*2001
Testing expansion in bounded-degree graphs
A Czumaj, C Sohler
Combinatorics, Probability and Computing 19 (5-6), 693-709, 2010
1112010
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
1052018
Sublinear‐time approximation algorithms for clustering via random sampling
A Czumaj, C Sohler
Random Structures & Algorithms 30 (1‐2), 226-256, 2007
101*2007
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
1011999
Estimating the weight of metric minimum spanning trees in sublinear time
A Czumaj, C Sohler
SIAM Journal on Computing 39 (3), 904-922, 2009
98*2009
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
97*2005
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
922007
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem.
A Czumaj, A Lingas
SODA 99, 281-290, 1999
911999
Fault-tolerant geometric spanners
A Czumaj, H Zhao
Proceedings of the nineteenth annual symposium on Computational geometry, 1-10, 2003
862003
Testing hereditary properties of nonexpanding bounded-degree graphs
A Czumaj, A Shapira, C Sohler
SIAM Journal on Computing 38 (6), 2499-2510, 2009
81*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
752000
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
72*1997
Property testing in computational geometry
A Czumaj, C Sohler, M Ziegler
European Symposium on Algorithms, 155-166, 2000
712000
Contention resolution in hashing based shared memory simulations
A Czumaj, FM Heide, V Stemann
SIAM Journal on Computing 29 (5), 1703-1739, 2000
68*2000
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20