default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Scanlon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Michael Christ, James Demmel, Nicholas Knight, Thomas Scanlon, Katherine A. Yelick:
On Multilinear Inequalities of Holder-Brascamp-Lieb Type for Torsion-Free Discrete Abelian Groups. J. Log. Anal. 16 (2024)- 2023
- [i6]Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin, Thomas Scanlon:
Identifiable specializations for ODE models. CoRR abs/2308.16273 (2023) - [i5]Nicolette Meshkat, Alexey Ovchinnikov, Thomas Scanlon:
Algorithm for finding new identifiable reparametrizations of parametric ODEs. CoRR abs/2310.03057 (2023) - 2022
- [j12]Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin
, Thomas Scanlon:
Multi-experiment Parameter Identifiability of ODEs and Model Theory. SIAM J. Appl. Algebra Geom. 6(3): 339-367 (2022) - [c2]Thomas Scanlon, Jose Morales:
Revelations from an Agile and DevSecOps Transformation in a Large Organization: An Experiential Case Study. ICSSP/ICGSE 2022: 77-81 - 2021
- [j11]Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin, Thomas Scanlon:
Computing all identifiable functions of parameters for ODE models. Syst. Control. Lett. 157: 105030 (2021) - 2020
- [i4]Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin, Thomas Scanlon:
Computing all identifiable functions for ODE models. CoRR abs/2004.07774 (2020) - [i3]Wei Li, Alexey Ovchinnikov, Gleb Pogudin, Thomas Scanlon:
Algorithms yield upper bounds in differential algebra. CoRR abs/2005.01608 (2020) - [i2]Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin, Thomas Scanlon:
Multi-experiment parameter identifiability of ODEs and model theory. CoRR abs/2011.10868 (2020)
2010 – 2019
- 2018
- [j10]Åsa Hirvonen, Thomas Scanlon, Jouko Väänänen, Dag Westerståhl:
Preface. Ann. Pure Appl. Log. 169(12): 1243-1245 (2018) - 2017
- [j9]James Freitag, Wei Li, Thomas Scanlon, William Johnson:
Differential Chow varieties exist. J. Lond. Math. Soc. 95(1): 128-156 (2017) - 2014
- [j8]Rahim Moosa, Thomas Scanlon:
Model theory of fields with free operators in characteristic zero. J. Math. Log. 14(2): 1450009 (2014) - 2013
- [i1]Michael Christ, James Demmel, Nicholas Knight, Thomas Scanlon, Katherine A. Yelick:
Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1. CoRR abs/1308.0068 (2013)
2000 – 2009
- 2006
- [j7]Matthias Aschenbrenner, Rahim Moosa, Thomas Scanlon:
Strongly minimal groups in the theory of compact complex spaces. J. Symb. Log. 71(2): 529-552 (2006) - 2005
- [c1]Thomas Scanlon:
Nonstandard Meromorphic Groups. WoLLIC 2005: 185-196 - 2002
- [j6]Anand Pillay, Thomas Scanlon:
Compact Complex Manifolds with The Dop and Other Properties. J. Symb. Log. 67(2): 737-743 (2002) - 2001
- [j5]Thomas Scanlon:
Diophantine geometry from model theory. Bull. Symb. Log. 7(1): 37-57 (2001) - [j4]Thomas Scanlon:
Public Key Cryptosystems Based on Drinfeld Modules Are Insecure. J. Cryptol. 14(4): 225-230 (2001) - 2000
- [j3]Jan Krajícek, Thomas Scanlon:
Combinatorics with definable sets: Euler characteristics and Grothendieck rings. Bull. Symb. Log. 6(3): 311-330 (2000) - [j2]Thomas Scanlon:
A Model Complete Theory of Valued D-Fields. J. Symb. Log. 65(4): 1758-1784 (2000)
1990 – 1999
- 1999
- [j1]Ehud Hrushovski, Thomas Scanlon:
Lascar and Morley Ranks Differ in Differentially Closed Fields. J. Symb. Log. 64(3): 1280-1284 (1999)
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-07-10 20:41 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:
