Mehlhorn, Kurt, 1949-....
Mehlhorn, Kurt
Kurt Mehlhorn
VIAF ID: 67022101 ( Personal )
Permalink: http://viaf.org/viaf/67022101
Preferred Forms
- 100 0 _ ‡a Kurt Mehlhorn
-
-
-
- 100 1 _ ‡a Mehlhorn, Kurt
-
- 100 1 _ ‡a Mehlhorn, Kurt ‡d 1949-
- 100 1 _ ‡a Mehlhorn, Kurt ‡d 1949-
- 100 1 _ ‡a Mehlhorn, Kurt ‡d 1949-
-
-
- 100 1 0 ‡a Mehlhorn, Kurt, ‡d 1949-
- 100 1 _ ‡a Mehlhorn, Kurt, ‡d 1949-
-
-
-
- 100 1 _ ‡a Mehlhorn, Kurt, ‡d 1949-....
4xx's: Alternate Name Forms (19)
5xx's: Related Names (2)
Works
Title | Sources |
---|---|
Algorithmen und Datenstrukturen : Die Grundwerkzeuge | |
Algorithmics of matching under preferences | |
Algorithms - ESA 2008 : 16th annual European symposium, Karlsruhe, Germany, September 15-17, 2008, proceedings | |
Arbitrary weight changes in dynamic trees | |
Binary search trees: average and worst case behavior | |
complete and efficient algorithm for the intersection of a general and a convex polyhedron | |
Congruence, similarity and symmetries of geometric objects | |
Constructive Hopf´s theorem or how to untangle closed planar curves | |
Data structures and algorithms | |
Dynamic binary search | |
Dynamic deferred data structuring | |
Dynamic fractional cascading | |
Dynamic point location in general subdivisions | |
Efficient Algorithms Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday | |
An efficient graph algorithm for dominance constraints | |
Effiziente Allgorithmen. | |
ESA 2008 | |
Faster algorithms for the shortest path problem | |
Foundations of programming languages | |
Four results on the complexity of VLSI computations | |
Fundamentals - foundations of computer science : proceedings of the XV. IFIP World Computer Congress, 31 August - 4 September 1998, Vienna/Austria and Budapest/Hungary | |
generalized and improved constructive separation bound for real algebraic expressions | |
Granularity of parallel memories | |
Graph algorithms and NP-completeness | |
Grundlagen der Programmiersprachen | |
Harnessing the power of GPUs for problems in real algebraic geometry | |
HILL system a design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts | |
Implementation of a sweep line algorithm for the straight line segment intersection problem | |
An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm | |
In Richtung einer Komplexitätstheorie für randomisierte Suchheuristiken | |
Lagrangian Relaxation : solving NP-hard Problems in Computational Biology via Combinatorial Optimization | |
Leda : a platform for combinatorial and geometric computing | |
LEDA class real number | |
Local routing of two-terminal nets is easy (extended abstract) | |
lower bound for the nondeterministic space complexity of contextfree recognition | |
Maintaining dynamic sequences under equality-tests in polylogarithmic time | |
Multi-dimensional searching and computational geometry | |
Multiple choice allocations with small maximum loads | |
o(n3)-time maximum flow algorithm | |
n82270631 | |
NP-hard networking problems exact and approximate algorithms | |
An O(n log n) lower bound for the synchronous circuit size of integer multiplication | |
Parallel Algorithms and Architectures Proceedings of the International Workshop on Parallel Algorithms and Architectures held in Suhl (GDR), May 25–30, 1987 | |
Polynomialzeitlösbare Klassen des Transversalhypergraphen-Problems und verwandte Probleme | |
Potentiometrische Verfolgung der Thiosulfatbildung aus Alkalisulfid und Schwefliger Säure | |
Randomized incremental construction of abstract Voronoi diagrams | |
Recherche et diffusion d'informations dans un environnement bruité, une perspective biologique. | |
Relaxation Lagrangienne : resoudre des problèmes NP-dur en bioinformatique par des méthodes d'optimisation combinatoire. | |
Riemann-Roch-Theorie für Untergitter des Wurzelgitter, Graphen-Automorphie und Zählen von Zyklen in Graphen | |
A Riemann-Roch theory for sublattices of the root lattice An, graph automorphisms and counting cycles in graphs | |
Routing problems in grid graphs | |
Routing through a rectangle | |
Runtime prediction of real programs on real machines | |
Sampling from discrete distributions and computing Fréchet distances | |
Search and broadcast in stochastic environments, a biological perspective | |
simple way to recognize a correct Voronoi diagram of line segments | |
Sorting Jordan sequences in linear time | |
Sorting presorted files | |
Space sweep solves intersection of two convex polyhedra elegantly | |
STACS 85 | |
STACS 85 : 2nd annual symposium on theoretical aspects of computer science, Saarbrücken, January 3-5, 1985 | |
Tail estimates for the space complexity of randomized incremental algorithms | |
Top down parsing of macro grammars (preliminary report) | |
Toward better computation models for modern machines | |
Untere Schranken für den Platzbedarf bei der kontext-freien Analyse | |
VLSI Algorithms and Architectures : Aegean Workshop on Computing Loutraki, Greece, July 8–11, 1986 Proceedings | |
VLSI complexity, efficient VLSI algorithms and the HILL design system | |
WAE '98 | |
Zu besseren Berechnungsmodellen für moderne Rechner | |
アルゴリズムとデータ構造 : 基礎のツールボックス |