default search action
Curtis Greene
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j19]Hélène Barcelo, Curtis Greene, Abdul Salam Jarrah
, Volkmar Welker:
Homology Groups of Cubical Sets with Connections. Appl. Categorical Struct. 29(3): 415-429 (2021) - [j18]Hélène Barcelo
On the Vanishing of Discrete Singular Cubical Homology for Graphs. SIAM J. Discret. Math. 35(1): 35-54 (2021)
2010 – 2019
- 2011
- [j17]Allison Cuttler, Curtis Greene, Mark A. Skandera
Inequalities for symmetric means. Eur. J. Comb. 32(6): 745-761 (2011)
2000 – 2009
- 2006
- [j16]John Dollhopf, Ian P. Goulden, Curtis Greene:
Words Avoiding a Reflexive Acyclic Relation. Electron. J. Comb. 11(2) (2006) - [j15]Sergey Fomin
Noncommutative Schur functions and their applications. Discret. Math. 306(10-11): 1080-1096 (2006) - 2005
- [j14]James M. Greenberg, Curtis Greene, S. P. Hastings:
Remarks on a 25 year old Theorem on Two-dimensional Cellular Automata. Int. J. Unconv. Comput. 1(4): 399-402 (2005)
1990 – 1999
- 1998
- [j13]Sergey Fomin, Curtis Greene:
Noncommutative schur functions and their applications. Discret. Math. 193(1-3): 179-200 (1998) - 1997
- [j12]Sergey Fomin, Curtis Greene, Victor Reiner
Balanced Labellings and Schubert Polynomials. Eur. J. Comb. 18(4): 373-389 (1997) - 1996
- [e1]Louis J. Billera, Curtis Greene, Rodica Simion, Richard P. Stanley:
Formal Power Series and Algebraic Combinatorics, Proceedings of a DIMACS Workshop, USA, May 23-27, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 24, DIMACS/AMS 1996, ISBN 978-0-8218-0324-0 [contents] - 1993
- [j11]Sergey Fomin
A Littlewood-Richardson Miscellany. Eur. J. Comb. 14(3): 191-212 (1993)
1980 – 1989
- 1988
- [j10]Curtis Greene:
A Class of Lattices with Möbius Function ± 1, 0. Eur. J. Comb. 9(3): 225-240 (1988) - [j9]Curtis Greene:
Posets of shuffles. J. Comb. Theory A 47(2): 191-206 (1988) - 1986
- [j8]Curtis Greene, Daniel J. Kleitman:
Longest Chains in the Lattice of Integer Partitions ordered by Majorization. Eur. J. Comb. 7(1): 1-10 (1986) - 1984
- [j7]Curtis Greene, Albert Nijenhuis, Herbert S. Wilf:
Another Probabilistic Method in the Theory of Young Tableaux. J. Comb. Theory A 37(2): 127-135 (1984) - 1980
- [j6]James M. Greenberg, Curtis Greene, Stuart Hastings:
A Combinatorial Problem Arising in the Study of Reaction-Diffusion Equations. SIAM J. Algebraic Discret. Methods 1(1): 34-42 (1980)
1970 – 1979
- 1976
- [j5]Curtis Greene, Daniel J. Kleitman:
The Structure of Sperner k-Families. J. Comb. Theory A 20(1): 41-68 (1976) - [j4]Curtis Greene:
Some Partitions Associated with a Partially Ordered Set. J. Comb. Theory A 20(1): 69-79 (1976) - [j3]Curtis Greene, Daniel J. Kleitman:
Strong Versions of Sperner's Theorem. J. Comb. Theory A 20(1): 80-88 (1976) - 1975
- [j2]Elliot Bird, Curtis Greene, Daniel J. Kleitman:
Automorphisms of lexicographic products. Discret. Math. 11(3): 191-198 (1975) - [j1]Curtis Greene, Glenn A. Iba:
Cayley's formula for multidimensional trees. Discret. Math. 13(1): 1-11 (1975)
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 2024-10-07 21:20 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: