Michal Hanckowiak, Michal Karonski, Alessandro Panconesi  Home/Search
Context
Related
| brics.dk/RS/97/Ref...ICSRS9737.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/RS/97/Ref/BRICSRS97... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This document in subdirectory RS/97/37/ Institut fur Informatik Humboldt-Universitat zu Berlin D-10099 Berlin Germany grable@informatik.hu-berlin.de University of Arhus DK-8000 Arhus C, Denmark ale@brics.dk 1 (Update)
Similar documents (at the sentence level):
72.4%: Fast Distributed Algorithms for Brooks-Vizing Colourings.. - Grable, Panconesi (Correct)
48.3%: Fast Distributed Algorithms for Brooks-Vizing Colourings - Grable, Panconesi (Correct)
Active bibliography (related documents): More All
1.3: On the Distributed Complexity of Computing Maximal Matchings - Hanckowiak, Karonski, al. (1997) (Correct)
0.7: A Faster Distributed Algorithm for Computing Maximal.. - Hanckowiak, al. (1999) (Correct)
0.3: Nearly optimal distributed edge colouring in O(log log n) rounds - Grable, Panconesi (1997) (Correct)
Similar documents based on text: More All
1.2: Finding Maximal Pairs with Bounded Gap - Brodal, Lyngsų, Pedersen, Stoye (1999) (Correct)
1.2: Finding Maximal Quasiperiodicities in Strings - Brodal, Pedersen (1999) (Correct)
1.2: A Group Signature Scheme Based on an RSA-Variant - Camenisch, Michels (1998) (Correct)
BibTeX entry: (Update)
@misc{ hanckowiak-fast,
author = "Michal Hanckowiak and Michal Karonski and Alessandro Panconesi",
title = "Fast Distributed Algorithms Brooks-Vizing Colourings",
url = "citeseer.ist.psu.edu/hanckowiak97fast.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
40 Network decomposition and locality in distributed computing - Awerbuch, Goldberg et al. - 1989
40 Probabilistic recurrence relations (context) - Karp
29 Springer Verlag (context) - Bollob'as, Theory - 1979
17 Theoretical Computer Science (context) - Karloff, for et al. - 1989
17 On Brooks' Theorem for sparse graphs (context) - Kim - 1995
11 Asymptotic choice number for triangle-free graphs (context) - Johansson - 1996
10 the complexity of distributed network decomposition (context) - Panconesi, Srinivasan
9 Removing randomness in parallel without processor penalty (context) - Luby - 1993
9 Nearly optimal distributed edge colouring in O (context) - Grable, Panconesi - 1997
7 Brooks coloring in parallel (context) - Hajnal, Szemer'edi - 1990
7 Probabilistic recurrence relations revisited - Chaudhuri, Dubhashi
7 Personal communication (context) - Johansson - 1997
6 and maximal degree (context) - Bollob'as, number - 1978
4 On random greedy triangle packing - Grable - 1997
3 A faster parallel algorithm to color a graph with \Delta col.. (context) - Karchmer, Naor - 1988
2 The local nature of \Delta-coloring and its algorithmic appl.. (context) - Panconesi, Srinivasan - 1995
http://www.informatik.hu-berlin.de/grable/ldi.ps"
Documents on the same site (http://www.brics.dk/RS/97/Ref/BRICS-RS-97-Ref/): More
Transforming Recursive Equations into Programs with Block.. - Danvy, Schultz (1997) (Correct)
CoFI: The Common Framework Initiative for Algebraic Specification .. - Mosses (1997) (Correct)
Syntax and Semantics of the logic ... - Butz (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC