The algorithmic aspects of uncrowded hypergraphs

A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms

Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986

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

An efficient parallel algorithm that finds independent sets of guaranteed size

SIAM Journal on Discrete Mathematics

Modified ranks of tensors and the size of circuits

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Approximating maximum independent sets by excluding subgraphs

BIT

Greed is good: approximating independent sets in sparse and bounded-degree graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Multicolored subsets in colored hypergraphs

Journal of Combinatorial Theory Series A

On uncrowded hypergraphs

Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science

Improved approximations of independent sets in bounded-degree graphs via subgraph removal

Nordic Journal of Computing

Derandomization for Sparse Approximations and Independent Sets

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science

Free bits, PCPs and non-approximability-towards tight results

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science