Skip to main content
What types of page to search?

Alternatively use our A-Z index.

Publications

What type of publication do you want to show?

2025

Establishing Deep InfoMax as an effective self-supervised learning methodology in materials informatics

Moran, M., Gaultois, M. W., Gusev, V. V., Antypov, D., & Rosseinsky, M. J. (n.d.). Establishing Deep InfoMax as an effective self-supervised learning methodology in materials informatics. Digital Discovery, 4(3), 790-811. doi:10.1039/d4dd00202d

DOI
10.1039/d4dd00202d
Journal article

2024

2023

2022

Random projections and kernelised leave one cluster out cross validation: universal baselines and evaluation tools for supervised machine learning of material properties

Durdy, S., Gaultois, M. W., Gusev, V. V., Bollegala, D., & Rosseinsky, M. J. (n.d.). Random projections and kernelised leave one cluster out cross validation: universal baselines and evaluation tools for supervised machine learning of material properties. Digital Discovery, 1(6), 763-778. doi:10.1039/d2dd00039c

DOI
10.1039/d2dd00039c
Journal article

2021

Ranking Bracelets in Polynomial Time

Adamson, D., Deligkas, A., Gusev, V. V., & Potapov, I. (2021). Ranking Bracelets in Polynomial Time. Retrieved from http://arxiv.org/abs/2104.04324v1

Conference Paper

2020

A mobile robotic chemist

Burger, B., Maffettone, P. M., Gusev, V. V., Aitchison, C. M., Bai, Y., Wang, X., . . . Cooper, A. I. (2020). A mobile robotic chemist. Nature, 583(7815), 237-241. doi:10.1038/s41586-020-2442-2

DOI
10.1038/s41586-020-2442-2
Journal article

2019

Computational complexity of synchronization under regular constraints

Fernau, H., Gusev, V. V., Hoffmann, S., Holzer, M., Volkov, M. V., & Wolf, P. (2019). Computational complexity of synchronization under regular constraints. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 138. doi:10.4230/LIPIcs.MFCS.2019.63

DOI
10.4230/LIPIcs.MFCS.2019.63
Conference Paper

On Codeword Lengths Guaranteeing Synchronization

Gusev, V. V., & Pribavkina, E. V. (2019). On Codeword Lengths Guaranteeing Synchronization. In Unknown Conference (pp. 207-216). Springer International Publishing. doi:10.1007/978-3-030-28796-2_16

DOI
10.1007/978-3-030-28796-2_16
Conference Paper

On the Interplay Between Černý and Babai’s Conjectures

Gonze, F., Gusev, V. V., Jungers, R. M., Gerencsér, B., & Volkov, M. V. (2019). On the Interplay Between Černý and Babai’s Conjectures. International Journal of Foundations of Computer Science, 30(01), 93-114. doi:10.1142/s0129054119400057

DOI
10.1142/s0129054119400057
Journal article

2018

Personal Names Popularity Estimation and Its Application to Record Linkage

Zhagorina, K., Braslavski, P., & Gusev, V. (2018). Personal Names Popularity Estimation and Its Application to Record Linkage. In NEW TRENDS IN DATABASES AND INFORMATION SYSTEMS, ADBIS 2018 Vol. 909 (pp. 71-79). doi:10.1007/978-3-030-00063-9_9

DOI
10.1007/978-3-030-00063-9_9
Conference Paper

Dynamics of the Independence Number and Automata Synchronization

Gusev, V. V., Jungers, R. M., & Průša, D. (2018). Dynamics of the Independence Number and Automata Synchronization. In Unknown Conference (pp. 379-391). Springer International Publishing. doi:10.1007/978-3-319-98654-8_31

DOI
10.1007/978-3-319-98654-8_31
Conference Paper

2017

Attainable values of reset thresholds

Dzyga, M., Ferens, R., Gusev, V. V., & Szykula, M. (2017). Attainable values of reset thresholds. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 83. doi:10.4230/LIPIcs.MFCS.2017.40

DOI
10.4230/LIPIcs.MFCS.2017.40
Conference Paper

Generalized primitivity of labeled digraphs

Gusev, V. V., Jungers, R. M., & Pribavkina, E. V. (2017). Generalized primitivity of labeled digraphs. Electronic Notes in Discrete Mathematics, 61, 549-555. doi:10.1016/j.endm.2017.07.006

DOI
10.1016/j.endm.2017.07.006
Journal article

2016

Approximation of Reset Thresholds with Greedy Algorithms

Ananichev, D. S., & Gusev, V. V. (2016). Approximation of Reset Thresholds with Greedy Algorithms. In J. Karhumäki, V. Mazalov, & Y. Matiyasevich (Eds.), Fundamenta Informaticae Vol. 145 (pp. 221-227). SAGE Publications. doi:10.3233/fi-2016-1357

DOI
10.3233/fi-2016-1357
Conference Paper

On synchronizing colorings and the eigenvectors of digraphs

Gusev, V. V., & Pribavkina, E. V. (2016). On synchronizing colorings and the eigenvectors of digraphs. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 58. doi:10.4230/LIPIcs.MFCS.2016.48

DOI
10.4230/LIPIcs.MFCS.2016.48
Conference Paper

2015

Reset Thresholds of Automata with Two Cycle Lengths

Gusev, V. V., & Pribavkina, E. V. (2015). Reset Thresholds of Automata with Two Cycle Lengths. In International Journal of Foundations of Computer Science Vol. 26 (pp. 953-966). World Scientific Pub Co Pte Lt. doi:10.1142/s0129054115400080

DOI
10.1142/s0129054115400080
Conference Paper

On the Number of Synchronizing Colorings of Digraphs

Gusev, V. V., & Szykuła, M. (2015). On the Number of Synchronizing Colorings of Digraphs. In Implementation and Application of Automata, 9223(1), 7-139. Retrieved from http://dx.doi.org/10.1007/978-3-319-22360-5_11

Journal article

2014

Synchronizing Automata with Random Inputs

Gusev, V. V. (2014). Synchronizing Automata with Random Inputs. In Unknown Conference (pp. 68-75). Springer International Publishing. doi:10.1007/978-3-319-09698-8_7

DOI
10.1007/978-3-319-09698-8_7
Conference Paper

2013

LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA

GUSEV, V. V. (2013). LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA. International Journal of Foundations of Computer Science, 24(02), 251-262. doi:10.1142/s0129054113400108

DOI
10.1142/s0129054113400108
Journal article

Finitely Generated Ideal Languages and Synchronizing Automata

Gusev, V. V., Maslennikova, M. I., & Pribavkina, E. V. (2013). Finitely Generated Ideal Languages and Synchronizing Automata. In Lecture Notes in Computer Science (pp. 143-153). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40579-2_16

DOI
10.1007/978-3-642-40579-2_16
Chapter

2012

Synchronizing Automata of Bounded Rank

Gusev, V. V. (2012). Synchronizing Automata of Bounded Rank. In Lecture Notes in Computer Science (pp. 171-179). Springer Berlin Heidelberg. doi:10.1007/978-3-642-31606-7_15

DOI
10.1007/978-3-642-31606-7_15
Chapter

2011

Lower Bounds for the Length of Reset Words in Eulerian Automata

Gusev, V. V. (2011). Lower Bounds for the Length of Reset Words in Eulerian Automata. In Unknown Conference (pp. 180-190). Springer Berlin Heidelberg. doi:10.1007/978-3-642-24288-5_16

DOI
10.1007/978-3-642-24288-5_16
Conference Paper

On Non-complete Sets and Restivo’s Conjecture

Gusev, V. V., & Pribavkina, E. V. (2011). On Non-complete Sets and Restivo’s Conjecture. In Lecture Notes in Computer Science (pp. 239-250). Springer Berlin Heidelberg. doi:10.1007/978-3-642-22321-1_21

DOI
10.1007/978-3-642-22321-1_21
Chapter

2010

Slowly synchronizing automata and digraphs

Ananichev, D., Gusev, V., & Volkov, M. (2010). Slowly synchronizing automata and digraphs. In Unknown Book (Vol. 6281 LNCS, pp. 55-65). doi:10.1007/978-3-642-15155-2_7

DOI
10.1007/978-3-642-15155-2_7
Chapter

Slowly synchronizing automata and digraphs

Ananichev, D. S., Gusev, V. V., & Volkov, M. V. (2010). Slowly synchronizing automata and digraphs. In: A. Kucera, P. Hlineny (eds.), Mathematical Foundations of Computer Science [Lect. Notes Comp. Sci., 6281], Springer-Verlag, 2010, 55-65. Retrieved from http://dx.doi.org/10.1007/978-3-642-15155-2_7

Journal article