A language and programming environment for high-performance parallel computing on heterogeneous networks. - Alexey L. Lastovetsky; Alexey Ya. Kalinov; I. N. Ledovskikh; Dmitry Arapov; Mikhail Posypkin (Program. Comput. Softw., 2000)

Compilation of Vector Statements of C[] Language for Architectures with Multilevel Memory Hierarchy. - Alexey Ya. Kalinov; Alexey L. Lastovetsky; Ilya Ledovskih; Mikhail Posypkin (Program. Comput. Softw., 2001)

Refined Description of the C[] Language. - Alexey Ya. Kalinov; Alexey L. Lastovetsky; Ilya Ledovskih; Mikhail Posypkin (Program. Comput. Softw., 2002)

Using ASM Specifications for Compiler Testing. - Alexey Ya. Kalinov; Alexander S. Kossatchev; Alexander K. Petrenko; Mikhail Posypkin; Vladimir Shishkov (Abstract State Machines, 2003)

Coverage-driven Automated Compiler Test Suite Generation. - Alexey Ya. Kalinov; Alexander S. Kossatchev; Alexander K. Petrenko; Mikhail Posypkin; Vladimir Shishkov (LDTA@ETAPS, 2003)

Automated Generation of Strictly Conforming Tests Based on Formal Specification of Dynamic Semantics of the Programming Language. - Alexander S. Kossatchev; P. Kutter; Mikhail Posypkin (Program. Comput. Softw., 2004)

An Implementation of the Matrix Multiplication Algorithm SUMMA in mpF. - Alexey Ya. Kalinov; Ilya Ledovskih; Mikhail Posypkin; Zakhar Levchenko; Vladimir Chizhov (PaCT, 2005)

A Fortran Evolution of mpC Parallel Programming Language. - Alexey Ya. Kalinov; Ilya Ledovskih; Mikhail Posypkin; Zakhar Levchenko; Vladimir Chizhov (PPAM, 2005)

Survey of compiler testing methods. - Alexander S. Kossatchev; Mikhail Posypkin (Program. Comput. Softw., 2005)

A High-Level Toolkit for Development of Distributed Scientific Applications. - Alexander P. Afanasiev; Oleg V. Sukhoroslov; Mikhail Posypkin (PaCT, 2007)

A framework for parallel large-scale global optimization. - Yuri Evtushenko; Mikhail Posypkin; Israel Sigal (Comput. Sci. Res. Dev., 2009)

A Comparative Study of Different Optimization Algorithms for Molecular Docking. - Alexander P. Afanasiev; Igor Oferkin; Mikhail Posypkin; Anton Rubtsov; Alexey V. Sulimov; Vladimir B. Sulimov (IWSG-Life, 2011)

Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System. - Alexander A. Semenov; Oleg Zaikin 002; Dmitry Bespalov; Mikhail Posypkin (PaCT, 2011)

Parallel algorithms for SAT in application to inversion problems of some discrete functions - Alexander A. Semenov; Oleg Zaikin 002; Dmitry Bespalov; Mikhail Posypkin (CoRR, 2011)

Using BOINC Desktop Grid to Solve Large Scale SAT Problems. - Mikhail Posypkin; Alexander A. Semenov; Oleg Zaikin 002 (Comput. Sci., 2012)

A deterministic approach to global box-constrained optimization. - Yuri Evtushenko; Mikhail Posypkin (Optim. Lett., 2013)

Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy. - Yuri G. Evtushenko; Mikhail Posypkin (Autom. Remote. Control., 2014)

Efficient Implementation of Branch-and-Bound Method on Desktop Grids. - Bo Tian; Mikhail Posypkin (Comput. Sci., 2014)

A deterministic algorithm for global multi-objective optimization. - Yu. G. Evtushenko; Mikhail Posypkin (Optim. Methods Softw., 2014)

Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method. - Roman Kolpakov; Mikhail Posypkin (CoRR, 2015)

Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering. - Roman M. Kolpakov; Mikhail Posypkin; Si Thu Thant Sin (Autom. Remote. Control., 2017)

Searching of gapped repeats and subrepetitions in a word. - Roman Kolpakov; Mikhail Podolskiy; Mikhail Posypkin; Nickolay Khrapov (J. Discrete Algorithms, 2017)

BOINC-Based Branch-and-Bound. - Andrei Ignatov; Mikhail Posypkin (RuSCDays, 2018)

Approximating a solution set of nonlinear inequalities. - Yuri Evtushenko; Mikhail Posypkin; Larisa Rybak; Andrei Turkin (J. Glob. Optim., 2018)

Preface. - Alexander V. Kononov; Alexander S. Strekalovsky; Mikhail Posypkin; Artem V. Pyatkin (J. Glob. Optim., 2020)

The scalability analysis of a parallel tree search algorithm. - Roman Kolpakov; Mikhail Posypkin (Optim. Lett., 2020)

Piecewise linear bounding functions in univariate global optimization. - Mikhail Posypkin; Alexander Usov; Oleg V. Khamisov (Soft Comput., 2020)

Techniques for Speeding up H-Core Protein Fitting. - Andrei Ignatov; Mikhail Posypkin (OPTIMA, 2021)

Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics. - Daniela Lera; Mikhail Posypkin; Yaroslav D. Sergeyev (Appl. Math. Comput., 2021)

Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. - Roman Kolpakov; Mikhail Posypkin (Open Comput. Sci., 2021)

Preface. - Milojica Jacimovic; Mikhail Yu. Khachay; Yury Kochetov 001; Mikhail Posypkin (Optim. Methods Softw., 2021)

Using Artificial Neural Network for Solving Inverse Kinematic Task of 2R Planar Robot-Manipulator. - Kamila Tanyrbergenova; Tolkyn Mirgalikyzy; Balgaisha Mukanova; Mikhail Posypkin (DTESI, 2022)

Robot Workspace Approximation with Modified Bicenetred Krawczyk Method. - Artem Maminov; Mikhail Posypkin (OPTIMA, 2022)

Bicentered Interval Newton Operator for Robot's Workspace Approximation. - Artem Maminov; Mikhail Posypkin (OPTIMA, 2023)

A two-phase heuristic algorithm for power-aware offline scheduling in IaaS clouds. - Andrei Ignatov; Irina Maslova; Mikhail Posypkin; W. Yang; J. Wu (J. Parallel Distributed Comput., 2023)

Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots. - Daniela Lera; Maria Chiara Nasso; Mikhail Posypkin; Yaroslav D. Sergeyev (J. Glob. Optim., 2024)

Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm. - Roman Kolpakov; Mikhail Posypkin (Concurr. Comput. Pract. Exp., 2024)