Revision as of 01:43, 7 March 2019 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,587 edits m Reverted edits by 2600:1014:B046:964B:8137:E95B:FB12:341E (talk) to last version by Allopathie Tag: Rollback ← Previous edit		Revision as of 21:10, 12 May 2019 edit undo Josve05a (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers, Pending changes reviewers, Rollbackers 157,544 edits →References: \| Alter: author, isbn. Add: author-link, year, pages, issue, volume, journal, title, doi, author pars. 1-1. Removed URL that duplicated unique identifier. Formatted dashes. \| You can use this tool yourself. Report bugs here. Next edit →
Line 197: * Dirk Draheim. [https://www.springer.com/de/book/9783642551970 "''Semantics of the Probabilistic Typed Lambda Calculus (Markov Chain Semantics, Termination Behavior, and Denotational Semantics).''"] Springer, 2017. * [[Jon Kleinberg]] and [[Éva Tardos]]. ''Algorithm Design''. Chapter 13: "Randomized algorithms". * ~~Don~~{{cite ~~Fallis.~~journal\|doi ~~2000.~~= ~~[https://dx.doi.org/~~10.1093/bjps/51.2.255\|title = "The ~~Reliability~~reliability of ~~Randomized~~randomized ~~Algorithms."]~~algorithms\|journal = The ''British Journal for the Philosophy of Science''\|volume = 51~~:255–71~~\|issue = 2\|pages = 255–271\|year = 2000\|last1 = Fallis\|first1 = D.}} * [[Michael Mitzenmacher\|M. Mitzenmacher]] and [[Eli Upfal\|E. Upfal]]. ''Probability and Computing: Randomized Algorithms and Probabilistic Analysis''. Cambridge University Press, New York (NY), 2005. * [[Rajeev Motwani]] and P. Raghavan. ''Randomized Algorithms''. Cambridge University Press, New York (NY), 1995. * Rajeev Motwani and P. Raghavan. [http://portal.acm.org/citation.cfm?id=234313.234327 Randomized Algorithms.] A survey on Randomized Algorithms. * {{Citation\|author = [[Christos Papadimitriou]] \| year = 1993 \| title = Computational Complexity \| publisher = Addison Wesley \| edition = 1st \| isbn = 978-0-201-53082-17\| author-link = Christos Papadimitriou }} Chapter 11: Randomized computation, pp. 241–278. * M. O. Rabin (1980), ''[https://www.sciencedirect.com/science/article/pii/0022314X80900840/pdf?md5=6f748cd82fa8efa1a637efab5f632baa&pid=1-s2.0-0022314X80900840-main.pdf&_valck=1 Probabilistic Algorithm for Testing Primality]'', Journal of Number Theory, 12:128–38. * A. A. Tsay, W. S. Lovejoy, David R. Karger, ''Random Sampling in Cut, Flow, and Network Design Problems'', Mathematics of Operations Research, 24(2):383–413, 1999.

Randomized algorithm: Difference between revisions