Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard. - Vladik Kreinovich; Anatoly V. Lakeyev (Reliab. Comput., 1996)

On the computational complexity of the solution of linear systems with moduli. - Anatoly V. Lakeyev (Reliab. Comput., 1996)

NP-Hard Classes of Linear Algebraic Systems with Uncertainties. - Anatoly V. Lakeyev; Vladik Kreinovich (Reliab. Comput., 1997)

On Existence and Uniqueness of Solutions of Linear Algebraic Equations in Kaucher's Interval Arithmetic. - Anatoly V. Lakeyev (SCAN, 1998)

Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow. - Gerhard Heindl; Vladik Kreinovich; Anatoly V. Lakeyev (Reliab. Comput., 1998)

Gregory G. Menshikov has turned 70. - Boris S. Dobronets; Anatoly V. Lakeyev; Vyacheslav M. Nesterov; Sergey P. Shary; Yuri I. Shokin (Reliab. Comput., 2001)

On Unboundedness of Generalized Solution Sets for Interval Linear Systems. - Anatoly V. Lakeyev (Reliab. Comput., 2013)