Design and Analysis of Algorithms : A Contemporary Perspective

Sen, Sandeep; Kumar, Amit

ISBN 10: 1108496822 / ISBN 13: 9781108496827

Editore: Cambridge University Press, 2019

Riguardo questo articolo

Unread book in perfect condition.

Codice articolo 33220070

Dati bibliografici

• Titolo: Design and Analysis of Algorithms : A Contemporary Perspective
• Editore: Cambridge University Press
• Data di pubblicazione: 2019
• Lingua: Inglese
• ISBN 10: 1108496822
• ISBN 13: 9781108496827
• Rilegatura: Rilegato
• Condizione: As New

Descrizione articolo

Riassunto

Focuses on the interplay between algorithm design and the underlying computational models.

Informazioni sugli autori

Sandeep Sen is Professor in the department of Computer Science and Engineering, Indian Institute of Technology (IIT), Delhi. He received his Ph.D. from Duke University, North Carolina, and M.S. from University of California, Santa Barabara. Prior to joining IIT Delhi, he served as a post-doctoral researcher at Bell Laboratories, Murray Hill, New Jersey and at Duke University, North Carolina. He served as visiting researcher at many reputed institutes including Max-Planck-Institut für Informatik, Germany, IBM Research Lab, Microsoft Research Lab, University of Newcastle, Australia, University of North Carolina, Chapel Hill, University of Connecticut and Simon Fraser University, Vancouver. With more than twenty-five years of teaching experience, his areas of interest include randomized algorithms, computational geometry and graph algorithms.

Amit Kumar is Professor in the department of Computer Science and Engineering, Indian Institute of Technology (IIT) Delhi. He received his Ph.D. from Cornell University, New York. Prior to joining IIT Delhi, he worked as a member of technical staff at Bell Laboratories, New Jersey and has held several visiting professor positions at Microsoft Research India, IBM Research India and Max-Planck-Institut für Informatik, Germany. He has published over eighty research articles and holds five patents. His areas of interest include design of algorithms, approximation algorithms, computer networks and network management and routing.