Cliff Smyth

Orcid: 0000-0003-1486-7900

Affiliations:
  • University of North Carolina Greensboro (UNCG), Department of Mathematics and Statistics, Greensboro, NC, USA
  • Massachusetts Institute of Technology (MIT), Department of Mathematics, Cambridge, MA, USA
  • Carnegie Mellon University, Pittsburgh, PA, USA
  • Institute for Advanced Study, Princeton, NJ, USA
  • Rutgers University, New Brunswick, NJ, USA (PhD)


According to our database1, Cliff Smyth authored at least 26 papers between 2000 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko.
Discret. Math., 2021

2020
The Noncrossing Bond Poset of a Graph.
Electron. J. Comb., 2020

Certified Evaluations of Hölder Continuous Functions at Roots of Polynomials.
Proceedings of the Maple in Mathematics Education and Research - 4th Maple Conference, 2020

2019
Restricted Stirling and Lah number matrices and their inverses.
J. Comb. Theory, Ser. A, 2019

TopoResNet: A hybrid deep learning architecture and its application to skin lesion classification.
CoRR, 2019

2018
A Probabilistic Characterization of the Dominance Order on Partitions.
Order, 2018

Topological approaches to skin disease image analysis.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2013
Reimer's Inequality on a Finite Distributive Lattice.
Comb. Probab. Comput., 2013

Symmetric Polynomials and Symmetric Mean Inequalities.
Electron. J. Comb., 2013

2012
Revolutionaries and Spies.
Discret. Math., 2012

2011
Approximate Query Complexity.
ACM Trans. Comput. Theory, 2011

Enumeration of non-crossing pairings on bit strings.
J. Comb. Theory, Ser. A, 2011

The Dual BKR Inequality and Rudich's Conjecture.
Comb. Probab. Comput., 2011

Revolutionaries and spies on trees and unicyclic graphs
CoRR, 2011

2010
Anti-Ramsey properties of random graphs.
J. Comb. Theory, Ser. B, 2010

2008
On the variance of Shannon products of graphs.
Discret. Appl. Math., 2008

2007
Randomly generated intersecting hypergraphs II.
Random Struct. Algorithms, 2007

Some results in polychromatic Ramsey theory.
J. Symb. Log., 2007

Codes identifying sets of vertices in random networks.
Discret. Math., 2007

On the Chromatic Number of Random Graphs with a Fixed Degree Sequence.
Comb. Probab. Comput., 2007

First-Order Definability of Trees and Sparse Random Graphs.
Comb. Probab. Comput., 2007

2005
The Hardness of 3-Uniform Hypergraph Coloring.
Comb., 2005

Identifying codes in random networks.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Long Monotone Paths in Line Arrangements.
Discret. Comput. Geom., 2004

2002
Reimer's inequality and tardos' conjecture.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2000
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000


  Loading...