Vladimir V. Gusev

Orcid: 0000-0002-2815-607X

Affiliations:
  • University of Liverpool, Leverhulme Centre for Functional Materials Design, UK
  • Université catholique de Louvain, Louvain-la-Neuve, Belgium (former)
  • Ural Federal University, Ekaterinburg, Russia (former)


According to our database1, Vladimir V. Gusev authored at least 43 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Establishing Deep InfoMax as an effective self-supervised learning methodology in materials informatics.
CoRR, 2024

HypBO: Accelerating Black-Box Scientific Experiments Using Experts' Hypotheses.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Graph-based Virtual Sensing from Sparse and Partial Multivariate Observations.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Cluster Exploration Using Informative Manifold Projections.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
Optimality guarantees for crystal structure prediction.
Nat., 2023

HypBO: Expert-Guided Chemist-in-the-Loop Bayesian Search for New Materials.
CoRR, 2023

Metrics for quantifying isotropy in high dimensional unsupervised clustering tasks in a materials context.
CoRR, 2023

First Order Methods for Geometric Optimization of Crystal Structures.
CoRR, 2023

The k-Centre Problem for Classes of Cyclic Words.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Time Series Kernels based on Nonlinear Vector AutoRegressive Delay Embeddings.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Random projections and Kernelised Leave One Cluster Out Cross-Validation: Universal baselines and evaluation tools for supervised machine learning for materials properties.
CoRR, 2022

Element selection for functional materials discovery by integrated machine learning of atomic contributions to properties.
CoRR, 2022

Faster Exploration of Some Temporal Graphs.
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

The Complexity of Periodic Energy Minimisation.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
On the Hardness of Energy Minimisation for Crystal Structure Prediction.
Fundam. Informaticae, 2021

The k-Centre Selection Problem for Multidimensional Necklaces.
CoRR, 2021

Ranking Bracelets in Polynomial Time.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
The K-Centre Problem for Necklaces.
CoRR, 2020

Crystal Structure Prediction via Oblivious Local Search.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

2019
On the Interplay Between Černý and Babai's Conjectures.
Int. J. Found. Comput. Sci., 2019

Computational Complexity of Synchronization under Regular Constraints.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

On Codeword Lengths Guaranteeing Synchronization.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018
Primitive Sets of Nonnegative Matrices and Synchronizing Automata.
SIAM J. Matrix Anal. Appl., 2018

Dynamics of the Independence Number and Automata Synchronization.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Personal Names Popularity Estimation and Its Application to Record Linkage.
Proceedings of the New Trends in Databases and Information Systems, 2018

2017
Generalized primitivity of labeled digraphs.
Electron. Notes Discret. Math., 2017

Sets of Stochastic Matrices with Converging Products: Bounds and Complexity.
CoRR, 2017

Attainable Values of Reset Thresholds.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On the Interplay Between Babai and Černý's Conjectures.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016
Approximation of Reset Thresholds with Greedy Algorithms.
Fundam. Informaticae, 2016

On Synchronizing Colorings and the Eigenvectors of Digraphs.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Reset Thresholds of Automata with Two Cycle Lengths.
Int. J. Found. Comput. Sci., 2015

Synchronizing automata and principal eigenvectors of the underlying digraphs.
CoRR, 2015

On the Number of Synchronizing Colorings of Digraphs.
Proceedings of the Implementation and Application of Automata, 2015

2014
Principal Ideal Languages and Synchronizing Automata.
Fundam. Informaticae, 2014

Synchronizing automata with random inputs.
CoRR, 2014

Synchronizing Automata with Random Inputs - (Short Paper).
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
Lower Bounds for the Length of Reset Words in Eulerian Automata.
Int. J. Found. Comput. Sci., 2013

Primitive digraphs with large exponents and slowly synchronizing automata
CoRR, 2013

Finitely Generated Ideal Languages and Synchronizing Automata.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
Synchronizing Automata of Bounded Rank.
Proceedings of the Implementation and Application of Automata, 2012

2011
On Non-complete Sets and Restivo's Conjecture.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Slowly Synchronizing Automata and Digraphs.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010


  Loading...