Ravindran Kannan (Paperback)


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Ravi Kannan is currently a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science. Before joining Microsoft, he was the William K. Lanman Jr. Professor of Computer Science and Professor of Applied Mathematics at Yale University. He has also taught at MIT and CMU. Ravi Kannan did his B.Tech at IIT, Bombay and PhD. at Cornell University. His research interests include Algorithms, Theoretical Computer Science and Discrete Mathematics as well as Optimization. His work has mainly focused on efficient algorithms for problems of a mathematical (often geometric) flavor that arise in Computer Science. He has worked on algorithms for integer programming and the geometry of numbers, random walks in n-space, randomized algorithms for linear algebra and learning algorithms for convex sets.

R886

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles8860
Mobicred@R83pm x 12* Mobicred Info
Free Delivery
Delivery AdviceOut of stock

Toggle WishListAdd to wish list
Review this Item

Product Description

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Ravi Kannan is currently a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science. Before joining Microsoft, he was the William K. Lanman Jr. Professor of Computer Science and Professor of Applied Mathematics at Yale University. He has also taught at MIT and CMU. Ravi Kannan did his B.Tech at IIT, Bombay and PhD. at Cornell University. His research interests include Algorithms, Theoretical Computer Science and Discrete Mathematics as well as Optimization. His work has mainly focused on efficient algorithms for problems of a mathematical (often geometric) flavor that arise in Computer Science. He has worked on algorithms for integer programming and the geometry of numbers, random walks in n-space, randomized algorithms for linear algebra and learning algorithms for convex sets.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Betascript Publishing

Country of origin

Germany

Release date

March 2011

Availability

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

First published

March 2011

Editors

, ,

Dimensions

152 x 229 x 1mm (L x W x T)

Format

Paperback - Trade

Pages

18

ISBN-13

978-6135133035

Barcode

9786135133035

Categories

LSN

6135133039



Trending On Loot