The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sergei S. Goncharov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sergei S. Goncharov, Dmitri Ivanovich Sviridenko
    Theoretical aspects of Sigma-programming. [Citation Graph (0, 0)][DBLP]
    Mathematical Methods of Specification and Synthesis of Software Systems, 1985, pp:169-179 [Conf]
  2. Yuri Leonidovich Ershov, Sergei S. Goncharov, Dmitri Ivanovich Sviridenko
    Semantic Foundations of Programming. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:116-122 [Conf]
  3. Sergei S. Goncharov, Yuri Leonidovich Ershov, Dmitri Ivanovich Sviridenko
    Semantic Programming. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1986, pp:1113-1120 [Conf]
  4. Sergei S. Goncharov, S. A. Badaev
    Classes with Pairwise Equivalent Enumerations. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:140-141 [Conf]
  5. Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy
    Simple and immune relations on countable structures. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:3, pp:279-291 [Journal]
  6. Sergei S. Goncharov
    Decidable Boolean Algebras of Low Level. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:75-95 [Journal]
  7. Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell Miller, Reed Solomon
    Enumerations in computable structure theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:3, pp:219-246 [Journal]
  8. Sergei S. Goncharov, Alexander Yakhnis, Vladimir Yakhnis
    Some Effectively Infinite Classes of Enumerations. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:60, n:3, pp:207-235 [Journal]
  9. Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore
    Computably Categorical Structures and Expansions by Constants. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:13-37 [Journal]

  10. Categoricity of computable infinitary theories. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002