default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoss Mawhorter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Ross Mawhorter
, Adam M. Smith:
Comprehensive and Instantly Responsive Player Assistance using Binary Decision Diagrams. FDG 2024: 21- [c7]Abdelrahman Madkour, Ross Mawhorter, Stacy Marsella, Adam M. Smith, Steven Holtzen:
Ahead-of-time Compilation for Diverse Samplers of Constrained Design Spaces. FDG 2024: 54 - 2023
- [j7]Nuo Liu, Tonatiuh A. Gonzalez, Jacob Fischer, Chan Hong, Michelle Johnson, Ross Mawhorter, Fabrizia Mugnatto, Rachael Soh, Shifa Somji, Joseph S. Wirth, Ran Libeskind-Hadas, Eliot C. Bush:
xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes. BMC Bioinform. 24(1): 295 (2023) - [c6]Ross Mawhorter, Adam M. Smith:
Automated Testing in Super Metroid with Abstraction-Guided Exploration. FDG 2023: 21:1-21:9 - 2022
- [c5]Samuel Shields, Ross Mawhorter, Edward F. Melcer, Michael Mateas:
Searching for Balanced 2D Brawler Games: Successes and Failures of Automated Evaluation. AIIDE 2022: 189-198 - [c4]Ross Mawhorter, Peter A. Mawhorter, Adam M. Smith:
The Randomizer Community does Procedural Content Generation Research. FDG 2022: 68:1-68:3 - 2021
- [j6]Santi Santichaivekin, Qing Yang, Jingyi Liu, Ross Mawhorter, Justin Jiang, Trenton Wesley, Yi-Chieh Wu, Ran Libeskind-Hadas:
eMPRess: a systematic cophylogeny reconciliation tool. Bioinform. 37(16): 2481-2482 (2021) - [j5]Jingyi Liu, Ross Mawhorter, Nuo Liu, Santi Santichaivekin, Eliot C. Bush, Ran Libeskind-Hadas:
Maximum parsimony reconciliation in the DTLOR model. BMC Bioinform. 22(10): 394 (2021) - [j4]Haoxing Du, Yi Sheng Ong, Marina Knittel, Ross Mawhorter, Nuo Liu, Gianluca Gross, Reiko Tojo, Ran Libeskind-Hadas, Yi-Chieh Wu:
Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2144-2156 (2021) - [c3]Ross Mawhorter, Batu Aytemiz, Isaac Karth, Adam M. Smith:
Content Reinjection for Super Metroid. AIIDE 2021: 172-178 - [c2]Ross Mawhorter, Adam M. Smith:
Softlock Detection for Super Metroid with Computation Tree Logic. FDG 2021: 7:1-7:10 - [c1]Isaac Karth, Batu Aytemiz, Ross Mawhorter, Adam M. Smith:
Neurosymbolic Map Generation with VQ-VAE and WFC. FDG 2021: 43:1-43:6
2010 – 2019
- 2019
- [j3]Ross Mawhorter, Ran Libeskind-Hadas:
Hierarchical clustering of maximum parsimony reconciliations. BMC Bioinform. 20(1): 612:1-612:12 (2019) - [j2]Santi Santichaivekin, Ross Mawhorter, Ran Libeskind-Hadas:
An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model. BMC Bioinform. 20-S(20): 636 (2019) - [j1]Ross Mawhorter, Nuo Liu, Ran Libeskind-Hadas, Yi-Chieh Wu:
Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model. BMC Bioinform. 20-S(20): 639 (2019)
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-10-07 21:21 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:
