Improved constructions of quantum automata. - Andris Ambainis; Nikolajs Nahimovs (Theor. Comput. Sci., 2009)

Nonlocal Quantum XOR Games for Large Number of Players. - Andris Ambainis; Dmitry Kravchenko; Nikolajs Nahimovs; Alexander Rivosh (TAMC, 2010)

Grover's Algorithm with Errors. - Andris Ambainis; Arturs Backurs; Nikolajs Nahimovs; Alexander Rivosh (MEMICS, 2012)

Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification. - Andris Ambainis; Arturs Backurs; Nikolajs Nahimovs; Raitis Ozols; Alexander Rivosh (TQC, 2012)

Exceptional Configurations of Quantum Walks with Grover's Coin. - Nikolajs Nahimovs; Alexander Rivosh (MEMICS, 2015)

Adjacent Vertices Can Be Hard to Find by Quantum Walks. - Nikolajs Nahimovs; Raqueline A. M. Santos (SOFSEM, 2017)

Grover's Search with Faults on Some Marked Elements. - Dmitry Kravchenko; Nikolajs Nahimovs; Alexander Rivosh (Int. J. Found. Comput. Sci., 2018)

Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations. - Nikolajs Nahimovs; Alexander Rivosh (Int. J. Found. Comput. Sci., 2018)

Lackadaisical Quantum Walks with Multiple Marked Vertices. - Nikolajs Nahimovs (SOFSEM, 2019)

Lackadaisical quantum walks on triangular and honeycomb 2D grids. - Nikolajs Nahimovs (CoRR, 2020)

Upperbounds on the probability of finding marked connected components using quantum walks. - Adam Glos; Nikolajs Nahimovs; Konstantin Balakirev; Kamil Khadiev (Quantum Inf. Process., 2021)