TY - JOUR
T1 - Designing algorithms by expectations
AU - Gil, Joseph
AU - Matias, Yossi
N1 - Funding Information:
A preliminary version of this paper was part of a paper presented in the Second Annual ACM-SIAM Symposium on Discrete Algorithms, January 199 1 [3]. * Corresponding author. ’ Email: yogi@cs.technion.ac.il. Part of research was done while author was at the Hebrew University, and at the University of British Columbia. * Email: matias@research.att.com. Part of research was done while author was at the Dept. of Computer Science, Tel Aviv University, Israel, and at the University of Maryland Institute for Advanced Computer Studies, and was partially supported by NSF grants CCR-9 111348 and CCR-8906949.
PY - 1994/7/12
Y1 - 1994/7/12
N2 - A paradigm for the design and analysis of randomized algorithms is introduced. The paradigm, called "designing by expectation" is a scheme by which one can design an algorithm according to its expected behavior in intermediate steps.
AB - A paradigm for the design and analysis of randomized algorithms is introduced. The paradigm, called "designing by expectation" is a scheme by which one can design an algorithm according to its expected behavior in intermediate steps.
KW - Analysis of algorithms
KW - Design of algorithms
KW - Parallel algorithms
KW - Randomized algorithms
UR - http://www.scopus.com/inward/record.url?scp=0028464601&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(94)00052-2
DO - 10.1016/0020-0190(94)00052-2
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0028464601
SN - 0020-0190
VL - 51
SP - 31
EP - 34
JO - Information Processing Letters
JF - Information Processing Letters
IS - 1
ER -