ABI]Alon, N., L. Babai, A. Itai, A fast and simple randomized parallel algorithm for the [ maximal independent set problem, J. of Algorithms, 7(1986), pp. 567-583.  Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Fast Distributed Algorithms for (Weakly) Connected .. - Dubhashi, Mei.. (Correct)
Efficient Construction of (Distributed) Verifiable Random Functions - Dodis (2002) (Correct)
The Fourth Moment in Luby's Distribution - Dubhashi, al. (1995) (Correct)
Algorithmic Derandomization via Complexity Theory - Sivakumar (2002) (2 citations) (Correct)
Approximate Counting of Inversions in a Data Stream - Ajtai, Jayram, Kumar.. (2002) (6 citations) (Correct)
Finding Large Independent Sets of Hypergraphs in Parallel - Shachnai, Srinivasan (Correct)
Minimizing Randomness in Minimum Spanning Tree, Parallel.. - Pettie, Ramachandran (Correct)
An Extension of the Lovász Local Lemma, and its.. - Srinivasan (Correct)
Minimizing Randomness in Minimum Spanning Tree, Parallel.. - Pettie, Ramachandran (2001) (Correct)
Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2001) (1 citation) (Correct)
Low Discrepancy Sets Yield Approximate Min-Wise.. - Saks, Srinivasan.. (1999) (1 citation) (Correct)
Computing With Very Weak Random Sources - Srinivasan, Zuckerman (48 citations) (Correct)
Small-Bias Probability Spaces: Efficient Constructions and.. - Naor, Naor (1993) (121 citations) (Correct)
An Efficient Parallel Algorithm That Finds Independent Sets.. - Goldberg, Spencer (1990) (5 citations) (Correct)
A New Parallel Algorithm For The Maximal Independent Set Problem - Goldberg, Spencer (1989) (31 citations) (Correct)
Implementing Luby's Algorithm on the Cray T3E - Gross, Lohrey (Correct)
A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (14 citations) (Correct)
Reducing Randomness In Computation Via Explicit Constructions - Zhou (1996) (Correct)
Low Discrepancy Sets Yield Approximate Min-Wise.. - Saks, Srinivasan.. (1999) (1 citation) (Correct)
Constructing Small Sample Spaces Satisfying Given Constraints - Koller, Megiddo (1993) (29 citations) (Correct)
A Measure of Parallelization for the Lexicographically First.. - Uehara (1997) (Correct)
Efficient Approximation of General Product Distributions - Even, Goldreich, Luby.. (1997) (Correct)
On the parallel complexity of Hamiltonian Cycle and.. - Dahlhaus, Hajnal.. (1993) (1 citation) (Correct)
Heuristics For Maximum Clique And Independent Set - Pelillo (1999) (1 citation) (Correct)
Efficient Approximation of Product Distributions - Even, Goldreich, Luby.. (1998) (1 citation) (Correct)
Deterministic Approximate Counting of Depth-2 Circuits - Luby, Velickovic, Wigderson (1993) (2 citations) (Correct)
Constructing a Maximal Independent Set in Parallel - Mark Goldberg Thomas (1989) (16 citations) (Correct)
Graph Domination, Coloring and Cliques in Telecommunications - Balasundaram, Butenko (Correct)
On the Construction of Pseudo-Random Permutations.. - Naor, Reingold (1996) (66 citations) (Correct)
Primal-Dual Distance Bounds of Linear Codes With - Application To Cryptography (2005) (Correct)
Approximate Counting of Inversions in a Data Stream - Ajtai, Jayram, Kumar.. (2002) (6 citations) (Correct)
Derandomization by Exploiting Redundancy - And Mutual Independence (Correct)
Parallel Derandomization Techniques - Yijie Han Department (Correct)
A Fast Derandomization Scheme and Its Applications - Yijie Han Department (1996) (1 citation) (Correct)
Splitters and Near-Optimal Derandomization - Naor, Schulman, Srinivasan (1995) (14 citations) (Correct)
Gossip-Based Computation of Aggregate Information - Kempe, Dobra, Gehrke (2003) (9 citations) (Correct)
Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2004) (1 citation) (Correct)
Constructing Small Sample Spaces Satisfying Given - Constraints Daphne Koller (Correct)
Hashing, Randomness and Dictionaries - Pagh (2002) (Correct)
Approximating Probability Distributions Using Small Sample.. - Azar, Motwani, Naor (1995) (1 citation) (Correct)
CS37501-1 Randomized Algorithms Winter 2003 - Lecture January And (Correct)
Pseudorandom Generators, Measure Theory, and Natural Proofs - Regan, Sivakumar, Cai (Correct)
Constant Depth Circuits and the Lutz Hypothesis - Cai, Sivakumar, Strauss (2 citations) (Correct)
Removing Randomness in Parallel Computation Without a Processor.. - Luby (1988) (37 citations) (Correct)
Approximations of General Independent Distributions - Even, Goldreich, Luby.. (1992) (26 citations) (Correct)
Linear Hashing - Alon, Dietzfelbinger, Miltersen.. (1997) (1 citation) Self-citation (Alon) (Correct)
Voting Paradoxes and Digraphs Realizations - Alon Self-citation (Alon) (Correct)
Linear Hash Functions - Alon, Dietzfelbinger, Miltersen.. Self-citation (Alon) (Correct)
Threshold functions for H-factors - Alon, Yuster (1993) (5 citations) Self-citation (Alon) (Correct)
The Algorithmic Aspects of the Regularity Lemma - Alon, Duke, Lefmann, Rödl.. (1994) (30 citations) Self-citation (Alon) (Correct)
First 50 documents Next 50
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