default search action
Andrew M. Marshall
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Serdar Erbatur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Deciding Knowledge Problems Modulo Classes of Permutative Theories. LOPSTR 2024: 47-63 - [i2]Carter Bunch, Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent. CoRR abs/2401.17226 (2024) - 2023
- [c21]Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Knowledge Problems in Security Protocols: Going Beyond Subterm Convergent Theories. FSCD 2023: 30:1-30:19 - [c20]Veena Ravishankar, Andrew M. Marshall:
Teaching an Undergraduate 5G Technology and Security Course, and Its Outcomes. SIGCSE (2) 2023: 1405 - 2022
- [j4]Temur Kutsia, Andrew M. Marshall:
Preface. Ann. Math. Artif. Intell. 90(5): 453-454 (2022) - [c19]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Combined Hierarchical Matching: the Regular Case. FSCD 2022: 6:1-6:22 - [c18]Dalton Chichester, Wei Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Luis Rovira, Brandon Rozek:
CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms. GandALF 2022: 147-161 - 2021
- [c17]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Non-disjoint Combined Unification and Closure by Equational Paramodulation. FroCoS 2021: 25-42 - [c16]Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek:
Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems. FroCoS 2021: 253-270 - 2020
- [j3]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Computing knowledge in equational extensions of subterm convergent theories. Math. Struct. Comput. Sci. 30(6): 683-709 (2020) - [c15]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Terminating Non-disjoint Combined Unification. LOPSTR 2020: 113-130 - [c14]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Terminating Non-Disjoint Combined Unification (Extended Abstract). UNIF 2020: 7:1-7:6 - [c13]Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar, Brandon Rozek:
Algorithmic Problems in Synthesized Cryptosystems (Extended Abstract). UNIF 2020: 10:1-10:6 - [e1]Temur Kutsia, Andrew M. Marshall:
Proceedings of the 34th International Workshop on Unification, UNIF 2020, Linz, Austria, June 29, 2020. 2020 [contents]
2010 – 2019
- 2019
- [c12]Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar:
On Asymmetric Unification for the Theory of XOR with a Homomorphism. FroCos 2019: 297-312 - [c11]Ajay Kumar Eeralla, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Rule-Based Unification in Combined Theories and the Finite Variant Property. LATA 2019: 356-367 - [i1]Christopher Lynch, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Veena Ravishankar:
On Asymmetric Unification for the Theory of XOR with a Homomorphism. CoRR abs/1907.00227 (2019) - 2017
- [c10]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Notions of Knowledge in Combinations of Theories Sharing Constructors. CADE 2017: 60-76 - 2015
- [j2]Andrew M. Marshall, Catherine Meadows, Paliath Narendran:
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry. Log. Methods Comput. Sci. 11(2) (2015) - [c9]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Unification and Matching in Hierarchical Combinations of Syntactic Theories. FroCos 2015: 291-306 - 2014
- [c8]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:
On Asymmetric Unification and the Combination Problem in Disjoint Theories. FoSSaCS 2014: 274-288 - [c7]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:
On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract). UNIF 2014: 33-35 - [c6]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination of Matching Algorithms (Extended Abstract). UNIF 2014: 36-40 - 2013
- [c5]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination. CADE 2013: 249-266 - [c4]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination of Unication Algorithms (Extended Abstract). UNIF@RTA/TLCA 2013: 30-34 - 2012
- [c3]Andrew M. Marshall, Paliath Narendran:
New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants. IJCAR 2012: 408-422 - 2011
- [j1]Serdar Erbatur, Andrew M. Marshall, Deepak Kapur, Paliath Narendran:
Unification over Distributive Exponentiation (Sub)Theories. J. Autom. Lang. Comb. 16(2-4): 109-140 (2011) - 2010
- [c2]Deepak Kapur, Andrew M. Marshall, Paliath Narendran:
Unification modulo a partial theory of exponentiation. UNIF 2010: 12-23 - [c1]Paliath Narendran, Andrew M. Marshall, Bibhu Mahapatra:
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity. UNIF 2010: 54-63
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-09-21 23: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