Search the dblp DataBase

Publications of Author

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