Mehlhorn, Kurt 1949
Overview
Works:  202 works in 610 publications in 5 languages and 7,175 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Other, Editor, dgs, Honoree, Contributor, Creator, Thesis advisor, ed 
Publication Timeline
.
Most widely held works about
Kurt Mehlhorn
 Efficient Algorithms Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday by Susanne Albers( Book )
Most widely held works by
Kurt Mehlhorn
Data structures and algorithms by
Kurt Mehlhorn(
Book
)
13 editions published in 1984 in 3 languages and held by 385 WorldCat member libraries worldwide
13 editions published in 1984 in 3 languages and held by 385 WorldCat member libraries worldwide
Parallel algorithms and architectures : international workshop, Suhl, GDR, May 2530, 1987 : proceedings by
A Albrecht(
Book
)
22 editions published between 1987 and 2007 in 4 languages and held by 321 WorldCat member libraries worldwide
Annotation Contents: Invited Papers: H. Alt, T. Hagerup, K. Mehlhorn, F.P. Preparata: Deterministic simulation of idealized parallel computers on more realistic ones. R. Dwyer, R. Kannan: Convex hull of randomly chosen points from a polytope. J. Herath, T. Yuba, N. Saito: Dataflow computing. E. Koerner, I. Tsuda, H. Shimizu: Parallel in sequence  Towards the architecture of an elementary cortical processor. N.N. Mirenkov: Parallel algorithms and static analysis of parallel programs. B. Monien, O. Vornberger: Parallel processing of combinatorial search. Communications: A. Apostolico, C.S. Iliopoulos, R. Paige: An O(nlogn) cost parallel algorithms for the single function coarsest partition problem. T. Asano, H. Umeo: Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region. L. Budach, E.G. Giessmann, H. Grassmann, B. Graw, C. Meinel: RELACS  A recursive layout computing system. R. Creutzburg: Parallel linear conflictfree subtree access. D. De Baer, J. Paredaens: A formal definition for systolic systems. K. Diks: Parallel recognition of outerplanar graphs. D. Ferment, B. Rozoy: Solutions for the distributed termination problem. M. Gössel, B. Rebel: Memories for parallel subtreeaccess. S. Matsui, Y. Kato, S. Teramura, T. Tanaka, N. Mohri, A. Maeda, M. Nakanishi: SYNAPSE: A multimicroprocessor Lisp machine with parallel garbage collector. W. Rytter: A note on optimal parallel transformations of regular expressions to nondeterministic finite automata. W. Rytter, R. Giancarlo: Optimal parallel parsing of bracket languages. D. Uhlig: On reliable networks from unreliable gates. I. Vrto: Areatime tradeoffs for selection. F. Wächter: Optimization of special permutation networks using simple algebraic relations. Invited Papers: C.D. Thomborson, L.L. Deneen, G.M. Shute: Computing a rectilinear Steiner minimal tree in n0(n) time. C.K. Yap: What can be parallelized in computational geometry'. Communication: A. Konagaya, R. Nakazaki, M. Umemura: A cooperative programming environment for a backend type sequential inference machine CHI
22 editions published between 1987 and 2007 in 4 languages and held by 321 WorldCat member libraries worldwide
Annotation Contents: Invited Papers: H. Alt, T. Hagerup, K. Mehlhorn, F.P. Preparata: Deterministic simulation of idealized parallel computers on more realistic ones. R. Dwyer, R. Kannan: Convex hull of randomly chosen points from a polytope. J. Herath, T. Yuba, N. Saito: Dataflow computing. E. Koerner, I. Tsuda, H. Shimizu: Parallel in sequence  Towards the architecture of an elementary cortical processor. N.N. Mirenkov: Parallel algorithms and static analysis of parallel programs. B. Monien, O. Vornberger: Parallel processing of combinatorial search. Communications: A. Apostolico, C.S. Iliopoulos, R. Paige: An O(nlogn) cost parallel algorithms for the single function coarsest partition problem. T. Asano, H. Umeo: Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region. L. Budach, E.G. Giessmann, H. Grassmann, B. Graw, C. Meinel: RELACS  A recursive layout computing system. R. Creutzburg: Parallel linear conflictfree subtree access. D. De Baer, J. Paredaens: A formal definition for systolic systems. K. Diks: Parallel recognition of outerplanar graphs. D. Ferment, B. Rozoy: Solutions for the distributed termination problem. M. Gössel, B. Rebel: Memories for parallel subtreeaccess. S. Matsui, Y. Kato, S. Teramura, T. Tanaka, N. Mohri, A. Maeda, M. Nakanishi: SYNAPSE: A multimicroprocessor Lisp machine with parallel garbage collector. W. Rytter: A note on optimal parallel transformations of regular expressions to nondeterministic finite automata. W. Rytter, R. Giancarlo: Optimal parallel parsing of bracket languages. D. Uhlig: On reliable networks from unreliable gates. I. Vrto: Areatime tradeoffs for selection. F. Wächter: Optimization of special permutation networks using simple algebraic relations. Invited Papers: C.D. Thomborson, L.L. Deneen, G.M. Shute: Computing a rectilinear Steiner minimal tree in n0(n) time. C.K. Yap: What can be parallelized in computational geometry'. Communication: A. Konagaya, R. Nakazaki, M. Umemura: A cooperative programming environment for a backend type sequential inference machine CHI
STACS 85 : 2nd Annual Symposium on Theoretical Aspects of Computer Science, Saarbrücken, January 35, 1985 by
Kurt Mehlhorn(
Book
)
20 editions published between 1985 and 2007 in 4 languages and held by 286 WorldCat member libraries worldwide
20 editions published between 1985 and 2007 in 4 languages and held by 286 WorldCat member libraries worldwide
Leda : a platform for combinatorial and geometric computing by
Kurt Mehlhorn(
Book
)
18 editions published between 1999 and 2009 in English and Polish and held by 282 WorldCat member libraries worldwide
18 editions published between 1999 and 2009 in English and Polish and held by 282 WorldCat member libraries worldwide
STACS 84 : Symposium of Theoretical Aspects of Computer Science, Paris [April] 1113, 1984 by
M Fontet(
Book
)
18 editions published in 1984 in English and Italian and held by 258 WorldCat member libraries worldwide
18 editions published in 1984 in English and Italian and held by 258 WorldCat member libraries worldwide
Algorithms and data structures : the basic toolbox by
Kurt Mehlhorn(
Book
)
21 editions published between 2008 and 2010 in English and held by 220 WorldCat member libraries worldwide
"This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and highlevel pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java."Jacket
21 editions published between 2008 and 2010 in English and held by 220 WorldCat member libraries worldwide
"This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and highlevel pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java."Jacket
Datenstrukturen und effiziente Algorithmen by
Kurt Mehlhorn(
Book
)
21 editions published between 1986 and 1988 in 3 languages and held by 148 WorldCat member libraries worldwide
Data  Data Structures
21 editions published between 1986 and 1988 in 3 languages and held by 148 WorldCat member libraries worldwide
Data  Data Structures
Foundations of programming languages by
Jacques Loeckx(
Book
)
10 editions published in 1988 in English and held by 135 WorldCat member libraries worldwide
10 editions published in 1988 in English and held by 135 WorldCat member libraries worldwide
Multidimensional searching and computational geometry by
Kurt Mehlhorn(
Book
)
4 editions published in 1984 in English and held by 120 WorldCat member libraries worldwide
Band 3
4 editions published in 1984 in English and held by 120 WorldCat member libraries worldwide
Band 3
Effiziente Algorithmen by
Kurt Mehlhorn(
Book
)
9 editions published in 1977 in German and Undetermined and held by 116 WorldCat member libraries worldwide
9 editions published in 1977 in German and Undetermined and held by 116 WorldCat member libraries worldwide
Grundlagen der Programmiersprachen by
Jacques Loeckx(
Book
)
9 editions published in 1986 in German and held by 97 WorldCat member libraries worldwide
9 editions published in 1986 in German and held by 97 WorldCat member libraries worldwide
Graph algorithms and NPcompleteness by
Kurt Mehlhorn(
Book
)
5 editions published in 1984 in English and held by 81 WorldCat member libraries worldwide
Band 2
5 editions published in 1984 in English and held by 81 WorldCat member libraries worldwide
Band 2
Sorting and searching by
Kurt Mehlhorn(
Book
)
4 editions published in 1984 in English and held by 79 WorldCat member libraries worldwide
4 editions published in 1984 in English and held by 79 WorldCat member libraries worldwide
Data structures and agorithms by
Kurt Mehlhorn(
Book
)
12 editions published in 1984 in English and held by 73 WorldCat member libraries worldwide
12 editions published in 1984 in English and held by 73 WorldCat member libraries worldwide
Algorithms  ESA 2008 : 16th annual European symposium, Karlsruhe, Germany, September 1517, 2008 : proceedings by
ESA (Symposium)(
Book
)
14 editions published in 2008 in English and held by 69 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. The 67 revised full papers presented together with 2 invited lectures were carefully reviewed and selected: 51 papers out of 147 submissions for the design and analysis track and 16 out of 53 submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to realworld applications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization
14 editions published in 2008 in English and held by 69 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. The 67 revised full papers presented together with 2 invited lectures were carefully reviewed and selected: 51 papers out of 147 submissions for the design and analysis track and 16 out of 53 submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to realworld applications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization
Efficient Algorithms Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday by
Susanne Albers(
Book
)
7 editions published in 2009 in English and held by 46 WorldCat member libraries worldwide
This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph. D. students and colleagues as well as by his former Ph. D. advisor, Bob Constable. The volume's title is a translation of the title of Kurt Mehlhorn's first book, "Effiziente Algorithmen", published by TeubnerVerlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then. The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness
7 editions published in 2009 in English and held by 46 WorldCat member libraries worldwide
This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph. D. students and colleagues as well as by his former Ph. D. advisor, Bob Constable. The volume's title is a translation of the title of Kurt Mehlhorn's first book, "Effiziente Algorithmen", published by TeubnerVerlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then. The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness
Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 913, 2012, Proceedings,
Part I by
Artur Czumaj(
)
9 editions published in 2012 in English and held by 34 WorldCat member libraries worldwide
This twovolume set of LNCS 7391 and LNCS 7392 constitutes the refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012. The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation
9 editions published in 2012 in English and held by 34 WorldCat member libraries worldwide
This twovolume set of LNCS 7391 and LNCS 7392 constitutes the refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012. The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation
Data structures and algorithms by
Kurt Mehlhorn(
Book
)
12 editions published between 1984 and 2012 in English and German and held by 31 WorldCat member libraries worldwide
12 editions published between 1984 and 2012 in English and German and held by 31 WorldCat member libraries worldwide
Algorithmen und Datenstrukturen : die Grundwerkzeuge by
Martin Dietzfelbinger(
Book
)
4 editions published in 2014 in German and held by 21 WorldCat member libraries worldwide
Algorithmen bilden das Herzstück jeder nichttrivialen Anwendung von Computern, und die Algorithmik ist ein modernes und aktives Gebiet der Informatik. Daher sollte sich jede Informatikerin und jeder Informatiker mit den algorithmischen Grundwerkzeugen auskennen. Dies sind Strukturen zur effizienten Organisation von Daten, häufig benutzte Algorithmen und Standardtechniken für das Modellieren, Verstehen und Lösen algorithmischer Probleme. Dieses Buch ist eine straff gehaltene Einführung in die Welt dieser Grundwerkzeuge, gerichtet an Studierende und im Beruf stehende Experten, die mit dem Programmieren und mit den Grundelementen der Sprache der Mathematik vertraut sind. Die einzelnen Kapitel behandeln Arrays und verkettete Listen, Hashtabellen und assoziative Arrays, Sortieren und Auswählen, Prioritätswarteschlangen, sortierte Folgen, Darstellung von Graphen, Graphdurchläufe, kürzeste Wege, minimale Spannbäume und Optimierung. Die Algorithmen werden auf moderne Weise präsentiert, mit explizit angegebenen Invarianten, und mit Kommentaren zu neueren Entwicklungen wie Algorithm Engineering, Speicherhierarchien, Algorithmenbibliotheken und zertifizierenden Algorithmen. Die Algorithmen werden zunächst mit Hilfe von Bildern, Text und Pseudocode erläutert; dann werden Details zu effizienten Implementierungen gegeben, auch in Bezug auf konkrete Sprachen wie C++ und Java
4 editions published in 2014 in German and held by 21 WorldCat member libraries worldwide
Algorithmen bilden das Herzstück jeder nichttrivialen Anwendung von Computern, und die Algorithmik ist ein modernes und aktives Gebiet der Informatik. Daher sollte sich jede Informatikerin und jeder Informatiker mit den algorithmischen Grundwerkzeugen auskennen. Dies sind Strukturen zur effizienten Organisation von Daten, häufig benutzte Algorithmen und Standardtechniken für das Modellieren, Verstehen und Lösen algorithmischer Probleme. Dieses Buch ist eine straff gehaltene Einführung in die Welt dieser Grundwerkzeuge, gerichtet an Studierende und im Beruf stehende Experten, die mit dem Programmieren und mit den Grundelementen der Sprache der Mathematik vertraut sind. Die einzelnen Kapitel behandeln Arrays und verkettete Listen, Hashtabellen und assoziative Arrays, Sortieren und Auswählen, Prioritätswarteschlangen, sortierte Folgen, Darstellung von Graphen, Graphdurchläufe, kürzeste Wege, minimale Spannbäume und Optimierung. Die Algorithmen werden auf moderne Weise präsentiert, mit explizit angegebenen Invarianten, und mit Kommentaren zu neueren Entwicklungen wie Algorithm Engineering, Speicherhierarchien, Algorithmenbibliotheken und zertifizierenden Algorithmen. Die Algorithmen werden zunächst mit Hilfe von Bildern, Text und Pseudocode erläutert; dann werden Details zu effizienten Implementierungen gegeben, auch in Bezug auf konkrete Sprachen wie C++ und Java
Algorithmics of matching under preferences by
David F Manlove(
Book
)
7 editions published in 2013 in English and held by 4 WorldCat member libraries worldwide
Matching problems with preferences are all around us  they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria
7 editions published in 2013 in English and held by 4 WorldCat member libraries worldwide
Matching problems with preferences are all around us  they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Manlove, David F. Author
 Sanders, Peter 1967
 Näher, Stefan Editor
 Halperin, Dan Author Editor
 Albers, Susanne
 Alt, Helmut 1950
 Jung, H. (Hermann) Editor
 Fontet, M. (Max) Author Editor
 Albrecht, Andreas Author Editor
 Gesellschaft für Informatik
Useful Links
Associated Subjects
Algorithms C++ (Computer program language) Computational complexity Computer algorithms Computer architecture Computer graphics Computer networks Computer programming Computers Computer science Computer scienceMathematics Computer software Data structures (Computer science) Electronic data processing Engineering Information storage and retrieval systems LEDA (Computer file) Leda (Computer program language) Logic, Symbolic and mathematical Logic design Machine theory Matching theory Numerical analysis Parallel algorithms Parallel processing (Electronic computers) Programming languages (Electronic computers) Software engineering Sorting (Electronic computers)
Alternative Names
Kurt Mehlhorn deutscher Informatiker und Hochschullehrer
Kurt Mehlhorn Duits informaticus
Kurt Mehlhorn German compupter scientist
Kurt Mehlhorn tysk datavetare
Kurt Mehlhorn tysk informatikar
Kurt Mehlhorn tysk informatiker
Mehlhorn, K.
Mehlhorn, K. 1949
Mehlhorn, K. (Kurt)
Mehlhorn, K. (Kurt), 1949
メールホルン, K
Languages
Covers