Publications

Entries sorted by: 1. Author,Editor - 1. by Individual - 2. A..Z Index

Login to this database

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)

Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

#		Year	Author(s) [non member]	Editor(s) [non member]		Title	Type
1	Uebe, G. (ed.)
1	Ursini, Aldo (ed.)
1	Urzyczyn, Pawe{ł} (ed.)
1	Vakarelov, Dimiter
1	Vakil, R. (ed.)
1	Vallduvi, Enric (ed.)
2	Valmari, Antti (ed.)
22	van der Torre, Leendert W. N.
1	van Emde Boas, Peter (ed.)
2	Van Hentenryck, Pascal (ed.)
1	van Leeuwen, Jan (ed.)
1	Vardi, Moshe
1	Varsek, I.
1	Vaz de Carvalho, Júlia (ed.)
10	Veanes, Margus
1	Vehi, Josep
1	Veit, Jörg
1	Ventura, Paolo
9	Viganò, Luca
1	Vigneron, Laurent (ed.)
1	Vogel, Carl (ed.)
1	Vojtas, Peter (ed.)
1	von Wright, J. (ed.)
11	Vorobyov, Sergei
		2002	Vorobyov, Sergei			The undecidability of the first-order theories of one step rewriting in linear canonical systems In: Information and Computation [175], 182-213	Journal Article
		2002	Vorobyov, Sergei			$\forall\exists^5$-equational theory of context unification is undecidable In: Theoretical Computer Science [275], 463-479	Journal Article
		1999	Vorobyov, Sergei	[Gottlob, Georg] [Grandjean, Etienne] [Seyr, Katrin]		Subtyping Functional+Nonempty Record Types In: Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL, 285-297	Proceedings Article
		1998	Vorobyov, Sergei	Brim, Lubos Gruska, Jozef Zlatuska, Jirí		$\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606	Proceedings Article
		1998	Vorobyov, Sergei Voronkov, Andrei			Complexity of Nonrecursive Logic Programs with Complex Values In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98), 244-253	Proceedings Article
		1997	Vorobyov, Sergei	[Comon, Hubert]		The first-order theory of one step rewriting in linear noetherian systems is undecidable In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 254-268	Proceedings Article

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)