Search for Author All Reviews
	Pinter, Shlomit     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 2 of 2 reviews       Type matching, type-graphs, and the Schanuel conjecture Katzenelson J., Pinter S., Schenfeld E. ACM Transactions on Programming Languages and Systems 14(4): 574-588, 1992.  Type: Article The authors study a type of matching graphs with polynomials. This mapping enables the authors to consider a special number associated with polynomials, called the magic number. This concept is used to show that the types of graphs are...... Oct 1 1993     Reaching approximate agreement in the presence of faults Dolev D., Lynch N., Pinter S., Stark E., Weihl W. Journal of the ACM 33(3): 499-516, 1986.  Type: Article The Byzantine generals problem is one of the most famous problems in computer science. The problem is for processes to reach agreement on some value despite the malicious effects of faulty processes. This paper presents a solution for ...... Aug 1 1988
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy