default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason P. Smith
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Keith Malcolm Smith, Jason P. Smith:
Statistical Complexity of Heterogeneous Geometric Networks. CoRR abs/2310.20354 (2023)- 2022
- [j14]Dejan Govc
, Jason P. Smith:
Asymptotic behaviour of the containment of certain mesh patterns. Discret. Math. 345(5): 112813 (2022) - 2021
- [j13]Erfaneh Gharavi, Aaron Gu, Guangtao Zheng, Jason P. Smith, Hyun Jae Cho, Aidong Zhang, Donald E. Brown, Nathan C. Sheffield:
Embeddings of genomic region sets capture rich biological associations in lower dimensions. Bioinform. 37(23): 4299-4306 (2021) - [j12]Dejan Govc, Ran Levi, Jason P. Smith:
Complexes of tournaments, directionality filtrations and persistent homology. J. Appl. Comput. Topol. 5(2): 313-337 (2021) - 2020
- [j11]Daniel Lütgehetmann, Dejan Govc, Jason P. Smith, Ran Levi:
Computing Persistent Homology of Directed Flag Complexes. Algorithms 13(1): 19 (2020) - [j10]Jason P. Smith, Henning Úlfarsson:
The poset of mesh patterns. Discret. Math. 343(6): 111848 (2020)
2010 – 2019
- 2019
- [j9]Jason P. Smith:
On the Möbius Function and Topology of General Pattern Posets. Electron. J. Comb. 26(1): 1 (2019) - [j8]Mark Dukes, Thomas Selig, Jason P. Smith, Einar Steingrímsson:
Permutation Graphs and the Abelian Sandpile Model, Tiered Trees and Non-Ambiguous Binary Trees. Electron. J. Comb. 26(3): 3 (2019) - [j7]Emad Zahedi, Jason P. Smith:
Modular decomposition of graphs and the distance preserving property. Discret. Appl. Math. 265: 192-198 (2019) - [j6]Mark Dukes, Thomas Selig, Jason P. Smith, Einar Steingrímsson:
The Abelian sandpile model on Ferrers graphs - A classification of recurrent configurations. Eur. J. Comb. 81: 221-241 (2019) - [j5]Jason P. Smith:
The poset of graphs ordered by induced containment. J. Comb. Theory A 168: 348-373 (2019) - 2018
- [j4]Thomas Selig, Jason P. Smith, Einar Steingrímsson:
EW-Tableaux, Le-Tableaux, Tree-Like Tableaux and the Abelian Sandpile Model. Electron. J. Comb. 25(3): 3 (2018) - [i3]Emad Zahedi, Jason P. Smith:
Modular Decomposition of Graphs and the Distance Preserving Property. CoRR abs/1805.09853 (2018) - 2017
- [j3]Jason P. Smith:
A formula for the Möbius function of the permutation poset based on a topological decomposition. Adv. Appl. Math. 91: 98-114 (2017) - [i2]Jason P. Smith, Emad Zahedi:
On Distance Preserving and Sequentially Distance Preserving Graphs. CoRR abs/1701.06404 (2017) - [i1]Jason P. Smith:
On the Möbius Function and Topology of General Pattern Posets. CoRR abs/1705.08676 (2017) - 2016
- [j2]Jason P. Smith:
Intervals of permutations with a fixed number of descents are shellable. Discret. Math. 339(1): 118-126 (2016) - 2015
- [b1]Jason P. Smith:
On the Möbius function and topology of the permutation poset. University of Strathclyde, Glasgow, UK, 2015 - 2014
- [j1]Jason P. Smith:
On the Möbius Function of Permutations with One Descent. Electron. J. Comb. 21(2): 2 (2014)
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 2025-01-07 01:24 CET 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:
