Boris Melnikov

Orcid: 0000-0002-6765-6800

According to our database1, Boris Melnikov authored at least 12 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Some General Heuristics in the Traveling Salesman Problem and the Problem of Reconstructing the DNA Chain Distance Matrix.
Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence, 2023

On the Study of All Semilattices on the Set of Covering Automata for the Waterloo Automaton.
Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence, 2023

2012
The State Minimization Problem for Nondeterministic Finite Automata: The Parallel Implementation of the Truncated Branch and Bound Method.
Proceedings of the Fifth International Symposium on Parallel Architectures, 2012

2010
Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems.
Fundam. Informaticae, 2010

Extended Nondeterministic Finite Automata.
Fundam. Informaticae, 2010

2009
A Multi-heuristic Algorithmic Skeleton for Hard Combinatorial Optimization Problems.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

2007
Some Competition Programming Problems as the Beginning of Artificial Intelligence.
Informatics Educ., 2007

2006
Some specific heuristics for situation clustering problems.
Proceedings of the ICSOFT 2006, 2006

Some Special Heuristics for Discrete Optimization Problems.
Proceedings of the ICEIS 2006, 2006

2002
A New Algorithm of Constructing the Basis Finite Automaton.
Informatica, 2002

2000
Some Grammatical Structures of Programming Languages as Simple Bracketed Languages.
Informatica, 2000

Commutation in Global Supermonoid of Free Monoids.
Informatica, 2000


  Loading...