Concentration of Measure for Computer Science Applications Hardback - Tapa dura

Dubhashi; Panconesi

 
9780521884273: Concentration of Measure for Computer Science Applications Hardback
Tapa dura
ISBN 10: 0521884276 ISBN 13: 9780521884273
Editorial: Cambridge University Press, 2009

Sinopsis

Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of such algorithms. The presentation emphasizes discrete settings and elementary notions of probability, making it accessible to computer scientists and applied discrete mathematicians.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca de los autores

Devdatt P. Dubhashi is Professor in the Department of Computer Science and Engineering at Chalmers University, Sweden. He earned a Ph.D. in computer science from Cornell University and held positions at the Max-Planck-Institute for Computer Science in Saarbruecken, BRICS, the University of Aarhus and IIT Delhi. Dubhashi has published widely at international conferences and in journals, including many special issues dedicated to best contributions. His research interests span the range from combinatorics to probabilistic analysis of algorithms, and more recently, to computational systems biology and distributed information systems such as the Web.

Alessandro Panconesi is Professor of Computer Science at Sapienza University of Rome. He earned a Ph.D. in computer science from Cornell University and is the recipient of the 1992 ACM Danny Lewin Award. Panconesi has published more than 50 papers in international journals and selective conference proceedings and he is the associate editor of the Journal of Discrete Algorithms and the director of BiCi, the Bertinoro International Center of Informatics. His research spans areas of algorithmic research as diverse as randomized algorithms, distributed computing, complexity theory, experimental algorithmics, wireless networking and Web information retrieval.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Cambridge University Press
Año de publicación
2009
Idioma
Inglés
ISBN 10 
0521884276
ISBN 13 
9780521884273
Encuadernación
Tapa dura
Número de edición
1
Número de páginas
216
Contacto del fabricante
Cambridge University Press
https://www.cambridge.org/

Via Honduras,15
Pomezia
Italia
71
Italia

Otras ediciones populares con el mismo título

9781107606609: Concentration of Measure for the Analysis of Randomized Algorithms

Edición Destacada

ISBN 10:  1107606608 ISBN 13:  9781107606609
Editorial: Cambridge University Press, 2012
Tapa blanda