The SCEAS System
Navigation Menu

Search the dblp DataBase


Vladimir Yu. Sazonov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vladimir Yu. Sazonov
    A Logical Approach to the Problem "P=NP?". [Citation Graph (3, 0)][DBLP]
    MFCS, 1980, pp:562-575 [Conf]
  2. Vladimir Yu. Sazonov
    Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:119, n:1, pp:187-214 [Journal]
  3. Vladimir Yu. Sazonov
    A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability. [Citation Graph (1, 0)][DBLP]
    CSL, 1994, pp:527-541 [Conf]
  4. Vladimir Yu. Sazonov
    On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation. [Citation Graph (1, 0)][DBLP]
    MFCS, 1981, pp:483-490 [Conf]
  5. Vladimir Yu. Sazonov
    Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2001, pp:378-394 [Conf]
  6. Vladimir Yu. Sazonov
    A Category of Many-Sorted Algebraic Theories Which is Equivalent to the Category of Categories with Finite Products. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:230-244 [Conf]
  7. Vladimir Yu. Sazonov
    Bounded Set Theory and Polynominal Computability. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:391-395 [Conf]
  8. Alexander Leontjev, Vladimir Yu. Sazonov
    Capturing LOGSPACE over Hereditarily-Finite Sets. [Citation Graph (0, 0)][DBLP]
    FoIKS, 2000, pp:156-175 [Conf]
  9. Vladimir Yu. Sazonov, Alexei Lisitsa
    Delta-Languages for Sets and sub-PTIME Graphs Transformers. [Citation Graph (0, 13)][DBLP]
    ICDT, 1995, pp:125-138 [Conf]
  10. Alexei Lisitsa, Vladimir Yu. Sazonov
    Bounded Hyperset Theory and Web-like Data Bases. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:172-185 [Conf]
  11. Vladimir Yu. Sazonov, Andrei Voronkov
    A Construction of Typed Lambda Models Related to Feasible Computability. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:301-312 [Conf]
  12. Vladimir Yu. Sazonov
    Sequentially and parallelly computable functionals. [Citation Graph (0, 0)][DBLP]
    Lambda-Calculus and Computer Science Theory, 1975, pp:312-318 [Conf]
  13. Vladimir Yu. Sazonov
    On Feasible Numbers. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:30-51 [Conf]
  14. Alexei Lisitsa, Vladimir Yu. Sazonov
    On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:178-188 [Conf]
  15. Vladimir Yu. Sazonov
    Degrees of Parallelism in Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:517-523 [Conf]
  16. Alexander Leontjev, Vladimir Yu. Sazonov
    D: Set-theoretic query language capturing LOGSPACE. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2001, v:33, n:2-4, pp:309-345 [Journal]
  17. Vladimir Yu. Sazonov
    Polynomial Computability and Recursivity in Finite Domains. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1980, v:16, n:7, pp:319-323 [Journal]
  18. Alexei Lisitsa, Vladimir Yu. Sazonov
    Delta-Languages for Sets and LOGSPACE Computable Graph Transformers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:1, pp:183-222 [Journal]
  19. Alexei Lisitsa, Vladimir Yu. Sazonov
    Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:224, n:1-2, pp:173-213 [Journal]

Search in 0.005secs, Finished in 0.007secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002