Helmut Alt – författare

Die mit dem Gebiet der angewandten Mathematik und Finanzmathematik in Band 1 begonnene und mit Anwendungsproblemen auf dem Gebiet der Allgemeinen Elektrotechnik mit Band 2 fort­ gesetzte Reihe "Anwendung programmierbarer Taschenrechner" wird mit dem vorliegenden Band um die Fachgebiete Elektrische Energietechnik, Steuerungstechnik und Elektrizitätswirtschaft erweitert. Dieser Band wendet sich insbesondere an Ingenieure in Energieversorgungsunternehmen (EVU''s) und Industrieunternehmen, die an einer rationellen und systematischen Bearbeitung sich wieder­ holender AufgabensteIlungen aus den genannten Fachgebieten interessiert sind. Studenten an Technischen Hochschulen und Fachhochschulen erhalten einen Einblick in die Möglichkeiten und Grenzen der Anwendung programmierbarer Taschenrechner. Dem Leser wird ein Nachschlagefundus mit Beispielen für programmierte Aufgabenlösungen prak­ tischer Anwendungsfälle in die Hand gegeben. Die hierbei gegebenen Programmierhinweise haben den Zweck, die Ausarbeitung spezieller, auf die eigene Problemstellung zugeschnittene Programme zu erleichtern. Zu den AufgabensteIlungen werden die mathematischen und vertragsrechtlichen Grundlagen nur soweit dargestellt, wie es zur Programmierung des Lösungsalgorithmus erforderl ich ist. Zum tieferen Eindringen in die jeweilige Thematik wird auf die vorhandene Fachliteratur verwiesen. Die angegebenen Programme sind auf die Rechner HP 67, HP 97 und HP 41 C für UPN-Technik mit Magnetkartenleser und ggf. Thermodrucker zugeschnitten. Mit Hilfe der angegebenen Lösungs­ gleichungen und den Hinweisen zu der jeweiligen Programmstruktur sind die Programme jedoch auch auf andere Rechnersysteme übertragbar. Der Verfasser geht davon aus, daß die den Rechnern aller Systeme zugehörigenBedienungshandbücher und die hierzu vorliegende Sekundärliteratur alle Fragen zur eigentlichen Bedienung und praktischen Einübung umfassend beantworten.

Die mit dem Gebiet der angewandten Mathematik und Finanzmathematik in Band 1 begonnene und mit Anwendungsproblemen auf dem Gebiet der Allgemeinen Elektrotechnik mit Band 2 fort­ gesetzte Reihe "Anwendung programmierbarer Taschenrechner" wird mit dem vorliegenden Band um die Fachgebiete Elektrische Energietechnik, Steuerungstechnik und Elektrizitätswirtschaft erweitert. Dieser Band wendet sich insbesondere an Ingenieure in Energieversorgungsunternehmen (EVU's) und Industrieunternehmen, die an einer rationellen und systematischen Bearbeitung sich wieder­ holender AufgabensteIlungen aus den genannten Fachgebieten interessiert sind. Studenten an Technischen Hochschulen und Fachhochschulen erhalten einen Einblick in die Möglichkeiten und Grenzen der Anwendung programmierbarer Taschenrechner. Dem Leser wird ein Nachschlagefundus mit Beispielen für programmierte Aufgabenlösungen prak­ tischer Anwendungsfälle in die Hand gegeben. Die hierbei gegebenen Programmierhinweise haben den Zweck, die Ausarbeitung spezieller, auf die eigene Problemstellung zugeschnittene Programme zu erleichtern. Zu den AufgabensteIlungen werden die mathematischen und vertragsrechtlichen Grundlagen nur soweit dargestellt, wie es zur Programmierung des Lösungsalgorithmus erforderl ich ist. Zum tieferen Eindringen in die jeweilige Thematik wird auf die vorhandene Fachliteratur verwiesen. Die angegebenen Programme sind auf die Rechner HP 67, HP 97 und HP 41 C für UPN-Technik mit Magnetkartenleser und ggf. Thermodrucker zugeschnitten. Mit Hilfe der angegebenen Lösungs­ gleichungen und den Hinweisen zu der jeweiligen Programmstruktur sind die Programme jedoch auch auf andere Rechnersysteme übertragbar. Der Verfasser geht davon aus, daß die den Rechnern aller Systeme zugehörigenBedienungshandbücher und die hierzu vorliegende Sekundärliteratur alle Fragen zur eigentlichen Bedienung und praktischen Einübung umfassend beantworten.

The Symposium on Theoretical Aspects of Computer Science (STACS) is - ternately held in France and Germany. The latest conference, February 27 to March 1, 2003 at the Institute of Computer Science, Freie Universit. at Berlin is the twentieth in this series. The previous meetings took place in Paris (1984), Saarbruc .. ken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Wurzburg .. (1993), Caen (1994), Munc .. hen (1995), Grenoble (1996), Lub .. eck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), and Antibes/Juan-les-Pins (2002). Unlike some other important theory conferences STACS covers the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, and current challenges like biological computing, quantum computing, and mobile and net computing. The interest in STACS has been increasing continuously during recent years and has turned it into one of the most signi?cant conferences in theoretical computer science.The STACS 2003 call for papers led to a record number of 253 submissions from all over the world.

This book is based on a graduate education program on computational discrete mathematics run for several years in Berlin, Germany, as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics.The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the areas covered are combinatorics, graph theory, coding theory, discrete and computational geometry, optimization, and algorithmic aspects of algebra.

The Symposium on Theoretical Aspects of Computer Science (STACS) has - come one of the most important annual meetings in Europe for the theoretical computer science community. It covers a wide range of topics in the area of - undationsofcomputerscience:algorithmsanddatastructures,automataand formal languages, computational and structural complexity, logic, veri?cation, and current challenges. STACS 2002, the 19th in this series, was held in Antibes - Juan les Pins, on the French Riviera, March 14-16, 2002. Previous STACS symposia took place in Paris (1984), Saarbruc .. ken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Wurzburg .. (1993), Caen (1994), Munc .. hen (1995), Grenoble (1996), Lub .. eck (1997), Paris, (1998), Trier (1999), Lille (2000), and Dresden (2001). The proceedings of all these symposia have been published in the Lecture Notes in Computer Science series of Springer-Verlag. STACS 2002 received 209 submissions from 30 countries, one of the highest numbers of submissions ever, for a European conference on theoretical computer science.They were dispatched to the Program Committee members, and - derwent a thorough review process, where more than 900 reports were written. These reports then served as guidance to the Program Committee, which met on November 16-17, 2001, at the INRIA Sophia Antipolis (near Antibes), France, in order to select the conference program.

This book is based on a graduate education program on computational discrete mathematics run for several years in Berlin, Germany, as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics.The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the areas covered are combinatorics, graph theory, coding theory, discrete and computational geometry, optimization, and algorithmic aspects of algebra.

Hinter vielen Programmen stecken clevere Verfahren, die man als Algorithmen bezeichnet. Algorithmen lösen nicht nur mathematische Aufgaben, die sich mit Zahlen beschäftigen, sondern auch andere, ganz alltägliche Problemstellungen, bei denen logischer Spürsinn, räumliche Orientierung oder geschicktes Verhandeln gefragt sind, beispielsweise: Wie sollten Seeräuber eine Schatzkarte aufteilen, bzw. Bankangestellte den Geheimcode des Tresors? Wie ermittle ich den kürzesten Weg zwischen zwei Orten? Wie kann ich einen Kuchen gerecht aufteilen? Dieses Buch vollführt einen Streifzug durch die faszinierende Welt der Algorithmen. Es verlangt keine Vorkenntnisse, so dass Schüler ab der Mittelstufe und Informatik-interessierte Laien neue und überraschende Einblicke gewinnen können. In 43 Artikeln von Informatikern, die an Universitäten im In- und Ausland lehren, werden besonders elegante Algorithmen anschaulich und umgangssprachlich erklärt, so dass die besondere Faszination der Informatik spürbar wird.

"E?ziente Algorithmen" was the title of the ?rst book by Kurt Mehlhorn in 1977. It was meant as a text for graduate students and published in German by Teubner-Verlag. We decided to adopt this title 32 years later for this Festschrift in honor of Kurt on the occasion of his 60th birthday. It contains contributions by his former PhD students, many of whom are now university teachers themselves, and colleagues with whom he cooperated closely within his career. It is our pleasure that even Kurt's former PhD advisor, Bob Constable from Cornell University,kindlyagreedtocontribute.Manyofthecontributionswerepresented at a colloquium held in Kurt's honor on August 27 and 28, 2009 in Saarbrucken, Germany. This Festschriftshowsclearlyhowthe ?eld ofalgorithmicshas developedand matured in the decades since Kurt wrote his book with the same title. The classic approach based on discrete mathematics and computability and complexity theory continues to be the foundation of the ?eld with ever new and important challenges as the ?rst chapters of this Festschrift show. Kurt has contributed signi?cantly to classical algorithmics and gained worldwide repu- tion.Starting from research in computability theory in his PhD thesis he made major contributions to complexity theory, graph algorithms, data structures, and was one of the ?rst to recognize the signi?cance of computational geometry contributing one of the early textbooks on the subject.

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of amaze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity – the skills needed for the design and analysis of algorithms.In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of amaze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity – the skills needed for the design and analysis of algorithms.In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of amaze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity – the skills needed for the design and analysis of algorithms.In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.