Pearls algorithm engineering von ferragina paolo (14 Ergebnisse)

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

hardcover. Zustand: Fine. Orders shipped daily from the UK. Professional seller.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Hardcover. Zustand: Brand New. 326 pages. 9.61x6.69x0.75 inches. In Stock.

Zustand: New. &Uumlber den AutorPaolo Ferragina is Professor of Algorithms at the University of Pisa, with a post-doc at the Max-Planck Institute for Informatics. He served his university as Vice Rector for ICT (2019-22) and for Applied Research and .

Buch. Zustand: Neu. Neuware - There are many textbooks on algorithms focusing on big-O notation and basic design principles. This book offers a unique approach to taking the design and analyses to the level of predictable practical efficiency, discussing core and classic algorithmic problems that arise in the development of big data applications, and presenting elegant solutions of increasing sophistication and efficiency. Solutions are analyzed within the classic RAM model, and the more practically significant external-memory model that allows one to perform I/O-complexity evaluations. Chapters cover various data types, including integers, strings, trees, and graphs, algorithmic tools such as sampling, sorting, data compression, and searching in dictionaries and texts, and lastly, recent developments regarding compressed data structures. Algorithmic solutions are accompanied by detailed pseudocode and many running examples, thus enriching the toolboxes of students, researchers, and professionals interested in effective and efficient processing of big data.…

Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.

Hardcover. Zustand: new. Hardcover. There are many textbooks on algorithms focusing on big-O notation and basic design principles. This book offers a unique approach to taking the design and analyses to the level of predictable practical efficiency, discussing core and classic algorithmic problems that arise in the development of big data applications, and presenting elegant solutions of increasing sophistication and efficiency. Solutions are analyzed within the classic RAM model, and the more practically significant external-memory model that allows one to perform I/O-complexity evaluations. Chapters cover various data types, including integers, strings, trees, and graphs, algorithmic tools such as sampling, sorting, data compression, and searching in dictionaries and texts, and lastly, recent developments regarding compressed data structures. Algorithmic solutions are accompanied by detailed pseudocode and many running examples, thus enriching the toolboxes of students, researchers, and professionals interested in effective and efficient processing of big data. This book provides students, researchers and professionals working in big data applications with solutions to core algorithmic problems, analyzed within RAM and external-memory models of computation. Pseudocode and running examples deal with various data types, and algorithmic tools for sampling, sorting, search, and data compression are included. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…