MPI-INF Logo
MPI-INF/SWS Research Reports 1991-2021

1. Author,Editor - 2. by Group - MPI-INF/SWS Research Reports 1991-2021

#YearTitle
1
Hide details for Theobalt, Li, Magnor, SeidelTheobalt, Li, Magnor, Seidel
2003A flexible and versatile studio for synchronized multi-view video recording
1
Hide details for ThorupThorup
1997Faster deterministic sorting and priority queues in linear space
1
Hide details for Tompkin, Kim, Kautz, TheobaltTompkin, Kim, Kautz, Theobalt
2011Videoscapes: exploring unstructured video collections
2
Hide details for TönneTönne
1993Linear logic meets the Lambda Calculus, part I
1992not published
1
Hide details for Träff, ZaroliagisTräff, Zaroliagis
1996A simple parallel algorithm for the single-source shortest path problem on planar diagraphs
1
Hide details for Tzakova, BlackburnTzakova, Blackburn
1998Hybridizing concept languages
1
Hide details for VeanesVeanes
1998The relation between second-order unification and simultaneous rigid \sl E-unification
1
Hide details for Vingron, Lenhof, MutzelVingron, Lenhof, Mutzel
1996Computational Molecular Biology
9
Hide details for VorobyovVorobyov
1999New lower bounds for the expressiveness and the higher-order Matching problem in the simply typed lambda calculus
1998AE-Equational theory of context unification is Co-RE-Hard
1998Satisfiability of Functional+Record Subtype Constraints is NP-Hard
1998The most nonelementary theory (a direct lower bound proof)
1998The undecidability of the first-order theories of one step rewriting in linear canonical systems
1997Third-order matching in $\lambda\rightarrow$-Curry is undecidable
1996On the decision complexity of the bounded theories of trees
1995Proof normalization and subject reduction in extensions of Fsub
1994Structural decidable extensions of bounded quantification
1
Hide details for Vorobyov, VoronkovVorobyov, Voronkov
1997Complexity of nonrecursive logic programs with complex values
1
Hide details for WagnerWagner
2004Summaries for while programs with recursion
2
Hide details for WaldmannWaldmann
2001Superposition and chaining for totally ordered divisible abelian groups
1999Cancellative superposition decides the theory of divisible torsion-free abelian groups
1
Hide details for WangWang
1997Bicriteria job sequencing with release dates
1
Hide details for Wang, Belyaev, Saleem, SeidelWang, Belyaev, Saleem, Seidel
2008Shape complexity from image similarity
3
Hide details for WeidenbachWeidenbach
1994Minimal resolution
1993Unification in sort theories and its applications
1991A sorted logic using dynamic sorts
1
Hide details for WertzWertz
1992First-order theorem proving modulo equations
1
Hide details for Wies, Kuncak, Zee, Podelski, RinardWies, Kuncak, Zee, Podelski, Rinard
2006On verifying complex properties using symbolic shape analysis
1
Hide details for Wischnewski, WeidenbachWischnewski, Weidenbach
2009Contextual rewriting
1
Hide details for WuWu
1999Symmetries in logic programs
1
Hide details for ZakariaZakaria
2003FaceSketch: an interface for sketching and coloring cartoon faces
1
Hide details for Zayer, Roessl, SeidelZayer, Roessl, Seidel
2003Convex boundary angle based flattening
1
Hide details for Zayer, Rössl, SeidelZayer, Rössl, Seidel
2004r-adaptive parameterization of surfaces
2
Hide details for ZelikovskyZelikovsky
1992A faster 11/6-approximation algorithm for the Steiner tree problem in graphs
1992Minimum base of weighted k polymatroid and Steiner tree problem
1
Hide details for Ziegler, Tevs, Theobalt, SeidelZiegler, Tevs, Theobalt, Seidel
2006GPU point list generation through histogram pyramids
600