The Concurrency Complexity for the Horn Fragment of Linear Logic. - Sergey M. Dudakov (LFCS, 1997)

Monotone Expansion of Updates in Logical Databases. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Sergey M. Dudakov; Nicolas Spyratos (LPNMR, 1999)

On the Complexity of Perfect Models of Logic Programs. - Sergey M. Dudakov (Fundam. Informaticae, 1999)

On Complexity of Updates through Integrity Constraints. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Sergey M. Dudakov (Computational Logic, 2000)

Maximal Expansions of Database Updates. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Sergey M. Dudakov; Nicolas Spyratos (FoIKS, 2000)

Maximal state independent approximations to minimal real change. - Michael I. Dekhtyar; Alexander Ja. Dikovsky; Sergey M. Dudakov; Nicolas Spyratos (Ann. Math. Artif. Intell., 2001)

Isolation and Reducibility Properties and the Collapse Result. - Sergey M. Dudakov (CSR, 2006)

On Decidability of Regular Languages Theories. - Sergey M. Dudakov; Boris Karlov (CSR, 2019)

On Safety of Unary and Nonunary IFP Operators. - Sergey M. Dudakov (Autom. Control. Comput. Sci., 2019)

On Decidability of Theories of Regular Languages. - Sergey M. Dudakov; Boris Karlov (Theory Comput. Syst., 2021)