MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 4. with BibTeX cite keys

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
YearTitleBibTeX cite key
Show details for TalbotTalbot
Show details for Talbot, Devienne, TisonTalbot, Devienne, Tison
Show details for Talbot, Niehren, MüllerTalbot, Niehren, Müller
Show details for Thiebaux, Hoffmann, NebelThiebaux, Hoffmann, Nebel
Show details for TimmTimm
Show details for Trueg, Hoffmann, NebelTrueg, Hoffmann, Nebel
Show details for TzakovaTzakova
Show details for van der Torrevan der Torre
Show details for van der Torre, Tanvan der Torre, Tan
Show details for van der Torre, Weydertvan der Torre, Weydert
Show details for VeanesVeanes
Show details for VeitVeit
Show details for ViganòViganò
Hide details for VorobyovVorobyov
2002The undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213		Vorobyov2000-OSR
2002$\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479		Vorobyov2000-aecu
1999Attachment 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		Vorobyov1998CSL
1998Attachment 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		Vorobyov1998MFCS
1997The 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		Vorobyov97RTA97
1997The `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305		Vorobyov97LICS97
1996An improved lower bound for the elementary theories of trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 275-287		Vorobyov96CADE96
1996On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161		Vorobyov96ASIAN96
1995Fsub with recursive types: `Types-As-Propositions´ Interpretations in M. Rabin's S2S
In: Proceedings of JFLA'95: Journées Francophones des Langages Applicatifs (JFLA'95), 49-73		Vorobyov94b
1995Structural decidable extensions of bounded quantification
In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175		Vorobyov94h
Show details for Vorobyov, VoronkovVorobyov, Voronkov
Show details for VoronkovVoronkov
Show details for Wagner, PodelskiWagner, Podelski
Show details for WaldmannWaldmann
Show details for WangWang
Show details for WeidenbachWeidenbach

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