default search action

combined dblp search
author search
venue search
publication search

ask others

Evgeniy Talay

Evgeniy Petrovich Talay

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Informal and Other Publications

see FAQ

What is the meaning of the colors in the publication lists?

2022
[i3]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2212-02016
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2212-02016
Mikhail V. Saramud, Evgeniy Spirin, Evgeniy Petrovich Talay, Iakov Pikalov:
Formulation of problems of combinatorial optimization for solving problems of management and planning of cloud production. CoRR abs/2212.02016 (2022)
2021
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-2109-05856
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2109-05856
Maksim V. Kubrikov, Mikhail V. Saramud, Angelina Petetskaya, Evgeniy Talay:
Creation and Verification of Digital Twins in Cloud Production. CoRR abs/2109.05856 (2021)
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-2112-13846
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2112-13846
Maksim Viktorovich Kubrikov, Mikhail Vladimirovich Saramud, Ivan Alekseevich Paulin, Evgeniy Petrovich Talay:
Algorithm for recognizing the contour of a honeycomb block. CoRR abs/2112.13846 (2021)

Coauthor Index

see FAQ

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.