Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Smyth, Clifford
75  Ergebnisse:
Personensuche X
?
1

On a rank-unimodality conjecture of Morier-Genoud and Ovsie..:

McConville, Thomas ; Sagan, Bruce E. ; Smyth, Clifford
Discrete Mathematics.  344 (2021)  8 - p. 112483 , 2021
Link: https://doi.org/10.1016/..
 
?
2

TopoResNet: A Hybrid Deep Learning Architecture and Its App..:

Hu, Chuan-Shen ; Lawson, Austin ; Chen, Jung-Sheng...
Mathematics.  9 (2021)  22 - p. 2924 , 2021
Link: https://doi.org/10.3390/..
 
?
3

Certified Evaluations of Hölder Continuous Functions at Roo..:

, In: Communications in Computer and Information Science; Maple in Mathematics Education and Research,
Edwards, Parker B. ; Hauenstein, Jonathan D. ; Smyth, Clifford D. - p. 185-203 , 2021
Link: https://doi.org/10.1007/..
 
?
4

A Probabilistic Characterization of the Dominance Order on ..:

Smyth, Clifford
Order.  35 (2017)  2 - p. 393-402 , 2017
Link: https://doi.org/10.1007/..
 
?
5

Reimer's Inequality on a Finite Distributive Lattice:

SMYTH, CLIFFORD
Combinatorics, Probability and Computing.  22 (2013)  4 - p. 612-621 , 2013
Link: https://doi.org/10.1017/..
 
?
6

Revolutionaries and Spies:

Howard, David ; Smyth, Clifford
Discrete Mathematics.  312 (2012)  22 - p. 3384-3391 , 2012
Link: https://doi.org/10.1016/..
 
?
7

Enumeration of non-crossing pairings on bit strings:

Kemp, Todd ; Mahlburg, Karl ; Rattan, Amarpreet.
Journal of Combinatorial Theory, Series A.  118 (2011)  1 - p. 129-151 , 2011
Link: https://doi.org/10.1016/..
 
?
8

Approximate Query Complexity:

Smyth, Clifford
ACM Transactions on Computation Theory.  3 (2011)  1 - p. 1-11 , 2011
Link: https://doi.org/10.1145/..
 
?
9

Approximate Query Complexity:

Smyth, Clifford
ACM Transactions on Computation Theory (TOCT).  3 (2011)  1 - p. 1-11 , 2011
Link: https://dl.acm.org/doi/1..
 
?
10

The Dual BKR Inequality and Rudich's Conjecture:

KAHN, JEFF ; SAKS, MICHAEL ; SMYTH, CLIFFORD
Combinatorics, Probability and Computing.  20 (2010)  2 - p. 257-266 , 2010
Link: https://doi.org/10.1017/..
 
?
11

On the variance of Shannon products of graphs:

Balogh, József ; Smyth, Clifford
Discrete Applied Mathematics.  156 (2008)  1 - p. 110-118 , 2008
Link: https://doi.org/10.1016/..
 
?
12

First-Order Definability of Trees and Sparse Random Graphs:

BOHMAN, TOM ; FRIEZE, ALAN ; ŁUCZAK, TOMASZ...
Combinatorics, Probability and Computing.  16 (2007)  3 - p. 375 , 2007
Link: https://doi.org/10.1017/..
 
?
13

Some Results in Polychromatic Ramsey Theory:

Abraham, Uri ; Cummings, James ; Smyth, Clifford
The Journal of Symbolic Logic.  72 (2007)  3 - p. 865-896 , 2007
Link: https://www.jstor.org/st..
 
?
14

The Hardness of 3-Uniform Hypergraph Coloring:

Dinur*, Irit ; Regev†, Oded ; Smyth‡, Clifford
Combinatorica.  25 (2005)  5 - p. 519-535 , 2005
Link: https://doi.org/10.1007/..
 
?
15

Long Monotone Paths in Line Arrangements:

Balogh, J�zsef ; Regev, Oded ; Smyth, Clifford..
Discrete & Computational Geometry.  32 (2004)  2 - p. , 2004
Link: https://doi.org/10.1007/..
 
1-15