Approximation complexity of additive random fields. - M. A. Lifshits; Marguerite Zani (J. Complex., 2008)

Maximal Intersection Queries in Randomized Input Models. - Benjamin Hoffmann; Mikhail Lifshits; Yury Lifshits; Dirk Nowotka (Theory Comput. Syst., 2010)

Average case tractability of non-homogeneous tensor product problems. - M. A. Lifshits; Anargyros Papageorgiou; Henryk Wozniakowski (J. Complex., 2012)

Approximation of additive random fields based on standard information: Average case and probabilistic settings. - Mikhail Lifshits; Marguerite Zani (J. Complex., 2015)

How complex is a random picture? - Frank Aurzada; Mikhail Lifshits (J. Complex., 2019)

Analysis of Time- versus Event-Triggered Consensus for a Single-Integrator Multi-Agent System*. - David Meister; Frank Aurzada; Mikhail A. Lifshits; Frank Allgöwer (CDC, 2022)

Analysis of Time- versus Event-Triggered Consensus for a Single-Integrator Multi-Agent System. - David Meister; Frank Aurzada; Mikhail Lifshits; Frank Allgöwer (CoRR, 2022)

Time- versus Event-Triggered Consensus of a Single-Integrator Multi-Agent System. - David Meister; Frank Aurzada; Mikhail A. Lifshits; Frank Allgöwer (CoRR, 2023)

Large deviations of Poisson Telecom processes. - Mikhail Lifshits; Sergei Nikitin (J. Appl. Probab., 2023)

Extrema of a multinomial assignment process. - Mikhail Lifshits; Gilles Mordant (J. Appl. Probab., 2024)