Martin Dietzfelbinger

Peter Sanders

Kurt Mehlhorn

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.

Die Grundwerkzeuge

Algorithmen und Datenstrukturen

Roman Dementiev

This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. 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, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java.

The Basic Toolbox

Sequential and Parallel Algorithms and Data Structures

This concise introduction is ideal for readers familiar with programming and basic mathematical language. It uses pictures, words and high-level pseudocode to explain algorithms and presents efficient implementations using real programming languages.

Algorithms and Data Structures

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. 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 high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java. The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions.

History and genealogical data about the Sanders family between about 1628 and about 1945 (with some family notes as late as 1988). "'The simple annals' traces the history of the Sanders family from Stansted in rural Essex in the seventeenth century, via Braintree to the harsh but vital life of Bethnal Green in the East End of London during the early decades of this century. The author places the story of this essentially ordinary family firmly in its social, economic and political context, whilst skilfully dovetailing his analysis of relevant manuscript and printed sources with the oral testimony of his older relatives to produce a rich and vivid story" --Back lining paper.

The History of an Essex and East End Family

The Simple Annals

Amos Fiat

This volume contains the papers presented at ESA 2009: The 17th Annual - ropean Symposium on Algorithms, September 7–9, 2009. ESA has been held annually since 1993, and seeks to cover both theoretical and engineering aspects of algorithms. The authors were asked to classify their paper under one or more categories as described in Fig. 1. Since 2001, ESA has been the core of the larger ALGO conference, which typically includes several satellite conferences. ALGO 2009 was held at the IT University of Copenhagen, Denmark. The ?ve members of the ALGO 2009 - ganizing Committee were chaired by Thore Husfeldt. The ESA submission deadline was April 12, Easter Sunday. This was clearly an error and we o?er profuse apologies for this mistake. Albeit no excuse, the hard constraints we faced were (a) ICALP noti?cation, April 6, and (b) ESA in Copenhagen, September 7. Between these two endpoints we needed to design a schedule that allowed modifying ICALP rejections for resubmission (1 week), Program Committee deliberations (7 weeks), preparing ?nal versions (4 weeks), and, to prepare, publish, and transport the proceedings (9 weeks). ESA 2009had 272submissions ofwhich 14 werewithdrawn overtime. Of the remaining 222 submissions to Track A (Design and Analysis), 56 were accepted. Of the remaining 36 submissions to Track B (Engineering and Applications), 10 were accepted. This gives an acceptance rate of slightly under 25%.

17th Annual European Symposium, Copenhagen, Denmark, September 7-9, Proceedings

Algorithms - ESA 2009

This book constitutes the refereed proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009, held in Copenhagen, Denmark, in September 2009 in the context of the combined conference ALGO 2009. The 67 revised full papers presented together with 3 invited lectures were carefully reviewed and selected: 56 papers out of 222 submissions for the design and analysis track and 10 out of 36 submissions in the engineering and applications track. The papers are organized in topical sections on trees, geometry, mathematical programming, algorithmic game theory, navigation and routing, graphs and point sets, bioinformatics, wireless communiations, flows, matrices, compression, scheduling, streaming, online algorithms, bluetooth and dial a ride, decomposition and covering, algorithm engineering, parameterized algorithms, data structures, and hashing and lowest common ancestor.

Ulrich Meyer

Algorithms that have to process large data sets have to take into account that the cost of memory access depends on where the data is stored. Traditional algorithm design is based on the von Neumann model where accesses to memory have uniform cost. Actual machines increasingly deviate from this model: while waiting for memory access, nowadays, microprocessors can in principle execute 1000 additions of registers; for hard disk access this factor can reach six orders of magnitude. The 16 coherent chapters in this monograph-like tutorial book introduce and survey algorithmic techniques used to achieve high performance on memory hierarchies; emphasis is placed on methods interesting from a theoretical as well as important from a practical point of view.

Advanced Lectures

Algorithms for Memory Hierarchies

Johannes Fischer

This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problem or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.

24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013, Proceedings

Combinatorial Pattern Matching

Jop Sibeyn

Zsa-Zsa, Zazu and a Grand Illusion is a fabulous story set in two palaces. The first is The Palace Theatre, where a magician, the Great Gizmo, has gone missing, leaving a pile of debts; the second is a palace, somewhere and sometime in the Orient where a ghastly Dowager Empress has taken over the running in the Emperor’s absence. Trying to remove any trace of the old court, she asks her new magician Malodorous to use the ‘Great Fan of Being and Unbeing’ to annihilate the five ‘Teadragons’ – guardians of the Imperial Treasury. They escape total oblivion with the help of Zazu, the oddest bird you’ll encounter. Back at the theatre, where protagonist Zsa-Zsa has suddenly woken up in a plush seat, some very strange things are happening, with the forced landing of a flying boat and a travelling clock that materializes out of nowhere. All is explained by Obadiah, the stage door hand, by his theory of ‘Wobblement’ – when all the theorems and formulae that govern the known and unknown world just need a rest and go on a break for a while. The two storylines collide in the theatre, where the bird and Zsa-Zsa meet the Emperor, his clockmaker and ethereal engineer, Failsworth, and the loathsome Dowager Empress and her lickspittle Malodorous. Oh yes! And a pantomime horse and some repulsive slugs... Although the story is essentially a fantasy – featuring a travelling clock whizzing through space, a bird unsure whether it’s a machine or an animal, Teadragons who are vaporised on to a rug, a magic fan – it also lets the reader gently question the nature of time and magic in this world or indeed others and whether machines can develop consciousness. Zsa-Zsa, Zazu and a Grand Illusion is a young adult novel, similar in tone to Catherynne M. Valente’s ‘Fairyland’ series, that will appeal to fans of the surreal and the fantastical.

Zsa-Zsa, Zazu and a Grand Illusion

Colin Murray

This book offers some comprehensive answers to difficult, complex and controversial questions on the topic of 'medicine murder'.

Peter Sanders

About

Books

Join the club