Search for Author All Reviews
	Coppersmith, Don     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       The optimality of the online greedy algorithm in carpool and chairman assignment problems Coppersmith D., Nowicki T., Paleologo G., Tresser C., Wu C. ACM Transactions on Algorithms 7(3): 1-22, 2011.  Type: Article The chairman assignment problem is stated thus: “Suppose k states form a union and every year a union chairman has to be selected in such a way that at any time the accumulated number of chairmen from each ...... Dec 28 2011     Efficient routing in optical networks Aggarwal A., Bar-Noy A., Coppersmith D., Ramaswami R., Schieber B., Sudan M. Journal of the ACM 43(6): 973-1001, 1996.  Type: Article The authors clearly describe models of optical networks and prove several upper and lower bounds, using a broad range of techniques. They also pose some good open problems....... Oct 1 1997     Matrix multiplication via arithmetic progressions Coppersmith D., Winograd S. Journal of Symbolic Computation 9(3): 251-280, 1990.  Type: Article The obvious method for multiplying two n×n matrices takes O(n3) operations. Ever since Strassen showed that this is not optimal, determi...... Jul 1 1991     Discrete logarithms in GF(p) Coppersmith D., Odlyzko A. (ed), Schroeppel R. Literary & Linguistic Computing 1(1): 1-15, 1986.  Type: Article Several related algorithms are presented for computing logarithms in fields GF(p); that is, given integers a, b and a prime p, computing an integer x such that ax :3W.9Tb mod ...... Jul 1 1987
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy