Search for Author All Reviews
	Wigderson, Avi     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 discrete logarithm hides O(log n) bits Long D., Wigderson A. SIAM Journal on Computing 17(2): 363-372, 1988.  Type: Article Let p be an n-bit prime number and g be a generator of the group of units mod p. For k ≤ n , the range [ 1 , ... May 1 1989     How to share memory in a distributed system Upfal E., Wigderson A. Journal of the ACM 34(1): 116-127, 1987.  Type: Article In this lucidly written paper, the authors consider a “Module Parallel Computer” model in which memory is organized into modules with only one access being possible per module at any one time. They suggest a scheme ...... Aug 1 1987     A fast parallel algorithm for the maximal independent set problem Karp R., Wigderson A. Journal of the ACM 32(4): 762-773, 1985.  Type: Article An independent set of a simple graph is a subset of vertices, no two of which are adjacent. The paper describes a P-RAM algorithm to determine a maximal independent set for a given graph. The bounds achieved are O((logn)<...... Mar 1 1986     Improving the performance guarantee for approximate graph coloring Wigderson A. Journal of the ACM 30(4): 729-735, 1983.  Type: Article A graph coloring algorithm makes an assignment of colors to the vertices of a graph so that each vertex is of a different color than its neighbors. The chromatic number of a graph is the least number of colors for which such an assignm...... Feb 1 1985
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy