The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michael A. Taitslin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexei P. Stolboushkin, Michael A. Taitslin
    Linear vs. Order Contstrained Queries Over Rational Databases. [Citation Graph (4, 9)][DBLP]
    PODS, 1996, pp:17-27 [Conf]
  2. Alexei P. Stolboushkin, Michael A. Taitslin
    Finite Queries do not Have Effective Syntax. [Citation Graph (2, 6)][DBLP]
    PODS, 1995, pp:277-285 [Conf]
  3. Alexei P. Stolboushkin, Michael A. Taitslin
    Safe Stratified Datalog with Integer Order Does Not Have Syntax. [Citation Graph (1, 6)][DBLP]
    ACM Trans. Database Syst., 1998, v:23, n:1, pp:100-109 [Journal]
  4. Alexei P. Stolboushkin, Michael A. Taitslin
    Is First Order Contained in an Initial Segment of PTIME? [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:242-248 [Conf]
  5. Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin
    Generic Queries over Quasy-o-minimal Domains. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:21-32 [Conf]
  6. Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin
    Extended Order-Generic Queries. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:97, n:1-3, pp:85-125 [Journal]
  7. Anil Nerode, Michael A. Taitslin
    A Selection of Papers Presented at the Symposium "Logic at Tver '92" - Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:67, n:1-3, pp:1- [Journal]
  8. Michael A. Taitslin
    A general condition for collapse results. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:323-330 [Journal]
  9. Ilmir Kh. Musikaev, Michael A. Taitslin
    Limitations of the Program Memory and the Expressive Power of Dynamic Logics [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:103, n:2, pp:195-203 [Journal]
  10. Alexei P. Stolboushkin, Michael A. Taitslin
    Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:57, n:1, pp:48-55 [Journal]
  11. Alexei P. Stolboushkin, Michael A. Taitslin
    Finite Queries Do Not Have Effective Syntax. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:153, n:1, pp:99-116 [Journal]
  12. Ilmir Kh. Musikaev, Michael A. Taitslin
    Flat Backtracking Prolog for Databases: A Formal Semantics, the Computational Complexity and the Expressibility. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:1, pp:11-26 [Journal]
  13. Alexei P. Stolboushkin, Michael A. Taitslin
    The Comparison of the Expressive Power of First-Order Dynamic Logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:197-209 [Journal]

  14. Normalizable linear orders and generic computations in finite models. [Citation Graph (, )][DBLP]


Search in 0.047secs, Finished in 0.048secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002