MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

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
#YearAuthor(s) [non member]Editor(s) [non member]TitleType
1
Show details for Vakarelov, DimiterVakarelov, Dimiter
1
Show details for Vakil, R. (ed.)Vakil, R. (ed.)
1
Show details for Vallduvi, Enric (ed.)Vallduvi, Enric (ed.)
2
Show details for Valmari, Antti (ed.)Valmari, Antti (ed.)
22
Show details for van der Torre, Leendert W. N.van der Torre, Leendert W. N.
1
Show details for van Emde Boas, Peter (ed.)van Emde Boas, Peter (ed.)
2
Show details for Van Hentenryck, Pascal (ed.)Van Hentenryck, Pascal (ed.)
1
Show details for van Leeuwen, Jan (ed.)van Leeuwen, Jan (ed.)
1
Show details for Vardi, MosheVardi, Moshe
1
Show details for Varsek, I.Varsek, I.
1
Show details for Vaz de Carvalho, Júlia (ed.)Vaz de Carvalho, Júlia (ed.)
10
Show details for Veanes, MargusVeanes, Margus
1
Show details for Vehi, JosepVehi, Josep
1
Show details for Veit, JörgVeit, Jörg
1
Show details for Ventura, PaoloVentura, Paolo
9
Show details for Viganò, LucaViganò, Luca
1
Show details for Vigneron, Laurent (ed.)Vigneron, Laurent (ed.)
1
Show details for Vogel, Carl (ed.)Vogel, Carl (ed.)
1
Show details for Vojtas, Peter (ed.)Vojtas, Peter (ed.)
1
Show details for von Wright, J. (ed.)von Wright, J. (ed.)
11
Hide details for Vorobyov, SergeiVorobyov, Sergei
2002Vorobyov, SergeiThe undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213		Journal Article
2002Vorobyov, Sergei$\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479		Journal Article
1999Vorobyov, Sergei[Gottlob, Georg]
[Grandjean, Etienne]
[Seyr, Katrin]		Attachment IconSubtyping 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
1998Vorobyov, SergeiBrim, Lubos
Gruska, Jozef
Zlatuska, Jirí		Attachment Icon$\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
1998Vorobyov, Sergei
Voronkov, Andrei		Attachment IconComplexity 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
1997Vorobyov, 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
1997Vorobyov, SergeiWinskel, GlynnThe `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305		Proceedings Article
1996Vorobyov, Sergei[Jaffar, Joxan]
[Yap, Roland H. C.]		On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161		Proceedings Article
1996Vorobyov, Sergei[McRobbie, M. A.]
[Slaney, J. K.]		An improved lower bound for the elementary theories of trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 275-287		Proceedings Article

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