Search for Author All Reviews
	Mitzenmacher, Michael     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 4 of 4 reviews       Probability and computing: randomization and probabilistic techniques in algorithms and data analysis (2nd ed.) Mitzenmacher M., Upfal E., Cambridge University Press, New York, NY, 2017. 484 pp.  Type: Book (978-1-107154-88-9), Reviews: (2 of 2) Probability in computer science plays the same role as in physics: while there is a large corpus of theories and methodologies based on a purely deterministic underpinning, the introduction of probability opens the door to a vast field...... Jul 10 2018     Probability and computing: randomization and probabilistic techniques in algorithms and data analysis (2nd ed.) Mitzenmacher M., Upfal E., Cambridge University Press, New York, NY, 2017. 484 pp.  Type: Book (978-1-107154-88-9), Reviews: (1 of 2) It is one of the great paradoxes of modern science that useful computation can be done by making random choices. This insight would be impressive even if the computation in question were contrived, but in many cases probabilistic algor...... Mar 15 2018     Probability and computing: randomized algorithms and probabilistic analysis Mitzenmacher M., Upfal E., Cambridge University Press, New York, NY, 2005. 368 pp.  Type: Book (9780521835404) Randomization and probabilistic techniques are important in many disciplines, especially computer science. Often, randomized algorithms are the simplest, the fastest, or both. They are applied in a number of domains, such as combinator...... Sep 30 2005     Towards more complex models of TCP latency and throughput Mitzenmacher M., Rajaraman R. The Journal of Supercomputing 20(2): 137-160, 2001.  Type: Article The primary issues in analyzing transmission control protocol (TCP) behavior are the complexities of the TCP itself, and of its interactions with a network. To determine the efficacy of a model, one must isolate its simplifying assumpt...... Apr 18 2003
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy