An overview of computational complexity
Communications of the ACM
A random NC algorithm for depth first search
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Applications of combinatorial designs in computer science
ACM Computing Surveys (CSUR)
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximation and Intractability Results for the Maximum Cut Problem and Its Variants
IEEE Transactions on Computers
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Sample spaces uniform on neighborhoods
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the parallel complexity of computing a maximal independent set in a hypergraph
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Efficient asynchronous distributed symmetry breaking
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved algorithms via approximations of probability distributions (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Distributed cooperation in the absence of communication (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding large independent sets of hypergraphs in parallel
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of approximating pspace-complete problems for hierarchical specifications
Nordic Journal of Computing
A Software Tool for Generating Non-crosshybridizing Libraries of DNA Oligonucleotides
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Parallel algorithms for maximal acyclic sets
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
An NC algorithm for finding a maximal acyclic set in a graph
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Codeword design and information encoding in DNA ensembles
Natural Computing: an international journal
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Theoretical Computer Science
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
Randomized distributed algorithm for vertex coloring
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Throughput performance of d-tree multicast capable optical cross-connect under synchronous traffic
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
An improved simulated annealing algorithm for the maximum independent set problem
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.01 |
A parallel algorithm is presented that accepts as input a graph G and produces a maximal independent set of vertices in G. On a P-RAM without the concurrent write or concurrent read features, the algorithm executes in O((log n)4) time and uses O((n/(log n))3) processors, where n is the number of vertices in G. The algorithm has several novel features that may find other applications. These include the use of balanced incomplete block designs to replace random sampling by deterministic sampling, and the use of a “dynamic pigeonhole principle” that generalizes the conventional pigeonhole principle.