C. Greg Plaxton

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	Optimal cover time for a graph-based coupon collector process	2013	Nedialko B. Dimitrov C. Greg Plaxton
+ PDF Chat	Optimal Cover Time for a Graph-Based Coupon Collector Process	2005	Nedialko B. Dimitrov C. Greg Plaxton
+	Lower Bounds for Shellsort	1997	C. Greg Plaxton Torsten Suel
+	Lower bounds for sorting networks	1995	Nabil Kahalé Tom Leighton Yuan Ma C. Greg Plaxton Torsten Suel Endre Szemerédi

Common Coauthors

Coauthor	Papers Together
Torsten Suel	2
Nedialko B. Dimitrov	2
Nabil Kahalé	1
Yuan Ma	1
Endre Szemerédi	1
Tom Leighton	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Extremal Combinatorics	2001	Stasys Jukna	2
+	Problems and results in extremal combinatorics—I	2003	Noga Alon	2
+	A Lower Bound on the Size of Shellsort Sorting Networks	1993	Robert Cypher	1
+	Bad cases for shaker-sort	1988	Mark Allen Weiss Robert Sedgewick	1
+ PDF Chat	Eigenvalues and expansion of regular graphs	1995	Nabil Kahalé	1
+ PDF Chat	Lower Bounds on Merging Networks	1976	Andrew Chi-Chih Yao Foong Frances Yao	1
+ PDF Chat	Optimal Cover Time for a Graph-Based Coupon Collector Process	2005	Nedialko B. Dimitrov C. Greg Plaxton	1
+	The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging	1979	Lamagna	1
+	Improved lower bounds for Shellsort	1992	C. Gregory Plaxton Bjorn Poonen Torsten Suel	1
+ PDF Chat	The asymptotic complexity of merging networks	1992	Peter Bro Miltersen Mike Paterson Jun Tarui	1
+ PDF Chat	The Worst Case in Shellsort and Related Algorithms	1993	Bjorn Poonen	1
+ PDF Chat	Problems and results in extremal combinatorics—II	2007	Noga Alon	1
+	Tight lower bounds for Shellsort	1988	Mark Allen Weiss Robert Sedgewick	1