default search action
Mikhail Posypkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Roman Kolpakov
, Mikhail Posypkin:
Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm. Concurr. Comput. Pract. Exp. 36(18) (2024) - [j22]Daniela Lera, Maria Chiara Nasso, Mikhail Posypkin, Yaroslav D. Sergeyev
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots. J. Glob. Optim. 89(2): 415-434 (2024) - 2023
- [j21]Andrei Ignatov
A two-phase heuristic algorithm for power-aware offline scheduling in IaaS clouds. J. Parallel Distributed Comput. 178: 1-10 (2023) - [c13]Artem Maminov
Bicentered Interval Newton Operator for Robot's Workspace Approximation. OPTIMA 2023: 344-356 - 2022
- [c12]Kamila Tanyrbergenova, Tolkyn Mirgalikyzy, Balgaisha Mukanova, Mikhail Posypkin:
Using Artificial Neural Network for Solving Inverse Kinematic Task of 2R Planar Robot-Manipulator. DTESI 2022 - [c11]Artem Maminov
Robot Workspace Approximation with Modified Bicenetred Krawczyk Method. OPTIMA 2022: 238-249 - 2021
- [j20]Daniela Lera, Mikhail Posypkin, Yaroslav D. Sergeyev:
Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics. Appl. Math. Comput. 390: 125660 (2021) - [j19]Roman Kolpakov
Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. Open Comput. Sci. 11(1): 116-126 (2021) - [j18]Milojica Jacimovic, Mikhail Yu. Khachay
Preface. Optim. Methods Softw. 36(4): 671 (2021) - [c10]Andrei Ignatov
Techniques for Speeding up H-Core Protein Fitting. OPTIMA 2021: 336-350 - 2020
- [j17]Alexander V. Kononov, Alexander S. Strekalovsky, Mikhail Posypkin, Artem V. Pyatkin:
Preface. J. Glob. Optim. 76(3): 453-454 (2020) - [j16]Roman Kolpakov
The scalability analysis of a parallel tree search algorithm. Optim. Lett. 14(8): 2211-2226 (2020) - [j15]Mikhail Posypkin
Piecewise linear bounding functions in univariate global optimization. Soft Comput. 24(23): 17631-17647 (2020)
2010 – 2019
- 2018
- [j14]Yuri Evtushenko, Mikhail Posypkin
Approximating a solution set of nonlinear inequalities. J. Glob. Optim. 71(1): 129-145 (2018) - [c9]Andrei Ignatov
BOINC-Based Branch-and-Bound. RuSCDays 2018: 511-522 - 2017
- [j13]Roman M. Kolpakov
Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering. Autom. Remote. Control. 78(3): 463-474 (2017) - [j12]Roman Kolpakov
Searching of gapped repeats and subrepetitions in a word. J. Discrete Algorithms 46-47: 1-15 (2017) - 2015
- [i3]Roman Kolpakov, Mikhail Posypkin:
Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method. CoRR abs/1506.06284 (2015) - 2014
- [j11]Yuri G. Evtushenko
Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy. Autom. Remote. Control. 75(6): 1025-1040 (2014) - [j10]Bo Tian, Mikhail Posypkin:
Efficient Implementation of Branch-and-Bound Method on Desktop Grids. Comput. Sci. 15(3): 239-252 (2014) - [j9]Yu. G. Evtushenko
A deterministic algorithm for global multi-objective optimization. Optim. Methods Softw. 29(5): 1005-1019 (2014) - [c8]Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov:
Searching of Gapped Repeats and Subrepetitions in a Word. CPM 2014: 212-221 - 2013
- [j8]Yuri Evtushenko
A deterministic approach to global box-constrained optimization. Optim. Lett. 7(4): 819-829 (2013) - [i2]Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov:
Searching of gapped repeats and subrepetitions in a word. CoRR abs/1309.4055 (2013) - 2012
- [j7]Mikhail Posypkin, Alexander A. Semenov, Oleg Zaikin:
Using BOINC Desktop Grid to Solve Large Scale SAT Problems. Comput. Sci. 13(1): 25-34 (2012) - 2011
- [c7]Alexander P. Afanasiev, Igor Oferkin, Mikhail Posypkin, Anton Rubtsov, Alexey V. Sulimov, Vladimir B. Sulimov:
A Comparative Study of Different Optimization Algorithms for Molecular Docking. IWSG-Life 2011 - [c6]Alexander A. Semenov
Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System. PaCT 2011: 473-483 - [i1]Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin:
Parallel algorithms for SAT in application to inversion problems of some discrete functions. CoRR abs/1102.3563 (2011)
2000 – 2009
- 2009
- [j6]Yuri Evtushenko
A framework for parallel large-scale global optimization. Comput. Sci. Res. Dev. 23(3-4): 211-215 (2009) - 2007
- [c5]Alexander P. Afanasiev, Oleg V. Sukhoroslov, Mikhail Posypkin:
A High-Level Toolkit for Development of Distributed Scientific Applications. PaCT 2007: 103-110 - 2005
- [j5]Alexander S. Kossatchev, Mikhail Posypkin:
Survey of compiler testing methods. Program. Comput. Softw. 31(1): 10-19 (2005) - [c4]Alexey Ya. Kalinov, Ilya Ledovskih, Mikhail Posypkin, Zakhar Levchenko, Vladimir Chizhov:
An Implementation of the Matrix Multiplication Algorithm SUMMA in mpF. PaCT 2005: 420-432 - [c3]Alexey Ya. Kalinov, Ilya Ledovskih, Mikhail Posypkin
A Fortran Evolution of mpC Parallel Programming Language. PPAM 2005: 936-943 - 2004
- [j4]Alexander S. Kossatchev
Automated Generation of Strictly Conforming Tests Based on Formal Specification of Dynamic Semantics of the Programming Language. Program. Comput. Softw. 30(4): 218-229 (2004) - 2003
- [c2]Alexey Ya. Kalinov, Alexander S. Kossatchev, Alexander K. Petrenko, Mikhail Posypkin, Vladimir Shishkov:
Using ASM Specifications for Compiler Testing. Abstract State Machines 2003: 415 - [c1]Alexey Ya. Kalinov, Alexander S. Kossatchev
Coverage-driven Automated Compiler Test Suite Generation. LDTA@ETAPS 2003: 500-514 - 2002
- [j3]Alexey Ya. Kalinov, Alexey L. Lastovetsky, Ilya Ledovskih, Mikhail Posypkin:
Refined Description of the C[] Language. Program. Comput. Softw. 28(6): 333-341 (2002) - 2001
- [j2]Alexey Ya. Kalinov, Alexey L. Lastovetsky
Compilation of Vector Statements of C[] Language for Architectures with Multilevel Memory Hierarchy. Program. Comput. Softw. 27(3): 111-122 (2001) - 2000
- [j1]Alexey L. Lastovetsky
A language and programming environment for high-performance parallel computing on heterogeneous networks. Program. Comput. Softw. 26(4): 216-236 (2000)
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 2024-08-23 19:24 CEST 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: