| 2006 |
|---|
| 14 | EE | Jerzy Jaworski,
Michal Karonski,
Dudley Stark:
The degree of a typical vertex in generalized random intersection graph models.
Discrete Mathematics 306(18): 2152-2165 (2006) |
| 2004 |
|---|
| 13 | | Hans Garmo,
Svante Janson,
Michal Karonski:
On Generalized Random Railways.
Combinatorics, Probability & Computing 13(1): 31-35 (2004) |
| 2003 |
|---|
| 12 | EE | Michal Karonski,
Boris Pittel:
Existence of a perfect matching in a random (1+e-1)--out bipartite graph.
J. Comb. Theory, Ser. B 88(1): 1-16 (2003) |
| 2001 |
|---|
| 11 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Michal Karonski:
Distributed O(Delta log(n))-Edge-Coloring Algorithm.
ESA 2001: 345-355 |
| 10 | EE | Michal Karonski,
Magdalena Szymkowiak:
On a solution of a randomized three tracks variant of the Gate Matrix Layout problem.
Discrete Mathematics 236(1-3): 179-189 (2001) |
| 9 | EE | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings.
SIAM J. Discrete Math. 15(1): 41-57 (2001) |
| 2000 |
|---|
| 8 | | Andrzej Czygrinow,
Michal Karonski,
Vaidy S. Sunderam:
The Polling Primitive for Computer Networks.
Informatica (Slovenia) 24(2): (2000) |
| 7 | | Michal Karonski,
Joel Spencer:
Ten Years!
Random Struct. Algorithms 16(1): 1-3 (2000) |
| 1999 |
|---|
| 6 | EE | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically.
PODC 1999: 219-228 |
| 5 | EE | Alan M. Frieze,
Michal Karonski,
Lubos Thoma:
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees.
SIAM J. Discrete Math. 12(2): 208-216 (1999) |
| 1998 |
|---|
| 4 | | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings.
SODA 1998: 219-225 |
| 1997 |
|---|
| 3 | EE | Michal Karonski,
Tomasz Luczak:
The number of connected sparsely edged uniform hypergraphs.
Discrete Mathematics 171(1-3): 153-167 (1997) |
| 1990 |
|---|
| 2 | | Andrew D. Barbour,
Svante Janson,
Michal Karonski,
Andrzej Rucinski:
Small Cliques in Random Graphs.
Random Struct. Algorithms 1(4): 403-434 (1990) |
| 1989 |
|---|
| 1 | EE | Andrew D. Barbour,
Michal Karonski,
Andrzej Rucinski:
A central limit theorem for decomposable random variables with applications to random graphs.
J. Comb. Theory, Ser. B 47(2): 125-145 (1989) |
