Vladimir Yu. Sazonov

Publication Activity (10 Years)

Years Active: 1975-2012
Publications (10 Years): 0

Top Topics

Image Segmentation

Top Venues

Ann. Pure Appl. Log.

Publications

Dag Normann, Vladimir Yu. Sazonov
The extensional ordering of the sequential functionals. Ann. Pure Appl. Log. 163 (5) (2012)
Vladimir Yu. Sazonov
Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach. Ershov Memorial Conference (2001)
Alexander Leontjev, Vladimir Yu. Sazonov
D: Set-theoretic query language capturing LOGSPACE. Ann. Math. Artif. Intell. 33 (2-4) (2001)
Alexander Leontjev, Vladimir Yu. Sazonov
Capturing LOGSPACE over Hereditarily-Finite Sets. FoIKS (2000)
Alexei Lisitsa, Vladimir Yu. Sazonov
Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability. Theor. Comput. Sci. 224 (1-2) (1999)
Alexei Lisitsa, Vladimir Yu. Sazonov
Delta-Languages for Sets and LOGSPACE Computable Graph Transformers. Theor. Comput. Sci. 175 (1) (1997)
Alexei Lisitsa, Vladimir Yu. Sazonov
On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets. LFCS (1997)
Alexei Lisitsa, Vladimir Yu. Sazonov
Bounded Hyperset Theory and Web-like Data Bases. Kurt Gödel Colloquium (1997)
Vladimir Yu. Sazonov, Alexei Lisitsa
Delta-Languages for Sets and sub-PTIME Graphs Transformers. ICDT (1995)
Vladimir Yu. Sazonov
A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability. CSL (1994)
Vladimir Yu. Sazonov
On Feasible Numbers. LCC (1994)
Vladimir Yu. Sazonov
Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability. Theor. Comput. Sci. 119 (1) (1993)
Vladimir Yu. Sazonov, Andrei Voronkov
A Construction of Typed Lambda Models Related to Feasible Computability. Kurt Gödel Colloquium (1993)
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)
Vladimir Yu. Sazonov
Bounded Set Theory and Polynominal Computability. FCT (1987)
Vladimir Yu. Sazonov
On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation. MFCS (1981)
Vladimir Yu. Sazonov
Polynomial Computability and Recursivity in Finite Domains. J. Inf. Process. Cybern. 16 (7) (1980)
Vladimir Yu. Sazonov
A Logical Approach to the Problem "P=NP?". MFCS (1980)
Vladimir Yu. Sazonov
Degrees of Parallelism in Computations. MFCS (1976)
Vladimir Yu. Sazonov
Sequentially and parallelly computable functionals. Lambda-Calculus and Computer Science Theory (1975)