|
Search the dblp DataBase
Clifford D. Smyth:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jeff Kahn, Michael E. Saks, Clifford D. Smyth
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:98-103 [Conf]
- József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
Long monotone paths in line arrangements. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2003, pp:124-128 [Conf]
- Irit Dinur, Oded Regev, Clifford D. Smyth
The Hardness of 3 - Uniform Hypergraph Coloring. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:33-0 [Conf]
- Clifford D. Smyth
Reimer's inequality and tardos' conjecture. [Citation Graph (0, 0)][DBLP] STOC, 2002, pp:218-221 [Conf]
- Irit Dinur, Oded Regev, Clifford D. Smyth
The Hardness of 3-Uniform Hypergraph Coloring. [Citation Graph (0, 0)][DBLP] Combinatorica, 2005, v:25, n:5, pp:519-535 [Journal]
- József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
Long Monotone Paths in Line Arrangements. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2004, v:32, n:2, pp:167-176 [Journal]
- Alan Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth
Codes identifying sets of vertices in random networks. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:9-10, pp:1094-1107 [Journal]
First-Order Definability of Trees and Sparse Random Graphs. [Citation Graph (, )][DBLP]
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. [Citation Graph (, )][DBLP]
On the variance of Shannon products of graphs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|