Fundamentals of Algorithmics

Book Description

This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application.

Customer Reviews:

The most outstanding book in my entire collection.......2006-01-05

I took the class IFT2121 given by Gilles Brassard, and thanks that we had book which is so well done and complete.
People misunderstand sometime the nature of this book. This book is not about providing algorithm recipe but to teach you the methods used to analyze the performance of algorithms.
Gilles Brassard is an outsanding teacher, he is very sharp, he knows his stuff inside out, and his book is a master piece!

Too conversational.......2002-10-14

The reason I dislike this book is that it is written in a conversational style, which is very hard to follow. Being a beginner at this, it would be much more helpful if things were separated and clearly emphasized step by step. This book makes it difficult because all proofs are written into a big block of a paragraph. I normally have taken an hour or so to decode a paragraph so that I can say "Oh! That's what he meant." The content is good- layout is bad.

Too conversational.......2002-10-14

This book should be given a rating lower, if it were possible. The reason I dislike this book is that it is written in a conversational style, which is very hard to follow. Being a beginner at this, it would be much more helpful if things were separated and clearly emphasized step by step. This book makes it difficult because all proofs are written into a big block of a paragraph. I normally have taken an hour or so to decode a paragraph so that I can say "Oh! That's what he meant." The content is good- layout is bad.

Great as a supplement or reference, not as an introduction.......2002-06-04

This is a good book - far better than an average rating of 2 stars
would suggest. However, i think a big reason for such a rating is
that it's supposed to be an introductory textbook (as claimed by the
authors in the preface), and from that point of view, it leaves much
to be desired.

The presentation is such that it can be difficult for first-timers to
follow, and many topics are simply absent, e.g. network flows.

On the other hand, those already familiar with the material will find
it quite readable and handy as a reference or for brushing up.

The authors choose to present algorithms from a design point of view,
ie greedy approach, divide-and-conquer, bactracking, dynamic programming
etc instead of the traditional way of presenting algorithms for solving
a class of problems, e.g searching, sorting, graph algorithms and so on.

While this is good for those who're already familiar with the traditional
approach and also offers a unified view of problem-solving strategies in
Algorithmics, it is decidedly easier for the beginning student to have (e.g)
all sorting algorithms in one place than to discover that they're scattered
across different chapters.

All algorithms are presented in pseudocode, and are thus have no
programming language dependencies. A healthy number of solved examples
have been provided, and unsolved problems are numerous.

In summary, i think this is quite a good book for practitioners, researchers
and those doing an advanced course in Algorithms, whereas it may not be
suitable for an introductory course (except, perhaps, as a supplement).

Fundamentals of Algorithmics.......2002-03-22

Wow...I don't understand how this book can be used in an introductory course to algortithm analysis. I can see where readers with a great deal of mathematical skill would like this book, because that is the only way you are going to understand any of it. There are too many instances where the authors gloss over their explanations, saying that the answer is "Easily derived". If you have a Ph.D in Mathematics and an entry level skill of programming you might like this book. Otherwise, avoid it all cost.

The Algorithmic Resolution of Diophantine Equations: A Computational Cookbook (London Mathematical Society Student Texts)

Average customer rating:

The Algorithmic Resolution of Diophantine Equations: A Computational Cookbook (London Mathematical Society Student Texts)
Nigel P. Smart
Manufacturer: Cambridge University Press
ProductGroup: Book
Binding: Paperback

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
ASIN: 0521646332

Book Description

Beginning with a brief introduction to algorithms and diophantine equations, this volume provides a coherent modern account of the methods used to find all the solutions to certain diophantine equations, particularly those developed for use on a computer. The study is divided into three parts, emphasizing approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems that can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers interested in solving diophantine equations using computational methods.

Probabilistic Methods for Algorithmic Discrete Mathematics (Algorithms and Combinatorics)

Average customer rating:

Probabilistic Methods for Algorithmic Discrete Mathematics (Algorithms and Combinatorics)

Manufacturer: Springer
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

Look Inside Science Books | Trip | Specialty Stores | Books

All Amazon Upgrade | Amazon Upgrade | Stores | Books

Computers & Internet | Amazon Upgrade | Stores | Books

Professional & Technical | Amazon Upgrade | Stores | Books

Science | Amazon Upgrade | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 3540646221

Book Description

The book gives an accessible account of modern probabilistic methods for analyzing combinatorial structures and algorithms. It will be an useful guide for graduate students and researchers.
Special features included: a simple treatment of Talagrand's inequalities and their applications; an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms; a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods); a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to exploit the structure of the underlying graph; a succinct treatment of randomized algorithms and derandomization techniques.

Average customer rating:

Discrete Math Review
Great Product
A great book with a great teaching approach
Discrete Algorithmic Mathematics

Discrete Algorithmic Mathematics
Stephen B. Maurer , and Anthony Ralston
Manufacturer: AK Peters
ProductGroup: Book
Binding: Hardcover

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

ASIN: 1568811667

Book Description

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology.

Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well.

A complete solution manual will be available to instructors.

Customer Reviews:

Discrete Math Review.......2007-09-21

The book does a good job of providing examples, the few that it does provide. I Would like the book to go into depth a little more and provide multiple examples for a given topic.

Great Product.......2007-09-02

The product was brand new just like it said and shipping was very quick and arrived BEFORE projected date.

A great book with a great teaching approach.......2002-10-26

I found this book to be truly extraordinary. Unlike the overwhelming majority of math texts, the authors describe the material in a manner reminiscent of an informal college lecture by gifted professors. They cover a lot of ground, but explain what's going on and why. I found it particularly striking that the authors sometimes present mistaken approaches to problems, follow them through to show what has gone wrong, and then show how to avoid the mistakes. This is particularly valuable when using the book for self-study. The exercises are carefully chosen and serve to expand on each section's material.

Discrete Algorithmic Mathematics.......2001-07-10

This book is utterly and completely useless. It does not progress in a logical manner. The author assumes you know everything he is talking about, and gives examples filled with topics that are not explained until later chapters. He explains things one way, yet his examples always seem to contradict what he says until you spend a good hour looking at them and realize he always uses some unexplained loophole in logic to derive his answers. This is not a useful book and I never would have bought it if it was not required at the college I attend.

Average customer rating:

Intersting Studies Hampered by LEDA and LP Dependencies

Algorithms on Trees and Graphs
Gabriel Valiente
Manufacturer: Springer
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Graphic Design | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

General | Mathematics | Science | Subjects | Books

Look Inside Computer Books | Trip | Specialty Stores | Books

All Amazon Upgrade | Amazon Upgrade | Stores | Books

Computers & Internet | Amazon Upgrade | Stores | Books

Professional & Technical | Amazon Upgrade | Stores | Books

Science | Amazon Upgrade | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Computers & Internet | Qualifying Textbooks - Fall 2007 | Stores | Books

Professional | Qualifying Textbooks - Fall 2007 | Stores | Books

Science | Qualifying Textbooks - Fall 2007 | Stores | Books
Similar Items:

Accessories:

ASIN: 3540435506

Book Description

Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference

Customer Reviews:

Intersting Studies Hampered by LEDA and LP Dependencies.......2003-12-24

I'm pleased with the text in this book; the descriptions are almost all clear, and reading through the book gives me insight into some more interesting problems in trees and graphs. The high points of the book are its treaments of tree and graph isomorphism, but I also found the discussions of non-traditional traversal algorithms on trees and graphs very interesting. The author discussions leaf-first, breadth-first, and depth-first traversals and provides algorithms for their implementation. Many of the algorithms include correctness proofs.

These topics alone made the book worth its to me. A deep academic book that costs less than $50 is nearly unheared-of.

Unfortunately, there are two flaws that make the book hard to use. In a nutshell, the author expects the reader to buy into a couple of pretty invasive and expensive propositions.

First, the author decided to use literate programming for all of his presented algorithms and code fragments. This isn't so bad, since literate programming is about documenting code. If you suppose that the author wrote the code, then documented it, then calld it a book, using a tool like literate programming seems like a natural choice.

But if you're not familiar with literate programming, it's a bit of a chore. The author's introduction to literate programming doesn't help with some of the questions even an experienced programmer might have wend reading the text. More practically, literate programming enforces operators that are different than most C/C++ developers are familiar with, and can cause confusion when reading the text. ^ is used, for example, to indicate a logical and, where C/C++ developers expect it to indicate a bitwise-exclusive or.

While it's esay to eventually overcome such tricks of memory, I've been finding it hard to scan literate programs to find definitions and declarations. The author doesn't include a CD (and at this cover price, that is hard to fault) but also doesn't make his code available for download. His website includes a LEDA-based program that interactively demonstrates some algorithms, but doesn't include code for the algorithm his own books develops and discusses.

The other decision made by the author, to the overwhelming inconvenience of this reader, is the reliance on the LEDA library for his samples and programs. The algorithms are understandable without the library, but a reader without access to LEDA doesn't benefit from any of the visualizations the author provides. , and several include

In fact, the author spends about 40 pages discussing LEDA and the characteristics of its implementation. Maybe researchers working on tree and graph algorithms all use LEDA and have ready access to it, but the literate programming code provided to for some of the algorithms isn't useful to readers who aren't familiar with LEDA, as researching the definitions and declarations themsleves becomes arduous.

The bibliography is very diverse, with more than 380 entries and is well-cited throughout the book. Unfortunately, the author sometimes relies on the bibliography too much. On page 392, the author brings up "the so-called graph isopomorphism disease" without defining it himself; he instead relies on his bibliography entries to give the user any definition or background on the "disease".

Unfortunately, the index received not nearly as much attention as the bibliography; neglecting whitespace, it's scarcely more than a single page long!

The book appears to be something more than a research paper, but is written much like a research apper would be. The book probably also serves well for a class that teaches this subject, and assumes LEDA and literate programming as prerequisites. But as a commercial developer who's interested in applying advanced graph and tree algorithms to the work I'm doing, I found the book has limited its value by relying on LEDA and applying literate programming.

Book Description

This book constitutes the refereed proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic in August 2004.

The 60 revised full papers presented together with full papers or abstracts of 10 invited talks were carefully reviewed and selected from 167 submissions. The papers are organised in topical sections on graph algorithms, approximation, graphs and complexity, circuits, general complexity, automata, parameterized and kolmogrov complexity, semantics, scheduling, algebraic theory of languages, games, languages, geometry, languages and complexity, quantum computing, and XML.

Fundamental Problems of Algorithmic Algebra

Average customer rating:

Make More Powerful Computer Algebra?

Fundamental Problems of Algorithmic Algebra
Chee Keng Yap
Manufacturer: Oxford University Press, USA
ProductGroup: Book
Binding: Hardcover

General | Programming | Computers & Internet | Subjects | Books

General | Software | Computers & Internet | Subjects | Books

General | Engineering | Professional & Technical | Subjects | Books

General | Science | Subjects | Books

General & Reference | Technology | Science | Subjects | Books

General | Arts & Photography | Subjects | Books

Algorithms | Computer Science & Information Systems | New & Used Textbooks | Stores | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books

Look Inside Computer Books | Trip | Specialty Stores | Books
Similar Items:

Symbolic Integration I: Transcendental Functions (Algorithms and Computation in Mathematics)

ASIN: 0195125169

Book Description

Popular computer algebra systems such as Maple, Macsyma, Mathematica, and REDUCE are now basic tools on most computers. Efficient algorithms for various algebraic operations underlie all these systems. Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics. Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more. Features DT Presents algorithmic ideas in pseudo-code based on mathematical concepts and can be used with any computer mathematics system DT Emphasizes the algorithmic aspects of problems without sacrificing mathematical rigor DT Aims to be self-contained in its mathematical development DT Ideal for a first course in algorithmic or computer algebra for advanced undergraduates or beginning graduate students

Customer Reviews:

Make More Powerful Computer Algebra?.......2004-02-19

There was once a time when computer algebra seems amazingly exotic. Sure, computers could crunch raw numbers. But no surprises there. It was quite another event to see a computer factor a simple algebraic expression, or perform symbolic integration. Wow!

Book Description

This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2001, held in Tokyo, Japan in November 2001. The 35 revised papers presented were carefully reviewed and selected. Among the topics covered are polygons and polyhedrons, divissible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, point sets, approximation, Delauny diagrams, triangulations, chromatic numbers, complexity, layer routing, efficient algorithms, and illumination problems.

Resource Allocation in Wireless Networks: Theory and Algorithms (Lecture Notes in Computer Science)

Average customer rating:

Resource Allocation in Wireless Networks: Theory and Algorithms (Lecture Notes in Computer Science)
Slawomir Stanczak , Marcin Wiczanowski , and Holger Boche
Manufacturer: Springer
ProductGroup: Book
Binding: Paperback

General | Certification Central | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

Programming | Mobile & Wireless Computing | Computers & Internet | Subjects | Books

All Titles | Qualifying Textbooks - Fall 2007 | Stores | Books
ASIN: 3540462481

Book Description

The wireless industry is in the midst of a fundamental shift from providing voice-only services to offering customers an array of multimedia services, including a wide variety of audio, video and data communications capabilities. Future wireless networks will be integrated into every aspect of daily life, and therefore could affect our life in a magnitude similar to that of the Internet and cellular phones.

This monograph demonstrates that these emerging applications and directions require fundamental understanding on how to design and control wireless networks that lies far beyond what the currently existing theory can provide. It is shown that mathematics is the key technology to cope with central technical problems in the design of wireless networks since the complexity of the problem simply precludes the use of engineering common sense alone to identify good solutions.

The main objective of this book is to provide tools for better understanding the fundamental tradeoffs and interdependencies in wireless networks, with the goal of designing resource allocation strategies that exploit these interdependencies to achieve significant performance gains. The book consists of three largely independent parts: theory, applications and appendices. The latter contain foundational apects to make the book more understandable to readers who are not familiar with some basic concepts and results from linear algebra and convex analysis.

Advances in Computer Games: 11th International Conference, ACG 2005, Taipei, Taiwan, September 6-8, 2005. Revised Papers (Lecture Notes in Computer Science)

Average customer rating:

Advances in Computer Games: 11th International Conference, ACG 2005, Taipei, Taiwan, September 6-8, 2005. Revised Papers (Lecture Notes in Computer Science)

Manufacturer: Springer
ProductGroup: Book
Binding: Paperback

History | Business & Culture | Computers & Internet | Subjects | Books

Data Mining | Databases | Computers & Internet | Subjects | Books

General | Computers & Internet | Subjects | Books

Taiwan | Asia | History | Subjects | Books

General | Science | Subjects | Books

General | Mathematics | Science | Subjects | Books

Book Description

This book constitutes the thoroughly refereed post-proceedings of the 11th International Conference on Advances in Computer Games, ACG 2005, held in Taipei, Taiwan, in September 2005 in conjunction with the 10th Computer Olympiad.

The 20 revised full papers presented were carefully selected during two rounds of reviewing and improvement from 32 submissions. The papers cover all aspects of artificial intelligence in computer-game playing. Reasearch topics addressed are automatic generation, optimization, opponent modelling, search, knowledge representation, and graph history interaction. Games covered are western chess, chinese and japanese chess, checkers, lose checkers, amazons, go, poker, loa, mastermind, awari, ataxx, pool, as well as the two theoretical games connect and sumbers.

Books:

Books Index

Books Home

Recommended Books