Sergey Gorsky

Institute for System Dynamics and Control Theory

Papers

Total Citations

H-Index

About

Sergey Gorsky is a researcher whose work lies at the intersection of high-performance computing (HPC) and the theory of computation, with a primary focus on the Boolean satisfiability problem (SAT). His key research areas include parallel computing, algorithmic optimization, and the application of SAT solvers to real-world challenges. Gorsky’s major contribution is the development of HPC-based parallel software designed to efficiently solve applied Boolean satisfiability problems—a fundamental yet computationally intensive task in mathematical logic. By leveraging parallel architectures, his work significantly accelerates the solving of complex Boolean equation systems, which are critical in fields such as cryptography and qualitative research. His most-cited paper, "HPC-based parallel software for solving applied Boolean satisfiability problems" (2020), has garnered 5 citations, reflecting its niche but impactful contribution to the field. This work exemplifies his ability to bridge theoretical computer science with practical, high-performance solutions. Gorsky’s research is particularly valuable for students and researchers exploring the intersection of parallel algorithms and combinatorial problem-solving, offering a pathway to tackle computationally demanding tasks in logic and security.