Travelled to:1 × Canada
1 × Finland
1 × Greece
1 × Portugal
1 × Spain
1 × Sweden
2 × Denmark
2 × Switzerland
6 × USA
Collaborated with:C.Sohler A.Lingas B.Vöcking A.Adamaszek ∅ M.Englert H.Räcke C.Scheideler A.Gibbons L.Gasieniec P.Peng H.Zhao P.Krysta J.O.Wojtaszczyk M.Badoiu P.Indyk P.Berenbrink A.Steger Z.Galil K.Park W.Plandowski J.Czyzowicz J.Jansson P.Zylinski
Talks about:approxim (6) problem (6) time (6) network (4) scheme (4) sublinear (3) euclidean (3) algorithm (3) design (3) polynomi (2)
Person: Artur Czumaj
DBLP: Czumaj:Artur
Facilitated 2 volumes:
EdEdContributed to:
20152014201220112011
201120052004200420022002200120002000199819951993Wrote 19 papers:
- STOC-2015-Czumaj #network #permutation #random #using
- Random Permutations using Switching Networks (AC), pp. 703–712.
- STOC-2015-CzumajPS #clustering #graph #testing
- Testing Cluster Structure of Graphs (AC, PP, CS), pp. 723–732.
- ICALP-v1-2014-CzumajV #markov
- Thorp Shuffling, Butterflies, and Non-Markovian Couplings (AC, BV), pp. 344–355.
- STOC-2012-AdamaszekCER #online #scheduling
- Optimal online buffer scheduling for block devices (AA, AC, ME, HR), pp. 589–598.
- ICALP-v1-2011-AdamaszekCLW #approximate #design #geometry #network
- Approximation Schemes for Capacitated Geometric Network Design (AA, AC, AL, JOW), pp. 25–36.
- STOC-2011-AdamaszekCER #bound #order
- Almost tight bounds for reordering buffer management (AA, AC, ME, HR), pp. 607–616.
- CIAA-J-2010-CzumajCGJLZ11 #algorithm #approximate #design #geometry #network
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (AC, JC, LG, JJ, AL, PZ), pp. 1949–1969.
- ICALP-2005-BadoiuCIS #sublinear
- Facility Location in Sublinear Time (MB, AC, PI, CS), pp. 866–877.
- ICALP-2004-CzumajS #approximate #clustering #random
- Sublinear-Time Approximation for Clustering Via Random Sampling (AC, CS), pp. 396–407.
- STOC-2004-CzumajS #metric
- Estimating the weight of metric minimum spanning trees in sublinear-time (AC, CS), pp. 175–183.
- ICALP-2002-CzumajLZ #approximate #design #network #polynomial #problem
- Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem (AC, AL, HZ), pp. 973–984.
- STOC-2002-CzumajKV
- Selfish traffic allocation for server farms (AC, PK, BV), pp. 287–296.
- ICALP-2001-CzumajS #testing
- Testing Hypergraph Coloring (AC, CS), pp. 493–505.
- ICALP-2000-CzumajL #approximate #multi #performance #problem
- Fast Approximation Schemes for Euclidean Multi-connectivity Problems (AC, AL), pp. 856–868.
- STOC-2000-BerenbrinkCSV
- Balanced allocations: the heavily loaded case (PB, AC, AS, BV), pp. 745–754.
- STOC-2000-CzumajS #algorithm #approach #problem #satisfiability #scheduling
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (AC, CS), pp. 38–47.
- ICALP-1998-CzumajL #approximate #polynomial
- A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity (AC, AL), pp. 682–694.
- STOC-1995-CzumajGGPP #algorithm #parallel #problem #string
- Work-time-optimal parallel algorithms for string problems (AC, ZG, LG, KP, WP), pp. 713–722.
- ICALP-1993-CzumajG #graph #problem
- Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs (AC, AG), pp. 88–101.