Home address
40 Dmitry Donskoi, apt. 2, Tver, 170006 Russia
E-mail
p000101@tversu.ru
Home phone
(+7 4822) 773620
Russian version
Computer Science Seminar
Personal information (PostScript format, English)
Personal information (Russian)
Publications (PostScript format, English)
Publications (PostScript format, Russian)
Publications (English)
PAPERS (PDF format, Russian)
Michael Taitslin
Comparison of Expressive Power of Some Query Languages for Databases.
Proceedings of the Steklov Institute of Mathematics,
Vol. 274, 2011, pages 297–313
Sergey Dudakov, Michael Taitslin
The collapse results for database query languages.
Uspehi matematicheskih nauk
, 61(2): 3 - 66, 2006
PAPERS (PostScript format, Russian)
M.A.Taitslin
An example of a problem from PTIME and not from NLogSpace.
Proceedings of Tver State University
series "Applied Mathematics", issue 2
Tver State University, Tver, 2005, pages 5- 22
M.A.Taitslin
Restricted pseudo-finite homogeneity and restricted isolation.
Proceedings of Tver State University
series "Applied Mathematics", issue 1
Tver State University, Tver, 2003, pages 5 - 15
M.A. Taitslin.
Translation results in database theory.
Complex systems: data processing, simulation, and optimization
Tver State University, Tver, 2002, pages 5 - 23
PAPERS (PDF format, English)
Michael Taitslin
Comparison of Expressive Power of Some Query Languages for Databases.
Proceedings of the Steklov Institute of Mathematics,
Vol. 274, 2011, pages 273–288
Michael Taitslin
Isomorphisms and strong finite projective classes of commutative semigroups.
Tributes, Volume 13, Proofs, Categories and Computations,
Essays in Honor of Grigori Mints,
Soloman Feferman and Wilfried Sieg, editors,
College Publications
, 2010, pages 243 - 250
Sergey Dudakov, Michael Taitslin
The collapse results for query languages in database theory.
Russian Mathematical Survey
, 61(2): 195 - 253, 2006
PAPERS (PostScript format, English)
O.V. Belegradek, A.P. Stolboushkin, and M.A. Taitslin.
Extended order-generic queries.
Annals of Pure and Applied Logic
, 97(1-3):85-125, 1999
M.A. Taitslin.
A general condition for collapse results.
Annals of Pure and Applied Logic
, 113(1-3):323--330, 2001
O.V. Belegradek, A.P. Stolboushkin, and M.A. Taitslin.
On problems of databases over a fixed infinite universe.
Logic, Algebra, and Computer Science. Helena Rasiowa in Memoriam
,
Banach Center Publications, vol.46, pages 23-62.
Banach Center, Institute of Mathematics, Polish Academy of Science, 1999
A.P. Stolboushkin and M.A. Taitslin.
Normalizable linear orders and generic computations in finite models.
Archive for Mathematical Logic
, 38(4):257-271, 1999
A.P. Stolboushkin and M.A. Taitslin.
Finite Queries do not Have Effective Syntax.
Information and Computation
,153(1):99-116, 1999
A.P. Stolboushkin and M.A. Taitslin.
Safe stratified datalog with integer order does not have syntax.
ACM Transactions on Database Systems
, 23(1):100-109, 1998
Presented TALKS (PostScript format, English)
Novikov conference. Collapse results in database theory
Finite Model Theory Workshop. Bedlewo, Poland
Collapse results in database theory
NLogSpace < PTIME
Presented TALKS (HTML format, English)
Finite Model Theory Workshop. Bedlewo, Poland
Collapse results in database theory
Send e-mail
Homepages
Last updated: May 9, 2009