Artículos relacionados a Algorithms and Data Structures: The Basic Toolbox

Algorithms and Data Structures: The Basic Toolbox - Tapa blanda

 
9783642096822: Algorithms and Data Structures: The Basic Toolbox

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

Prof. Kurt Mehlhorn was appointed a Fellow of the ACM (1999) "for important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms." A Professor of Computer Science at Saarland University since 1975, and a director of the Max-Planck-Institut für Informatik in Saarbrücken, he has coauthored over 250 refereed papers/articles, in collaboration with 200 researchers. Other awards include the Leibniz Award of the German Research Foundation in 1986 and the Konrad Zuse Medal of the German Society for Informatics in 1995.

Prof. Peter Sanders is a Professor of Computer Science at the University of Karlsruhe. A leading researcher in the area of theoretical and experimental algorithm analysis, in particular related to efficient algorithms for parallel processing and communication in networks, his responsibilities include organizing the European Symposium on Algorithms in Karlsruhe in 2008.

The authors have considerable experience teaching on the topic of algorithms and working on related industrial projects.

"Sobre este título" puede pertenecer a otra edición de este libro.

Comprar usado

Condición: Aceptable
Your purchase helps support Sri...
Ver este artículo

EUR 4,53 gastos de envío desde Reino Unido a España

Destinos, gastos y plazos de envío

Comprar nuevo

Ver este artículo

EUR 11,00 gastos de envío desde Alemania a España

Destinos, gastos y plazos de envío

Otras ediciones populares con el mismo título

Resultados de la búsqueda para Algorithms and Data Structures: The Basic Toolbox

Imagen de archivo

Mehlhorn, Kurt
Publicado por Springer, 2010
ISBN 10: 3642096824 ISBN 13: 9783642096822
Antiguo o usado Tapa blanda

Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Nº de ref. del artículo: Z1-K-004-01786

Contactar al vendedor

Comprar usado

EUR 18,46
Convertir moneda
Gastos de envío: EUR 4,53
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: 3 disponibles

Añadir al carrito

Imagen del vendedor

Peter Sanders
ISBN 10: 3642096824 ISBN 13: 9783642096822
Nuevo Taschenbuch
Impresión bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 312 pp. Englisch. Nº de ref. del artículo: 9783642096822

Contactar al vendedor

Comprar nuevo

EUR 64,19
Convertir moneda
Gastos de envío: EUR 11,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen del vendedor

Kurt Mehlhorn|Peter Sanders
Publicado por Springer Berlin Heidelberg, 2010
ISBN 10: 3642096824 ISBN 13: 9783642096822
Nuevo Tapa blanda
Impresión bajo demanda

Librería: moluna, Greven, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Prof. Kurt Mehlhorn was appointed a Fellow of the ACM (1999) for important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms. A Professor of Computer Science at Saarland University si. Nº de ref. del artículo: 5048682

Contactar al vendedor

Comprar nuevo

EUR 55,78
Convertir moneda
Gastos de envío: EUR 19,49
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Peter Sanders
Publicado por Springer Berlin Heidelberg, 2010
ISBN 10: 3642096824 ISBN 13: 9783642096822
Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783642096822

Contactar al vendedor

Comprar nuevo

EUR 64,19
Convertir moneda
Gastos de envío: EUR 11,99
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen de archivo

Mehlhorn, Kurt; Sanders, Peter
Publicado por Springer, 2010
ISBN 10: 3642096824 ISBN 13: 9783642096822
Nuevo Tapa blanda

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. In. Nº de ref. del artículo: ria9783642096822_new

Contactar al vendedor

Comprar nuevo

EUR 72,74
Convertir moneda
Gastos de envío: EUR 5,18
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen de archivo

Kurt Mehlhorn, Peter Sanders
Publicado por Springer 2010-11-10, 2010
ISBN 10: 3642096824 ISBN 13: 9783642096822
Nuevo Paperback

Librería: Chiron Media, Wallingford, Reino Unido

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783642096822

Contactar al vendedor

Comprar nuevo

EUR 69,15
Convertir moneda
Gastos de envío: EUR 17,29
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: 10 disponibles

Añadir al carrito

Imagen del vendedor

Peter Sanders
ISBN 10: 3642096824 ISBN 13: 9783642096822
Nuevo Taschenbuch

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 312 pp. Englisch. Nº de ref. del artículo: 9783642096822

Contactar al vendedor

Comprar nuevo

EUR 64,19
Convertir moneda
Gastos de envío: EUR 35,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen de archivo

Mehlhorn, Kurt; Sanders, Peter
Publicado por Springer, 2010
ISBN 10: 3642096824 ISBN 13: 9783642096822
Nuevo Tapa blanda

Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020217980

Contactar al vendedor

Comprar nuevo

EUR 61,89
Convertir moneda
Gastos de envío: EUR 64,49
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen de archivo

Mehlhorn, Kurt, Sanders, Peter
Publicado por Springer, 2010
ISBN 10: 3642096824 ISBN 13: 9783642096822
Antiguo o usado Paperback

Librería: Mispah books, Redhill, SURRE, Reino Unido

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Paperback. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA79036420968246

Contactar al vendedor

Comprar usado

EUR 99,80
Convertir moneda
Gastos de envío: EUR 28,84
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito