default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Thomson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]David Thomson:
Whitman Tracked Between Editions, Rossetti as a Complex Subversive, and the Collective Sense of Authorship: A Mixed Methods Accounting of a Hyperlinked "Calamus". Digit. Humanit. Q. 17(1) (2023)
2010 – 2019
- 2019
- [j14]Claude Gravel
, Daniel Panario, David Thomson:
Unicyclic strong permutations. Cryptogr. Commun. 11(6): 1211-1231 (2019) - 2018
- [j13]Lucas Reis, David Thomson:
Existence of primitive 1-normal elements in finite fields. Finite Fields Their Appl. 51: 238-269 (2018) - [j12]David Thomson, Colin Weir:
Artin-Schreier extensions of normal bases. Finite Fields Their Appl. 53: 267-286 (2018) - [c5]Mahnoosh Mehrabani, David Thomson, Benjamin Stern:
Practical Application of Domain Dependent Confidence Measurement for Spoken Language Understanding Systems. NAACL-HLT (3) 2018: 185-192 - [c4]Lucia Moura, Daniel Panario, David Thomson:
Normal Basis Exhaustive Search: 10 Years Later. WAIFI 2018: 188-206 - [i1]Claude Gravel, Daniel Panario, David Thomson:
Unicyclic Strong Permutations. CoRR abs/1809.03551 (2018) - 2017
- [j11]Melissa A. Huggan, Gary L. Mullen, Brett Stevens, David Thomson:
Sudoku-like arrays, codes and orthogonality. Des. Codes Cryptogr. 82(3): 675-693 (2017) - 2016
- [j10]Gary L. Mullen, Daniel Panario, David Thomson:
Fast and Simple Modular Interpolation Using Factorial Representation. Am. Math. Mon. 123(5): 471-480 (2016) - 2013
- [j9]Sophie Huczynska, Gary L. Mullen, Daniel Panario, David Thomson:
Existence and properties of k-normal elements over finite fields. Finite Fields Their Appl. 24: 170-183 (2013) - [j8]Daniel Panario, Amin Sakzad, Brett Stevens, David Thomson, Qiang Wang:
Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map. IEEE Trans. Inf. Theory 59(9): 5616-5626 (2013) - [p2]David Thomson:
Tables. Handbook of Finite Fields 2013: 32-52 - [p1]Shuhong Gao, David Thomson:
Complexity of normal bases. Handbook of Finite Fields 2013: 117-127 - 2012
- [j7]Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson:
Gauss periods as constructions of low complexity normal bases. Des. Codes Cryptogr. 62(1): 43-62 (2012) - [j6]John T. Ethier, Gary L. Mullen, Daniel Panario, Brett Stevens, David Thomson:
Sets of orthogonal hypercubes of class r. J. Comb. Theory A 119(2): 430-439 (2012) - 2011
- [j5]Brandon Hanson, Daniel Panario, David Thomson:
Swan-like results for binomials and trinomials over finite fields of odd characteristic. Des. Codes Cryptogr. 61(3): 273-283 (2011) - [c3]Amali Weerasinghe, Antonija Mitrovic, David Thomson, Pavle Mogin, Brent Martin:
Evaluating a General Model of Adaptive Tutorial Dialogues. AIED 2011: 394-402 - [c2]David Thomson, Antonija Mitrovic:
Opponent-based Tactic Selection for a First Person Shooter Game. ICAART (1) 2011: 591-594 - 2010
- [j4]David Thomson, Antonija Mitrovic:
Preliminary Evaluation of a Negotiable Student Model in a Constraint-Based its. Res. Pract. Technol. Enhanc. Learn. 5(1): 19-33 (2010)
2000 – 2009
- 2009
- [j3]Daniel Panario, David Thomson:
Efficient p th root computations in finite fields of characteristic p. Des. Codes Cryptogr. 50(3): 351-358 (2009) - 2008
- [j2]Maria Christopoulou, Theodoulos Garefalakis, Daniel Panario, David Thomson:
The trace of an optimal normal element and low complexity normal bases. Des. Codes Cryptogr. 49(1-3): 199-215 (2008) - [j1]Ariane M. Masuda, Lucia Moura, Daniel Panario, David Thomson:
Low Complexity Normal Elements over Finite Fields of Characteristic Two. IEEE Trans. Computers 57(7): 990-1001 (2008) - [c1]Moffat Mathews, Tanja Mitrovic, David Thomson:
Analysing High-Level Help-Seeking Behaviour in ITSs. AH 2008: 312-315
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:31 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:
