Michael soltys kulinicz (21 risultati)
- Brossura
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,26
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 46,07
EUR 4,82 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 54,69
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. Illustrated. This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance,…are employed in the framework of pre/post-conditions and loop invariants.The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide and Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions.This self-contained book is intended for undergraduate students in computer science and mathematics.
- Rilegato
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 67,84
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 66,85
EUR 5,81 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: BGV Books LLC, Murray, KY, U.S.A.BGV Books LLC
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Buono
EUR 74,49
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Condizione: Good. Exact ISBN match. Immediate shipping. No funny business.
- Rilegato
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 108,05
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 112,51
EUR 5,81 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 50,52
EUR 75,29 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. Illustrated. This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance,…are employed in the framework of pre/post-conditions and loop invariants.The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide and Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions.This self-contained book is intended for undergraduate students in computer science and mathematics.
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 115,60
EUR 13,88 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Rilegato
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 136,62
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 147,31
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. A successor to the first and second editions, this updated and revised book is a leading companion guide for students and engineers alike, specifically software engineers who design algorithms. While succinct, this edition is mathematically rigorous, covering the foundations for both computer scientist…s and mathematicians with interest in the algorithmic foundations of Computer Science.Besides expositions on traditional algorithms such as Greedy, Dynamic Programming and Divide and Conquer, the book explores two classes of algorithms that are often overlooked in introductory textbooks: Randomised and Online algorithms - with emphasis placed on the algorithm itself. The book also covers algorithms in Linear Algebra, and the foundations of Computation.The coverage of Randomized and Online algorithms is timely: the former have become ubiquitous due to the emergence of cryptography, while the latter are essential in numerous fields as diverse as operating systems and stock market predictions.While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds, as well as all the necessary mathematical foundations. The programming exercises in Python will be available on the web (see www.msoltys.com/book for the companion web site).
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 160,51
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
Hardback. Condizione: New. An Introduction to the Analysis of Algorithms is a comprehensive textbook that presents the fundamental methods for designing and analyzing computational algorithms through rigorous mathematical frameworks and practical implementation guidance. The book systematically explores major algorithmic paradig…ms including greedy algorithms, divide and conquer, dynamic programming, online algorithms, randomized algorithms, and parallel algorithms in linear algebra, providing detailed analysis of correctness and performance for each approach.The text emphasizes algorithm design techniques and formal analysis using pre/post-conditions and loop invariants, while covering essential computational foundations including automata theory, regular expressions, and complexity analysis. A new chapter on machine learning introduces students to this rapidly growing field, covering both supervised learning methods like regression and classification, and unsupervised techniques such as clustering, providing a bridge between traditional algorithmic thinking and modern data-driven approaches. The book also addresses practical considerations such as algorithm implementation, optimization techniques, and real-world applications across various domains.Intended for undergraduate and graduate students in computer science and mathematics, the self-contained presentation includes all necessary background material, worked examples, and extensive problem sets, making it suitable as both a classroom textbook and a comprehensive reference for anyone seeking to master algorithmic problem-solving and analysis.
- Rilegato
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 145,56
EUR 28,96 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Rilegato
Da: Revaluation Books, Exeter, , Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 180,69
EUR 14,48 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 416 pages. 6.00x0.78x9.00 inches. In Stock.
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 138,55
EUR 75,29 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. A successor to the first and second editions, this updated and revised book is a leading companion guide for students and engineers alike, specifically software engineers who design algorithms. While succinct, this edition is mathematically rigorous, covering the foundations for both computer scientist…s and mathematicians with interest in the algorithmic foundations of Computer Science.Besides expositions on traditional algorithms such as Greedy, Dynamic Programming and Divide and Conquer, the book explores two classes of algorithms that are often overlooked in introductory textbooks: Randomised and Online algorithms - with emphasis placed on the algorithm itself. The book also covers algorithms in Linear Algebra, and the foundations of Computation.The coverage of Randomized and Online algorithms is timely: the former have become ubiquitous due to the emergence of cryptography, while the latter are essential in numerous fields as diverse as operating systems and stock market predictions.While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds, as well as all the necessary mathematical foundations. The programming exercises in Python will be available on the web (see www.msoltys.com/book for the companion web site).
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 155,88
EUR 75,29 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
Hardback. Condizione: New. An Introduction to the Analysis of Algorithms is a comprehensive textbook that presents the fundamental methods for designing and analyzing computational algorithms through rigorous mathematical frameworks and practical implementation guidance. The book systematically explores major algorithmic paradig…ms including greedy algorithms, divide and conquer, dynamic programming, online algorithms, randomized algorithms, and parallel algorithms in linear algebra, providing detailed analysis of correctness and performance for each approach.The text emphasizes algorithm design techniques and formal analysis using pre/post-conditions and loop invariants, while covering essential computational foundations including automata theory, regular expressions, and complexity analysis. A new chapter on machine learning introduces students to this rapidly growing field, covering both supervised learning methods like regression and classification, and unsupervised techniques such as clustering, providing a bridge between traditional algorithmic thinking and modern data-driven approaches. The book also addresses practical considerations such as algorithm implementation, optimization techniques, and real-world applications across various domains.Intended for undergraduate and graduate students in computer science and mathematics, the self-contained presentation includes all necessary background material, worked examples, and extensive problem sets, making it suitable as both a classroom textbook and a comprehensive reference for anyone seeking to master algorithmic problem-solving and analysis.
Editore: Wspc 2012
- Brossura
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 141,98
EUR 28,96 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Lingua: Inglese
Editore: World Scientific Publishing Co Pte Ltd, Singapore 2026
- Rilegato
- Print on Demand
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 136,61
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: new. Hardcover. An Introduction to the Analysis of Algorithms is a comprehensive textbook that presents the fundamental methods for designing and analyzing computational algorithms through rigorous mathematical frameworks and practical implementation guidance. The book systematically explores major algorit…hmic paradigms including greedy algorithms, divide and conquer, dynamic programming, online algorithms, randomized algorithms, and parallel algorithms in linear algebra, providing detailed analysis of correctness and performance for each approach.The text emphasizes algorithm design techniques and formal analysis using pre/post-conditions and loop invariants, while covering essential computational foundations including automata theory, regular expressions, and complexity analysis. A new chapter on machine learning introduces students to this rapidly growing field, covering both supervised learning methods like regression and classification, and unsupervised techniques such as clustering, providing a bridge between traditional algorithmic thinking and modern data-driven approaches. The book also addresses practical considerations such as algorithm implementation, optimization techniques, and real-world applications across various domains.Intended for undergraduate and graduate students in computer science and mathematics, the self-contained presentation includes all necessary background material, worked examples, and extensive problem sets, making it suitable as both a classroom textbook and a comprehensive reference for anyone seeking to master algorithmic problem-solving and analysis. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Lingua: Inglese
Editore: World Scientific Publishing Co Pte Ltd, Singapore 2026
- Rilegato
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 162,84
EUR 42,86 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: new. Hardcover. An Introduction to the Analysis of Algorithms is a comprehensive textbook that presents the fundamental methods for designing and analyzing computational algorithms through rigorous mathematical frameworks and practical implementation guidance. The book systematically explores major algorit…hmic paradigms including greedy algorithms, divide and conquer, dynamic programming, online algorithms, randomized algorithms, and parallel algorithms in linear algebra, providing detailed analysis of correctness and performance for each approach.The text emphasizes algorithm design techniques and formal analysis using pre/post-conditions and loop invariants, while covering essential computational foundations including automata theory, regular expressions, and complexity analysis. A new chapter on machine learning introduces students to this rapidly growing field, covering both supervised learning methods like regression and classification, and unsupervised techniques such as clustering, providing a bridge between traditional algorithmic thinking and modern data-driven approaches. The book also addresses practical considerations such as algorithm implementation, optimization techniques, and real-world applications across various domains.Intended for undergraduate and graduate students in computer science and mathematics, the self-contained presentation includes all necessary background material, worked examples, and extensive problem sets, making it suitable as both a classroom textbook and a comprehensive reference for anyone seeking to master algorithmic problem-solving and analysis. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Lingua: Inglese
Editore: World Scientific Publishing Co Pte Ltd, Singapore 2026
- Rilegato
- Print on Demand
Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 202,96
EUR 32,08 spedizioneSpedito da Australia a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: new. Hardcover. An Introduction to the Analysis of Algorithms is a comprehensive textbook that presents the fundamental methods for designing and analyzing computational algorithms through rigorous mathematical frameworks and practical implementation guidance. The book systematically explores major algorit…hmic paradigms including greedy algorithms, divide and conquer, dynamic programming, online algorithms, randomized algorithms, and parallel algorithms in linear algebra, providing detailed analysis of correctness and performance for each approach.The text emphasizes algorithm design techniques and formal analysis using pre/post-conditions and loop invariants, while covering essential computational foundations including automata theory, regular expressions, and complexity analysis. A new chapter on machine learning introduces students to this rapidly growing field, covering both supervised learning methods like regression and classification, and unsupervised techniques such as clustering, providing a bridge between traditional algorithmic thinking and modern data-driven approaches. The book also addresses practical considerations such as algorithm implementation, optimization techniques, and real-world applications across various domains.Intended for undergraduate and graduate students in computer science and mathematics, the self-contained presentation includes all necessary background material, worked examples, and extensive problem sets, making it suitable as both a classroom textbook and a comprehensive reference for anyone seeking to master algorithmic problem-solving and analysis. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
