Clifford D. Smyth

23 papers A* 2Journal 18Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Smooth connectivity in real algebraic varieties.
Numer. Algorithms
Joseph Cummings, Jonathan D. Hauenstein, Hoon Hong, Clifford D. Smyth
2021 J jnl
Certified evaluations of Hölder continuous functions at roots of polynomials.
CoRR
Parker B. Edwards, Jonathan D. Hauenstein, Clifford D. Smyth
2021 J jnl
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko.
Discret. Math.
Thomas McConville, Bruce E. Sagan, Clifford D. Smyth
2020 — conf
Certified Evaluations of Hölder Continuous Functions at Roots of Polynomials.
MC
Parker B. Edwards, Jonathan D. Hauenstein, Clifford D. Smyth
2020 J jnl
The Noncrossing Bond Poset of a Graph.
Electron. J. Comb.
C. Matthew Farmer, Joshua Hallam, Clifford D. Smyth
2019 J jnl
TopoResNet: A hybrid deep learning architecture and its application to skin lesion classification.
CoRR
Yu-Min Chung, Chuan-Shen Hu, Austin Lawson, Clifford D. Smyth
2018 J jnl
A Probabilistic Characterization of the Dominance Order on Partitions.
Order
Clifford D. Smyth
2018 — conf
Topological approaches to skin disease image analysis.
IEEE BigData
Yu-Min Chung, Chuan-Shen Hu, Austin Lawson, Clifford D. Smyth
2013 J jnl
Reimer's Inequality on a Finite Distributive Lattice.
Comb. Probab. Comput.
Clifford D. Smyth
2013 J jnl
Symmetric Polynomials and Symmetric Mean Inequalities.
Electron. J. Comb.
Karl Mahlburg, Clifford D. Smyth
2012 J jnl
Revolutionaries and Spies.
Discret. Math.
David M. Howard, Clifford D. Smyth
2011 J jnl
Approximate Query Complexity.
ACM Trans. Comput. Theory
Clifford D. Smyth
2011 J jnl
Enumeration of non-crossing pairings on bit strings.
J. Comb. Theory A
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Clifford D. Smyth
2011 J jnl
Revolutionaries and spies on trees and unicyclic graphs
CoRR
Daniel W. Cranston, Clifford D. Smyth, Douglas B. West
2011 J jnl
The Dual BKR Inequality and Rudich's Conjecture.
Comb. Probab. Comput.
Jeff Kahn, Michael E. Saks, Clifford D. Smyth
2008 J jnl
On the variance of Shannon products of graphs.
Discret. Appl. Math.
József Balogh, Clifford D. Smyth
2007 J jnl
First-Order Definability of Trees and Sparse Random Graphs.
Comb. Probab. Comput.
Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky
2007 J jnl
Some results in polychromatic Ramsey theory.
J. Symb. Log.
Uri Abraham, James Cummings, Clifford D. Smyth
2005 J jnl
The Hardness of 3-Uniform Hypergraph Coloring.
Comb.
Irit Dinur, Oded Regev, Clifford D. Smyth
2004 J jnl
Long Monotone Paths in Line Arrangements.
Discret. Comput. Geom.
József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
2003 — conf
Long monotone paths in line arrangements.
SCG
József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
2002 A* conf
Reimer's inequality and tardos' conjecture.
STOC
Clifford D. Smyth
2002 A* conf
The Hardness of 3 - Uniform Hypergraph Coloring.
FOCS
Irit Dinur, Oded Regev, Clifford D. Smyth