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