Bindweeds or random walks in random environments on multiplexed trees and their asympotics. - Mikhail Menshikov; Dimitri Petritis; Serguei Popov 001 (DRW, 2003)

Frogs and some other interacting random walks models. - Serguei Yu. Popov 001 (DRW, 2003)

Random Bulgarian solitaire. - Serguei Popov 001 (Random Struct. Algorithms, 2005)

Evaluation of uncertainties in solid-aqueous-gas chemical equilibrium calculations. - Alexey A. Novoselov; Serguei Popov 001; Carlos Roberto de Souza Filho (Comput. Geosci., 2015)

On a decentralized trustless pseudo-random number generation algorithm. - Serguei Popov 001 (IACR Cryptol. ePrint Arch., 2016)

A Probabilistic Analysis of the Nxt Forging Algorithm. - Serguei Popov 001 (Ledger, 2016)

BitFlip: A Randomness-Rich Cipher. - Gideon Samid; Serguei Popov 001 (IACR Cryptol. ePrint Arch., 2017)

Equilibria in the tangle. - Serguei Popov 001; Olivia Saa; Paulo Finardi (Comput. Ind. Eng., 2019)

On fast probabilistic consensus in the Byzantine setting. - Serguei Popov 001 (CoRR, 2019)

FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures. - Serguei Popov 001; William J. Buchanan (J. Parallel Distributed Comput., 2021)

Voting-based probabilistic consensuses and their applications in distributed ledgers. - Serguei Popov 001; Sebastian Müller 006 (Ann. des Télécommunications, 2022)

FPCS: Solving n-Spends on a UTXO-Based DLT. - Rafael Cizeski Nitchai; Serguei Popov 001; Sebastian Müller 006 (BLOCKCHAIN, 2023)

Security threshold for FPCS on star graphs. - Rafael Cizeski Nitchai; Serguei Popov 001; Sebastian Müller 006; Olivia Saa (BRAINS, 2024)

On transience of $ mathrm{M}/ mathrm{G}/ infty$ queues. - Serguei Popov 001 (J. Appl. Probab., 2025)

Humanity's Last Exam. - Long Phan; Alice Gatti; Ziwen Han; Nathaniel Li; Josephina Hu; Hugh Zhang; Sean Shi; Michael Choi; Anish Agrawal; Arnav Chopra; Adam Khoja; Ryan Kim; et al. (CoRR, 2025)