Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCliff Smyth 0001
Person information
- affiliation: University of North Carolina Greensboro (UNCG), Department of Mathematics and Statistics, Greensboro, NC, USA
- affiliation: Massachusetts Institute of Technology (MIT), Department of Mathematics, Cambridge, MA, USA
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
- affiliation: Institute for Advanced Study, Princeton, NJ, USA
- affiliation (PhD): Rutgers University, New Brunswick, NJ, USA
Other persons with the same name
- Cliff Smyth 0002 — Saybrook University, Pasadena, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]Thomas McConville
, Bruce E. Sagan, Clifford D. Smyth:
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko. Discret. Math. 344(8): 112483 (2021)- [i3]Parker B. Edwards, Jonathan D. Hauenstein, Clifford D. Smyth:
Certified evaluations of Hölder continuous functions at roots of polynomials. CoRR abs/2102.00115 (2021) - 2020
- [j18]C. Matthew Farmer, Joshua Hallam, Clifford D. Smyth:
The Noncrossing Bond Poset of a Graph. Electron. J. Comb. 27(4): 4 (2020) - [c7]Parker B. Edwards, Jonathan D. Hauenstein, Clifford D. Smyth:
Certified Evaluations of Hölder Continuous Functions at Roots of Polynomials. MC 2020: 185-203
2010 – 2019
- 2019
- [j17]John Engbers, David J. Galvin, Cliff Smyth:
Restricted Stirling and Lah number matrices and their inverses. J. Comb. Theory, Ser. A 161: 271-298 (2019) - [i2]Yu-Min Chung, Chuan-Shen Hu, Austin Lawson, Clifford D. Smyth:
TopoResNet: A hybrid deep learning architecture and its application to skin lesion classification. CoRR abs/1905.08607 (2019) - 2018
- [j16]Clifford D. Smyth:
A Probabilistic Characterization of the Dominance Order on Partitions. Order 35(2): 393-402 (2018) - [c6]Yu-Min Chung, Chuan-Shen Hu, Austin Lawson, Clifford D. Smyth:
Topological approaches to skin disease image analysis. IEEE BigData 2018: 100-105 - 2013
- [j15]Karl Mahlburg, Clifford D. Smyth:
Symmetric Polynomials and Symmetric Mean Inequalities. Electron. J. Comb. 20(3): 34 (2013) - [j14]Clifford D. Smyth:
Reimer's Inequality on a Finite Distributive Lattice. Comb. Probab. Comput. 22(4): 612-621 (2013) - 2012
- [j13]David M. Howard, Clifford D. Smyth:
Revolutionaries and Spies. Discret. Math. 312(22): 3384-3391 (2012) - 2011
- [j12]Jeff Kahn, Michael E. Saks, Clifford D. Smyth:
The Dual BKR Inequality and Rudich's Conjecture. Comb. Probab. Comput. 20(2): 257-266 (2011) - [j11]Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Clifford D. Smyth:
Enumeration of non-crossing pairings on bit strings. J. Comb. Theory, Ser. A 118(1): 129-151 (2011) - [j10]Clifford D. Smyth:
Approximate Query Complexity. ACM Trans. Comput. Theory 3(1): 3:1-3:11 (2011) - [i1]Daniel W. Cranston, Clifford D. Smyth, Douglas B. West:
Revolutionaries and spies on trees and unicyclic graphs. CoRR abs/1110.2274 (2011) - 2010
- [j9]Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliff Smyth:
Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100(3): 299-312 (2010)
2000 – 2009
- 2008
- [j8]József Balogh, Clifford D. Smyth:
On the variance of Shannon products of graphs. Discret. Appl. Math. 156(1): 110-118 (2008) - 2007
- [j7]Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky:
First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. 16(3): 375-400 (2007) - [j6]Alan M. Frieze, Michael Krivelevich, Cliff Smyth:
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. 16(5): 733-746 (2007) - [j5]Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth:
Codes identifying sets of vertices in random networks. Discret. Math. 307(9-10): 1094-1107 (2007) - [j4]Uri Abraham, James Cummings, Clifford D. Smyth:
Some results in polychromatic Ramsey theory. J. Symb. Log. 72(3): 865-896 (2007) - [j3]Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Cliff Smyth:
Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007) - 2005
- [j2]Irit Dinur, Oded Regev, Clifford D. Smyth:
The Hardness of 3-Uniform Hypergraph Coloring. Comb. 25(5): 519-535 (2005) - [c5]Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth:
Identifying codes in random networks. ISIT 2005: 1464-1467 - 2004
- [j1]József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy:
Long Monotone Paths in Line Arrangements. Discret. Comput. Geom. 32(2): 167-176 (2004) - 2003
- [c4]József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy:
Long monotone paths in line arrangements. SCG 2003: 124-128 - 2002
- [c3]Irit Dinur, Oded Regev, Clifford D. Smyth:
The Hardness of 3 - Uniform Hypergraph Coloring. FOCS 2002: 33- - [c2]Clifford D. Smyth:
Reimer's inequality and tardos' conjecture. STOC 2002: 218-221 - 2000
- [c1]Jeff Kahn, Michael E. Saks, Cliff Smyth:
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. CCC 2000: 98-103
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
