Sergey M. Dudakov

Orcid: 0000-0003-2659-265X

According to our database1, Sergey M. Dudakov authored at least 10 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On Decidability of Theories of Regular Languages.
Theory Comput. Syst., 2021

2019
On Safety of Unary and Nonunary IFP Operators.
Autom. Control. Comput. Sci., 2019

On Decidability of Regular Languages Theories.
Proceedings of the Computer Science - Theory and Applications, 2019

2006
Isolation and Reducibility Properties and the Collapse Result.
Proceedings of the Computer Science, 2006

2001
Maximal state independent approximations to minimal real change.
Ann. Math. Artif. Intell., 2001

2000
Maximal Expansions of Database Updates.
Proceedings of the Foundations of Information and Knowledge Systems, 2000

On Complexity of Updates through Integrity Constraints.
Proceedings of the Computational Logic, 2000

1999
On the Complexity of Perfect Models of Logic Programs.
Fundam. Informaticae, 1999

Monotone Expansion of Updates in Logical Databases.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

1997
The Concurrency Complexity for the Horn Fragment of Linear Logic.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997


  Loading...