David A. Grable

Available identifiers

Publication	Date of Publication	Type
Nearly-perfect hypergraph packing is in NC	2016-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q5501805	2015-08-14	Paper
Set intersection representations for almost all graphs	2000-11-19	Paper
Fast Distributed Algorithms for Brooks–Vizing Colorings	2000-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q4250215	2000-06-21	Paper
Forbidden induced partial orders	1999-12-12	Paper
More-than-nearly-perfect packings and partial designs	1999-12-08	Paper
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices	1999-06-21	Paper
Near-optimal, distributed edge colouring via the nibble method	1999-01-12	Paper
Random methods in design theory: A survey	1998-12-06	Paper
On random greedy triangle packing	1998-02-12	Paper
Nearly optimal distributed edge coloring in O(log log n) rounds	1997-07-15	Paper
The genus of a random graph	1996-04-08	Paper
The diameter of a random graph with bounded diameter	1995-09-05	Paper
The minimum independence number for designs	1995-07-24	Paper
Almost all linear spaces and partial \(t\)-designs have trivial automorphism groups	1995-03-02	Paper
Hypergraphs and sharpened sieve inequalities	1994-11-28	Paper
https://portal.mardi4nfdi.de/entity/Q4201567	1993-08-25	Paper
Sharpened Bonferroni inequalities	1993-03-10	Paper
Two packing problems on \(k\)-matroid trees	1992-06-26	Paper

This page was built for person: David A. Grable