What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics. - Vladimir A. Uspensky; Alexei L. Semenov (Algorithms in Modern Mathematics and Computer Science, 1979)

Decidability of Monadic Theories. - Alexei L. Semenov (MFCS, 1984)

A simple detailed proof for Goedel's incompleteness theorem. - Alexei L. Semenov (Kybernetika, 1988)

Designing an asynchronous pipeline token ring interface. - Alexandre Yakovlev; Victor Varshavsky; Vyacheslav Marakhovsky; Alexei L. Semenov (ASYNC, 1995)

Verification of asynchronous circuits using Time Petri Net unfolding. - Alexei L. Semenov; Alexandre Yakovlev (DAC, 1996)

Modelling, analysis and synthesis of asynchronous control circuits using Petri nets. - Alexandre Yakovlev; Albert Koelmans; Alexei L. Semenov; D. J. Kinniment (Integr., 1996)

Partial order based approach to synthesis of speed-independent circuits. - Alexei L. Semenov; Alexandre Yakovlev; Enric Pastor; Marco A. Peña; Jordi Cortadella; Luciano Lavagno (ASYNC, 1997)

Synthesis of Speed-Independent Circuits from STG-Unfolding Segment. - Alexei L. Semenov; Alexandre Yakovlev; Enric Pastor; Marco A. Peña; Jordi Cortadella (DAC, 1997)

Designing an asynchronous processor using Petri nets. - Alexei L. Semenov; Albert Koelmans; Lee Lloyd; Alexandre Yakovlev (IEEE Micro, 1997)

Unfolding and Finite Prefix for Nets with Read Arcs. - Walter Vogler; Alexei L. Semenov; Alexandre Yakovlev (CONCUR, 1998)

Mathematical Metaphysics of Randomness. - Andrei A. Muchnik; Alexei L. Semenov; Vladimir A. Uspensky (Theor. Comput. Sci., 1998)

Technology in transforming education. - Alexei L. Semenov (Communications and Networking in Education, 1999)

Multi-conditional Descriptions and Codes in Kolmogorov Complexity - Andrei A. Muchnik; Alexei L. Semenov (Electron. Colloquium Comput. Complex., 2000)

On the Role of the Law of Large Numbers in the Theory of Randomness. - Andrei A. Muchnik; Alexei L. Semenov (Probl. Inf. Transm., 2003)

Almost periodic sequences. - Andrei A. Muchnik; Alexei L. Semenov; Maxim Ushakov (Theor. Comput. Sci., 2003)

Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets. - Andrej Muchnik; Alexei L. Semenov (Ann. Pure Appl. Log., 2006)

Sequences close to periodic - Andrei A. Muchnik; Yuri Pritykin; Alexei L. Semenov (CoRR, 2009)

The Lattice of Definability. Origins, Recent Developments, and Further Directions. - Alexei L. Semenov; Sergey Soprunov; Vladimir A. Uspensky (CSR, 2014)

A combinatorial version of the Svenonius theorem on definability. - Alexei L. Semenov; Sergey Soprunov (Log. J. IGPL, 2015)

Smart Learning in the 21st Century: Advancing Constructionism Across Three Digital Epochs. - Ilya Levin; Alexei L. Semenov; Mikael Gorsky (CoRR, 2025)