default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlex Gavryushkin
Person information
- affiliation: University of Otago, Dunedin, New Zealand
- affiliation: The University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j9]Lars Berling
, Remco Bouckaert, Alex Gavryushkin:
An Automated Convergence Diagnostic for Phylogenetic MCMC Analyses. IEEE ACM Trans. Comput. Biol. Bioinform. 21(6): 2246-2257 (2024)- 2023
- [j8]Jirí C. Moravec, Robert Lanfear, David L. Spector, Sarah D. Diermeier, Alex Gavryushkin:
Testing for Phylogenetic Signal in Single-Cell RNA-Seq Data. J. Comput. Biol. 30(4): 518-537 (2023) - 2022
- [j7]Kieran Elmes, Astra Heywood, Zhiyi Huang, Alex Gavryushkin:
A fast lasso-based method for inferring higher-order interactions. PLoS Comput. Biol. 18(12): 1010730 (2022) - 2017
- [j6]Clemens Zeidler, Gerald Weber, Alex Gavryushkin, Christof Lutteroth:
Tiling algebra for constraint-based layout editing. J. Log. Algebraic Methods Program. 89: 67-94 (2017) - 2016
- [j5]Alex Gavryushkin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals. Algorithmica 76(4): 1160-1180 (2016) - [j4]Alex Gavryushkin, Bakhadyr Khoussainov, Frank Stephan:
Reducibilities among equivalence relations induced by recursively enumerable structures. Theor. Comput. Sci. 612: 137-152 (2016) - 2015
- [j3]Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic algorithms for monotonic interval scheduling problem. Theor. Comput. Sci. 562: 227-242 (2015) - 2014
- [j2]Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
Graphs realised by r.e. equivalence relations. Ann. Pure Appl. Log. 165(7-8): 1263-1290 (2014) - 2012
- [j1]Alexander Gavryushkin:
On constructive models of theories with linear Rudin-Keisler ordering. J. Log. Comput. 22(4): 793-805 (2012)
Conference and Workshop Papers
- 2014
- [c3]Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic Interval Scheduling for Multiple Machines. ISAAC 2014: 235-246 - 2013
- [c2]Alexander Gavruskin, Bakhadyr Khoussainov:
On Decidable and Computable Models of Theories. CiE 2013: 200-209 - [c1]Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamising Interval Scheduling: The Monotonic Case. IWOCA 2013: 178-191
Informal and Other Publications
- 2021
- [i3]Lena Collienne, Kieran Elmes, Mareike Fischer, David Bryant, Alex Gavryushkin:
The Geometry of the space of Discrete Coalescent Trees. CoRR abs/2101.02751 (2021) - 2020
- [i2]Lena Collienne, Alex Gavryushkin:
Computing nearest neighbour interchange distances between ranked phylogenetic trees. CoRR abs/2007.12307 (2020) - 2014
- [i1]Alex Gavryushkin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic Algorithms for Interval Scheduling on a Single Machine. CoRR abs/1412.8005 (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-27 00:48 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:
