Search for Author All Reviews
	Upfal, Eli     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 11 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     A general approach to dynamic packet routing with bounded buffers Broder A., Frieze A., Upfal E. Journal of the ACM 48(2): 324-349, 2001.  Type: Article Dynamic packet routing in networks with bounded buffers at the switching nodes is considered. This paper accurately models the real network. The analysis of routing algorithms has previously been largely focused on static routing; ther...... Jul 1 2001     A Theory of Wormhole Routing in Parallel Computers Felperin S., Raghavan P., Upfal E. IEEE Transactions on Computers 45(6): 704-713, 1996.  Type: Article The performance of a delayed greedy wormhole routing algorithm on butterfly networks and mesh-connected networks is investigated. In the routing algorithm, each message waits at the source for a random period of time chosen from a spec...... Apr 1 1998     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy