Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 3. Type of Publication - 1. All Types

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

#Author/EditorYearTitle
16
Show details for BookBook
50
Show details for Part of a BookPart of a Book
18
Show details for ProceedingsProceedings
1060
Show details for Proceedings ArticleProceedings Article
37
Show details for Electronic Proceedings ArticleElectronic Proceedings Article
1
Show details for PosterPoster
713
Show details for Journal ArticleJournal Article
49
Show details for Electronic Journal ArticleElectronic Journal Article
127
Hide details for ReportReport
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path Problem
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path Problem
Altenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter Cost
Althaus, Ernst
Altmeyer, Sebastian
Naujoks, Rouven
2010A New Combinatorial Approach to Parametric Path Analysis
Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
1991Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1985Deterministic simulation of idealized parallel computers on more realistic ones
Alt, Helmut
Mehlhorn, Kurt
1978Complexity Arguments in Algebraic Language Theory
Alt, Helmut
Mehlhorn, Kurt
1975Untere Schranken für den Platzbedarf bei der kontext-freien Analyse
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1987Attachment IconCongruence, similarity and symmetries of geometric objects
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
Becker, Michael
Mehlhorn, Kurt
1984Attachment IconAlgorithms for routing in planar graphs
Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
2002Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Attachment IconFiltering algorithms for the Same and UsedBy constraints
Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
2007Exact Computation of Arrangements of Rotated Conics
Berberich, Eric
Ebert, Franziska
Fogel, Efi
Kettner, Lutz
2006Web-site with benchmark instances for planar curve arrangements
Berberich, Eric
Ebert, Franziska
Kettner, Lutz
2006Definition of file format for benchmark instances for arrangements of Quadrics
Berberich, Eric
Eigenwillig, Arno
Emiris, Ioannis
Fogel, Efraim
Hemmer, Michael
Halperin, Dan
Kakargias, Athanasios
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schömer, Elmar
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved Arcs
Berberich, Eric
Eigenwillig, Arno
Fogel, Efi
Halperin, Dan
Hert, Susan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
2003Specification of the traits classes for CGAL arrangements of curves
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Weber, Dennis
Wolpert, Nicola
2004EXACUS: Efficient and Exact Algorithms for Curves and Surfaces
Berberich, Eric
Emeliyanenko, Pavel
2008CGAL's Curved Kernel via Analysis
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
2007Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics
Berberich, Eric
Fogel, Efi
Meyer, Andreas
2007Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves
Berberich, Eric
Hemmer, Michael
2007Definition of the 3D Quadrical Kernel Content
Berberich, Eric
Hemmer, Michael
2006Prototype implementation of the algebraic kernel
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
2008Prototype implementation of the algebraic kernel
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
2006Interface specification of algebraic kernel
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos I.
Teillaud, Monique
2007Revision of interface specification of algebraic kernel
Berberich, Eric
Hemmer, Michael
Kerber, Michael
2010A Generic Algebraic Kernel for Non-linear Geometric Applications
Berberich, Eric
Kettner, Lutz
2007Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point
Berberich, Eric
Meyerovitch, Michal
2007Computing Envelopes of Quadrics
Blum, Norbert
Mehlhorn, Kurt
1978On the Average Number of Rebalancing Operations in Weight-Balanced Trees
Chandran, L. Sunil
Sivadasan, Naveen
2004Attachment IconOn the Hadwiger's Conjecture for Graph Products
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1990Attachment IconCan a maximum flow be computed in $o(nm)$ time?
Csaba, Bela
Lodha, Sachin
2001A randomized on-line algorithm for the k-server problem on a line
Dementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data Sets
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1991Dynamic Perfect Hashing: Upper and Lower Bounds
Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
Doerr, Benjamin
Gnewuch, Michael
2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding
Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
2007Attachment IconSnap Rounding of Bézier Curves
Eigenwillig, Arno
Schömer, Elmar
Wolpert, Nicola
2002Sweeping Arrangements of Cubic Segments Exactly and Efficiently
Elbassioni, Khaled M.2006On the Complexity of Monotone Boolean Duality Testing
Elmasry, Amr2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci Heaps
Emeliyanenko, Pavel
Kerber, Michael
2008Attachment IconAn implementation of the 2D Algebraic Kernel
Emeliyanenko, Pavel
Kerber, Michael
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web Application
Emiris, Ioannis
Hemmer, Michael
Tsigaridas, Elias
Tzoumas, Georg
2008Voronoi diagram of ellipses: CGAL-based implementation
Emiris, Ioannis Z.
Hemmer, Michael
Karavelas, Menelaos
Mourrain, Bernard
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solvers
Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis
2008Cross-benchmarks of univariate algebraic kernels
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Dynamization of geometric data structures
Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2006Attachment IconControlled Perturbation for Delaunay Triangulations
Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan
2004The LEDA class real number -- extended version
Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
1976Binary Search Trees: Average and Worst Case Behavior
Hebbinghaus, Nils2007Attachment IconDiscrepancy of Sums of two Arithmetic Progressions
Hemmer, Michael2008CGAL package for modular arithmetic operations
Hemmer, Michael2008CGAL package: Algebraic Foundations
Hemmer, Michael2008Evaluation of different approaches in 3D curved kernel for arrangements of quadrics
Hemmer, Michael
Dupont, Laurent
Petitjean, Sylvain
Schömer, Elmar
2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics
Hemmer, Michael
Hülse, Dominik
2007Traits classes for polynomial gcd computation over algebraic extensions
Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
2004Effects of a Modular Filter on Geometric Applications
Hemmer, Michael
Limbach, Sebastian
2008Arrangements of quadrics in 3D: continued work on experimental implementation
Hemmer, Michael
Limbach, Sebastian
2007Benchmarks on a generic univariate algebraic kernel
Hertel, Stefan
Mehlhorn, Kurt
Mäntylä, Martti
Nievergelt, Jurg
1984Attachment IconSpace sweep solves intersection of two convex polyhedra elegantly
Heydthausen, Manfred
Mehlhorn, Kurt
1976Top down parsing of macro grammars (preliminary report)
Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1984Sorting Jordan sequences in linear time
Hong, Jia-Wei
Mehlhorn, Kurt
1982Cost tradeoffs in graph embeddings, with applications
Jung, Hermann
Mehlhorn, Kurt
1987Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
Katriel, Irit2004Attachment IconOn Algorithms for Online Topological Ordering and Sorting
Kaufmann, Michael
Mehlhorn, Kurt
1989Routing Problems in Grid Graphs
Kaufmann, Michael
Mehlhorn, Kurt
1989Routing problems in grid graphs
Kaufmann, Michael
Mehlhorn, Kurt
1988A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
Kaufmann, Michael
Mehlhorn, Kurt
1986On Local Routing of Two-Terminal Nets
Kaufmann, Michael
Mehlhorn, Kurt
1984Attachment IconLocal routing of two-terminal nets is easy
Kaufmann, Michael
Mehlhorn, Kurt
1984Attachment IconRouting through a generalized switchbox
Kerber, Michael2008Attachment IconOn filter methods in CGAL's 2D curved kernel
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2004Classroom Examples of Robustness Problems in Geometric Computations
Klein, Christian2004Attachment IconA Fast Root Checking Algorithm
Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.
Krandick, Werner
Mehlhorn, Kurt
2004New Bounds for the Descartes Method
Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)2005Cache-Oblivious and Cache-Aware Algorithms
Lengauer, Thomas
Mehlhorn, Kurt
1983Four results on the complexity of VLSI computations
Lengauer, Thomas
Mehlhorn, Kurt
1983Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts
Lengauer, Thomas
Mehlhorn, Kurt
1983VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System
Mehlhorn, Kurt1987A Faster Approximation Algorithm for the Steiner Problem in Graphs
Mehlhorn, Kurt1984Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof
Mehlhorn, Kurt1983$AT^2$-optimal VLSI for integer division and integer square rooting
Mehlhorn, Kurt1980Lower bounds on the efficiency of transforming static data structures into dynamic structures
Mehlhorn, Kurt1978An efficient algorithm for constructing nearly optimal prefix codes
Mehlhorn, Kurt1978Arbitrary Weight Changes in Dynamic Trees
Mehlhorn, Kurt1978Effiziente Algorithmen: Ein Beispiel
Mehlhorn, Kurt1978Sorting Presorted Files
Mehlhorn, Kurt1976An improved lower bound on the formula complexity of context-free recognition
Mehlhorn, Kurt1976An O(n log n) lower bound for the synchronous circuit size of integer multiplication
Mehlhorn, Kurt1976Dynamic Binary Search
Mehlhorn, Kurt1976Dynamic Binary Search Trees : Extended Abstracts
Mehlhorn, Kurt1975A game on graphs
Mehlhorn, Kurt1975Bracket-Languages are Recognizable in Logarithmic Space
Mehlhorn, Kurt1974Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14
Mehlhorn, Kurt1973On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22
Mehlhorn, Kurt1973The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25
Mehlhorn, Kurt
Meiser, Stefan
O'Dunlaing, Colm
1989Attachment IconOn the construction of abstract Voronoi diagrams
Mehlhorn, Kurt
Näher, Stefan
1995LEDA : A Platform for Combinatorial and Geometric Computing
Mehlhorn, Kurt
Näher, Stefan
1987A faster compaction algorithm with automatic jog insertion
Mehlhorn, Kurt
Näher, Stefan
1986Dynamic fractional cascading
Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut
1986A Lower Bound for the Complexity of the Union-Split-Find Problem
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
2008A General Approach to the Analysis of Controlled Perturbation Algorithms
Mehlhorn, Kurt
Overmars, Mark H.
1980Optimal dynamization of decomposable searching problems
Mehlhorn, Kurt
Preparata, Franco P.
1985Area-time optimal division for T=omega((logn)1+epsilon)
Mehlhorn, Kurt
Preparata, Franco P.
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
Mehlhorn, Kurt
Preparata, F. P.
1983Routing through a Rectangle
Mehlhorn, Kurt
Rülling, W.
1988Compaction on the Torus
Mehlhorn, Kurt
Sagraloff, Michael
2008A deterministic Bitstream Descartes Algorithm
Mehlhorn, Kurt
Schmidt, Bernd H.
1985On BF-perfect graphs
Mehlhorn, Kurt
Tsakalidis, Athanasios K.
1989Attachment IconData structures
Mehlhorn, Kurt
Vishkin, Uzi
1983Granularity of parallel memories
Mehlhorn, Kurt
Yap, Chee-Keng
1988Constructive Hopf's theorem: or how to untangle closed planar curves
Neumann, Frank
Witt, Carsten
2006Ant Colony Optimization and the Minimum Spanning Tree Problem
Sanders, Peter
Pettie, Seth
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Schmitt, Susanne2004Common Subexpression Search in LEDA_reals -- a study of the diamond-operator
Schmitt, Susanne2004Improved separation bounds for the diamond operator
Schmitt, Susanne2003Common Subexpression Search in LEDA_reals
Schmitt, Susanne2003The Diamond Operator for Real Algebraic Numbers
Schmitt, Susanne
Fousse, Laurent
2004Attachment IconA comparison of polynomial evaluation schemes
Sivadasan, Naveen
Sanders, Peter
Skutella, Martin
2004Attachment IconOnline Scheduling with Bounded Migration
van Leeuwen, Mehlhorn, Reps (ed.)1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94
Wolpert, Nicola2003Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic Curves
10
Show details for Thesis - Bachelor thesisThesis - Bachelor thesis
155
Show details for Thesis - Master's thesisThesis - Master's thesis
60
Show details for Thesis - Doctoral dissertationThesis - Doctoral dissertation
8
Show details for Thesis - Habilitation thesisThesis - Habilitation thesis
1
Show details for Thesis - Diploma thesisThesis - Diploma thesis
1
Show details for Thesis - otherThesis - other
4
Show details for ManualManual
36
Show details for Unpublished/DraftUnpublished/Draft
12
Show details for MiscellaneousMiscellaneous
1
Show details for *yet unkown Form:eBookForm*yet unkown Form:eBookForm
2359

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