Full Product Details
Author: Francesco Bullo ,
Jorge Cortés ,
Sonia Martínez
Publisher: Princeton University Press
Imprint: Princeton University Press
Volume: 27
Dimensions:
Width: 17.80cm
, Height: 2.30cm
, Length: 25.40cm
Weight: 0.851kg
ISBN: 9780691141954
ISBN 10: 0691141959
Pages: 320
Publication Date: 26 July 2009
Audience:
College/higher education
,
Professional and scholarly
,
General/trade
,
Tertiary & Higher Education
,
Professional & Vocational
Format: Hardback
Publisher's Status: Active
Availability: Temporarily unavailable
The supplier advises that this item is temporarily unavailable. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out to you.
Language: English
Reviews
The order of presentation makes much sense, and the book thoroughly covers what it sets out to cover. The algorithms and results are presented using a clear mathematical and computer science formalism, which allows a uniform presentation. The formalism used and the way of presenting the algorithms may be helpful for structuring the presentation of new algorithms in the future. -Vincent Blondel, Universite catholique de Louvain The authors do an excellent job of clearly describing the problems and presenting rigorous, provably correct algorithms with complexity bounds for each problem. The authors also do a fantastic job of providing the mathematical insight necessary for such complex problems. -Ali Jadbabaie, University of Pennsylvania This book covers its subject very thoroughly. The framework the authors have established is very elegant and, if it catches on, this book could be the primary reference for this approach. I don't know of any other book that covers this set of topics. -Richard M. Murray, California Institute of Technology
"""This book covers its subject very thoroughly. The framework the authors have established is very elegant and, if it catches on, this book could be the primary reference for this approach. I don't know of any other book that covers this set of topics.""—Richard M. Murray, California Institute of Technology ""The authors do an excellent job of clearly describing the problems and presenting rigorous, provably correct algorithms with complexity bounds for each problem. The authors also do a fantastic job of providing the mathematical insight necessary for such complex problems.""—Ali Jadbabaie, University of Pennsylvania ""The order of presentation makes much sense, and the book thoroughly covers what it sets out to cover. The algorithms and results are presented using a clear mathematical and computer science formalism, which allows a uniform presentation. The formalism used and the way of presenting the algorithms may be helpful for structuring the presentation of new algorithms in the future.""—Vincent Blondel, Université catholique de Louvain"
This book covers its subject very thoroughly. The framework the authors have established is very elegant and, if it catches on, this book could be the primary reference for this approach. I don't know of any other book that covers this set of topics. -Richard M. Murray, California Institute of Technology The order of presentation makes much sense, and the book thoroughly covers what it sets out to cover. The algorithms and results are presented using a clear mathematical and computer science formalism, which allows a uniform presentation. The formalism used and the way of presenting the algorithms may be helpful for structuring the presentation of new algorithms in the future. -Vincent Blondel, Universite catholique de Louvain The authors do an excellent job of clearly describing the problems and presenting rigorous, provably correct algorithms with complexity bounds for each problem. The authors also do a fantastic job of providing the mathematical insight necessary for such complex problems. -Ali Jadbabaie, University of Pennsylvania
The order of presentation makes much sense, and the book thoroughly covers what it sets out to cover. The algorithms and results are presented using a clear mathematical and computer science formalism, which allows a uniform presentation. The formalism used and the way of presenting the algorithms may be helpful for structuring the presentation of new algorithms in the future. --Vincent Blondel, Universit� catholique de Louvain The authors do an excellent job of clearly describing the problems and presenting rigorous, provably correct algorithms with complexity bounds for each problem. The authors also do a fantastic job of providing the mathematical insight necessary for such complex problems. --Ali Jadbabaie, University of Pennsylvania This book covers its subject very thoroughly. The framework the authors have established is very elegant and, if it catches on, this book could be the primary reference for this approach. I don't know of any other book that covers this set of topics. --Richard M. Murray, California Institute of Technology
Author Information
Francesco Bullo is professor of mechanical engineering at the University of California, Santa Barbara. Jorge Cortes is associate professor of mechanical and aerospace engineering at the University of California, San Diego. Sonia Martnez is assistant professor of mechanical and aerospace engineering at the University of California, San Diego.
