default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan D. H. Smith
Person information
- affiliation: Iowa State University, Department of Mathematics, Ames, IA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j36]Jonathan D. H. Smith, Stefanie G. Wang:
Quasigroup Words and Reversible Automata. J. Multiple Valued Log. Soft Comput. 39(1): 135-157 (2022)- 2020
- [j35]Jonathan D. H. Smith, Stefanie G. Wang:
On the enumeration and asymptotic growth of free quasigroup words. Int. J. Algebra Comput. 30(07): 1465-1483 (2020)
2010 – 2019
- 2017
- [j34]Hwayoung Lee, Bokhee Im, Jonathan D. H. Smith:
Stochastic tensors and approximate symmetry. Discret. Math. 340(6): 1335-1350 (2017) - [j33]Anna B. Romanowska, Jonathan D. H. Smith:
Duality for Quasilattices and Galois Connections. Fundam. Informaticae 156(3-4): 331-359 (2017) - [j32]Jonathan D. H. Smith:
Burnside Orders, Burnside Algebras and Partition Lattices. Order 34(2): 253-263 (2017) - [j31]Jonathan D. H. Smith:
Poset Loops. Order 34(2): 265-285 (2017) - 2015
- [j30]Pranava K. Jha, Jonathan D. H. Smith:
Cycle Kronecker products that are representable as optimal circulants. Discret. Appl. Math. 181: 130-138 (2015) - 2014
- [j29]Jonathan D. H. Smith:
Ricci curvature, circulants, and a matching condition. Discret. Math. 329: 88-98 (2014) - 2013
- [c3]Anna B. Romanowska, Jonathan D. H. Smith:
Entropic Hopf algebras. TACL 2013: 187-190 - 2011
- [j28]Katarzyna Matczak, Anna B. Romanowska, Jonathan D. H. Smith:
Dyadic Polygons. Int. J. Algebra Comput. 21(3): 387-408 (2011) - [j27]Bokhee Im, Jonathan D. H. Smith:
Representation Theory for Varieties of Comtrans Algebras and Lie Triple Systems. Int. J. Algebra Comput. 21(3): 459-472 (2011) - [j26]Brent Kerby, Jonathan D. H. Smith:
A graph-theoretic approach to quasigroup cycle numbers. J. Comb. Theory A 118(8): 2232-2245 (2011) - 2010
- [j25]Kenneth W. Johnson, Jonathan D. H. Smith:
On the smallest simple, unipotent Bol loop. J. Comb. Theory A 117(6): 790-798 (2010)
2000 – 2009
- 2009
- [c2]Anna B. Romanowska, Jonathan D. H. Smith:
Barycentric Algebras and Gene Expression. WILF 2009: 20-27 - 2008
- [j24]Jonathan D. H. Smith:
Quasigroup Homotopies, Semisymmetrization, and Reversible Automata. Int. J. Algebra Comput. 18(7): 1203-1221 (2008) - 2007
- [j23]Grzegorz Binczak, Anna B. Romanowska, Jonathan D. H. Smith:
Poset extensions, convex sets, and semilattice presentations. Discret. Math. 307(1): 1-11 (2007) - [j22]Anna B. Romanowska, Jonathan D. H. Smith, Ewa Orlowska:
Abstract Barycentric Algebras. Fundam. Informaticae 81(1-3): 257-273 (2007) - [j21]Jonathan D. H. Smith:
Evans' Normal Form Theorem Revisited. Int. J. Algebra Comput. 17(8): 1577-1592 (2007) - 2005
- [j20]Ji-Young Choi, Jonathan D. H. Smith:
On The Combinatorics Of Multi-Restricted Numbers. Ars Comb. 75 (2005) - 2003
- [j19]Dug-Hwan Choi, Jonathan D. H. Smith:
Greedy Loop Transversal Codes for Correcting Error Burst. Discret. Math. 264(1-3): 37-44 (2003) - [j18]Ji-Young Choi, Jonathan D. H. Smith:
On the Unimodality and Combinatorics of Bessel Numbers. Discret. Math. 264(1-3): 45-54 (2003) - 2002
- [j17]Jonathan D. H. Smith:
Orbit decomposition of subset actions. Discret. Math. 247(1-3): 251-254 (2002) - 2001
- [j16]Jonathan D. H. Smith:
Some Observations on the Concepts of Information-Theoretic Entropy and Randomness. Entropy 3(1): 1-11 (2001) - [j15]Jonathan D. H. Smith:
"Information Theory and its Applications to Biology, Finance and Physics" at the Stefan Banach International Mathematical Center (Warsaw, Poland), May 21-26, 2001. Entropy 3(2): 64-65 (2001)
1990 – 1999
- 1999
- [j14]Jonathan D. H. Smith:
Speed's Orbit Problem: Variations on Themes of Burnside. Eur. J. Comb. 20(8): 867-873 (1999) - 1996
- [j13]Anna B. Romanowska, Jonathan D. H. Smith:
Semilattice-based dualities. Stud Logica 56(1/2): 225-261 (1996) - 1994
- [j12]Jonathan D. H. Smith:
Association Schemes, Superschemes, and Relations Invariant Under Permutation Groups. Eur. J. Comb. 15(3): 285-291 (1994) - 1992
- [j11]Jonathan D. H. Smith:
Quasigroups and quandles. Discret. Math. 109(1-3): 277-282 (1992) - 1991
- [j10]Jonathan D. H. Smith:
Finite Codes and Groupoid Words. Eur. J. Comb. 12(4): 331-339 (1991) - 1990
- [j9]Kenneth W. Johnson, Jonathan D. H. Smith, Sung Y. Song:
Characters of Finite Quasigroups VI: Critical Examples and Doubletons. Eur. J. Comb. 11(3): 267-275 (1990)
1980 – 1989
- 1989
- [j8]Kenneth W. Johnson, Jonathan D. H. Smith:
Characters of Finite Quasigroups III: Quotients and Fusion. Eur. J. Comb. 10(1): 47-56 (1989) - [j7]Kenneth W. Johnson, Jonathan D. H. Smith:
Characters of Finite Quasigroups IV: Products and Superschemes. Eur. J. Comb. 10(3): 257-263 (1989) - [j6]Jonathan D. H. Smith:
Induced Class Functions are Conditional Expectations. Eur. J. Comb. 10(3): 293-296 (1989) - [j5]Kenneth W. Johnson, Jonathan D. H. Smith:
Characters of Finite Quasigroups V: Linear Characters. Eur. J. Comb. 10(5): 449-456 (1989) - 1987
- [j4]Jonathan D. H. Smith:
Minimal trees of given search number. Discret. Math. 66(1-2): 191-202 (1987) - 1986
- [j3]Kenneth W. Johnson, Jonathan D. H. Smith:
Characters of Finite Quasigroups II: Induced Characters. Eur. J. Comb. 7(2): 131-137 (1986) - [j2]Kenneth W. Johnson, Jonathan D. H. Smith:
A Note on Character Induction in Association Schemes. Eur. J. Comb. 7(2): 139 (1986) - 1985
- [c1]Jonathan D. H. Smith:
Modal Theory, Partial Orders, and Digital Geometry. Mathematical Foundations of Programming Semantics 1985: 308-323 - 1984
- [j1]Kenneth W. Johnson, Jonathan D. H. Smith:
Characters of Finite Quasigroups. Eur. J. Comb. 5(1): 43-50 (1984)
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-06-10 20:25 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:
