Search results for "Vladimir Yu. Sazonov"

Found 20 publication records. Showing 20 according to the selection in the facets

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

Publications of "Vladimir Yu. Sazonov" ( http://dblp.L3S.de/Authors/Vladimir_Yu._Sazonov )