Karp, R. M.: Probabilistic recurrence relations. J. ACM 41 (1994) 1136-1150. Home/Search Document Not in Database Context ACM TOC Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Efficient Routing in Networks with Long Range Contacts - Barrière.. (2001) (1 citation) (Correct)
Efficient Routing in Networks with Long Range Contacts.. - Barrière, al. (2001) (1 citation) (Correct)
External-Memory Computational Geometry (Preliminary.. - Goodrich, Tsay.. (Correct)
External-Memory Computational Geometry - Goodrich, Tsay, Vengroff, Vitter (1993) (93 citations) (Correct)
Near-Optimal, Distributed Edge Colouring via the Nibble.. - Dubhashi, Grable, Panconesi (1996) (Correct)
Fast Distributed Algorithms Brooks-Vizing Colourings - Hanckowiak, Karonski.. (1997) (Correct)
Improved Master Theorems for Divide-and-Conquer Recurrences - Roura (2000) (4 citations) (Correct)
Asymptotic Enumeration Methods - Odlyzko (1996) (64 citations) (Correct)
Choosing Subsets with Maximum Weighted Average - Eppstein, Hirschberg (1997) (Correct)
Choosing Subsets with Maximum Weighted Average - Eppstein, Hirschberg (1995) (Correct)
Fast Approximation Algorithms for Fractional Packing and.. - Plotkin, Shmoys, Tardos (1995) (127 citations) (Correct)
Adding Multiple Cost Constraints to Combinatorial.. - Karger, Plotkin (1995) (32 citations) (Correct)
Near-Optimal, Distributed Edge Colouring via the Nibble.. - Dubhashi, Grable, Panconesi (1996) (Correct)
Probabilistic Recurrence Relations for Divide-and-Conquer.. - Zimmermann (1992) (Correct)
A Functional Approach to External Graph Algorithms - Abello, Buchsbaum, Westbrook (1998) (32 citations) (Correct)
Randomly Fallible Teachers: Learning Monotone DNF with an.. - Angluin, al. (1994) (17 citations) (Correct)
Probabilistic Recurrence Relations for Parallel.. - Karpinski, Zimmermann (1991) (Correct)
Distributed Largest-First Algorithm for Graph - Coloring Jennie Hansen (Correct)
Dynamic Replica Management in Distributed Hash Tables - Waldvogel, Hurley, Bauer (2003) (Correct)
On the Distributed Complexity of Computing Maximal Matchings - Hanckowiak, Karonski, al. (1997) (1 citation) (Correct)
Balls and Bins: A Study in Negative Dependence - Dubhashi, al. (1996) (24 citations) (Correct)
Fast Distributed Algorithms for Brooks-Vizing Colourings - Grable, Panconesi (Correct)
A Faster Distributed Algorithm for Computing Maximal.. - Hanckowiak, al. (1999) (1 citation) (Correct)
The Light Bulb Problem - Ramamohan Paturi Sanguthevar (1989) (1 citation) (Correct)
Stochastic Graphs Have Short Memory: Fully Dynamic.. - Nikoletseas Reif.. (1995) (Correct)
First 50 documents
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