sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000404919823 | 1 hits
Organisation
ISNI: 
0000 0004 0491 9823
Name: 
Max-Planck-Institut für Informatik
Max-Planck-Institut für Informatik Saarbrücken
Max-Planck-Institut Informatik Saarbrücken
Max Planck Institute for Computer Science
MPI-I
MPI Informatik Saarbrücken
Planck-Institut für Informatik Saarbrücken
Location / Nationality: 
Germany Saarland Saarbrucken
Creation class: 
Language material
Creation role: 
author
originator
Related names: 
Crauser, Andreas (1971-)
De Simone, Caterina
Fleischer, Rudolf
Golin, Mordecai
Hert, Susan
Interest Group in Pure and Applied Logics
Lensch, Hendrik P. A.
Mehlhorn, Kurt (1949-)
Moreno Navarro, Juan José
Ohlbach, Hans Jürgen
Theobalt, Christian (1973-)
Titles: 
22. Workshop Komplexitätstheorie und Effiziente Algorithmen 8. Februar 1994
3D acquisition of mirroring objects research report
adaptable and extensible geometry kernel, An
AGD-library a library of algorithms for graph drawing
Applications of the generic programming paradigm in the design of CGAL
Average case and smoothed competitive analysis of the multi-level feedback algorithm
Basic paramodulation
branch and cut algorithm for multiple sequence alignment, A
branch and cut approach to physical mapping with end probes, A
branch & cut algorithm for the optimal solution of the side chain placement problem, A
Classical versus non-classical logics
Classical vs non-classical logics : the universality of classical logic
computational basis for higher-dimensional computational geometry, A
Computing a largest empty anchored cylinder, and related problems
custom designed density estimator for light transport, A
Decidable fragments of simultaneous rigid reachability
dimension of C_1hn1 splines of arbitrary degree on a tetrahedral partition, The
Efficient light transport using precomputed visibility
empirical model for heterogeneous translucent objects, An
Exact ground states of Ising spin glasses new experimental results with a branch and cut algorithm
Exact ground states of two-dimensional ±J Ising spin glasses
ExpLab a tool set for computational experiments
flexible and versatile studio for synchronized multi-view video recording, A
framework for program development based on schematic proof, A
framework for the acquisition, processing, transmission, and interactive display of high quality 3D models on the web, A
Genetic algorithms within the framework of evolutionary computation proceedings of the KI-94 workshop
Hammock-on-ears decomposition a technique for the efficient parallel solution of shortest paths and other problems
Image based reconstruction of spatially varying materials
Integration of declarative paradigms proceedings of the ICLP '94 post-conference workshop, Santa Margherita Ligure, Italy. [Max-Planck-Institut für Informatik]. Hassan Aït-Kaci ... (ed.)
Joint motion and reflecatance capture for creating religtable 3D videos
Joint motion and reflectance capture for creating relightable 3D videos
Journal of the IGPL (Online)
Journal of the Interest Group in Pure and Applied Logics
Künstliche Intelligenz und Operations-Research Workshop, Berlin, 13. - 14. September 1993 ; extended abstracts
lower bound for area universal graphs, A
Lower bounds for set intersection queries
method for obtaining randomized algorithms with small tail probalities, A
Modeling hair using a wisp hair model
MPI I
Neural meshes surface reconstruction with a learning algorithm
On embeddings in cycles
On-line randomized call control revisited
On the complexity of computing evolutionary trees
On the design of CGAL, the computational geometry algorithms library
Optimal embedding of a toroidal mesh in a path
Parallel algorithms for MD-Simulations of synthetic polymers
Perceptual evaluation of tone mapping operators with regard to similarity and preference
Preprints of proceedings of GWAI 92
Proceedings of the Second International Workshop on the Implementation of Logics
Q-gram based database searching using a suffix array (Quasar)
Quickest paths faster algorithms and dynamization
Randomized data structures for the dynamic closest pair problem
Randomized external memory algorithms for some geometric problems
rectangle enclosure and point-dominance problems revisited, The
Reflectance from images a model-based approach for human faces
Research report: on the performance of LEDA-SM
Searching, sorting and randomised algorithms for central elements and ideal counting in posets
Simple randomized algorithms for closest pair problems
Simultaneous inner and outer approximation of shapes
Static and dynamic algorithms for k-point clustering problems
Temporal logic proceedings of the ICTL workshop
Theorem proving with analytic tableaux and related methods
thickness of a minor excluded class of graphs, The
WAE '98
web site viewed sept 2
Workshop on Theorem Proving with Analytic Tableaux and Related Methods Marseille, France, April 28 - 30, 1993
Zweiundzwanzigster Workshop Komplexitätstheorie und Effiziente Algorithmen
Notes: 
Sources: 
VIAF DNB LC NKC