This book covers algorithmic problems in big data applications, presenting solutions over hierarchical-memory systems along with pseudocode.
"synopsis" may belong to another edition of this title.
Paolo 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 Innovation (2010–16) and as the Director of the PhD program in Computer Science (2018–20). His research focuses on designing algorithms and data structures for compressing, mining, and retrieving information from big data. The joint recipient of the prestigious 2022 ACM Paris Kanellakis Theory and Practice Award and numerous international awards, Ferragina has previously collaborated with AT&T, Bloomberg, Google, ST microelectronics, Tiscali, and Yahoo. His research has produced several patents and has featured in over 170 papers published in renowned conferences and journals. He has spent research periods at the Max Planck Institute for Informatics, the University of North Texas, the Courant Institute at New York University, the MGH/Harvard Medical School, AT&T, Google, IBM Research, and Yahoo.
"About this title" may belong to another edition of this title.
Seller: SN Books Ltd, Thetford, United Kingdom
hardcover. Condition: Fine. Orders shipped daily from the UK. Professional seller. Seller Inventory # mon0000500785
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 44978411-n
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: 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 multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781009123280
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781009123280
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. Seller Inventory # 26396099068
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 44978411
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Seller Inventory # 401359395
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 326 pages. 9.61x6.69x0.75 inches. In Stock. This item is printed on demand. Seller Inventory # __1009123289
Quantity: 1 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. Seller Inventory # 18396099062
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 44978411-n
Quantity: Over 20 available