Search for Author All Reviews
	Reischuk, Ruediger     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       Early stopping in Byzantine agreement Dolev D., Reischuk R., Strong H. Journal of the ACM 31(4): 720-741, 1984.  Type: Article The Byzantine generals problem involves n processors (generals) reaching agreement on some value through exchange of messages despite the existence of faulty processors (traitors). Of course, any solution of the prob...... Nov 1 1991     Two nonlinear lower bounds for on-line computations Dūris P., Galil Z., Paul W. (ed), Reischuk R. Information and Control 60(1-3): 1-11, 1984.  Type: Article The following lower bounds for on-line computation are proved: (1) Simulating two-tape nondeterministic machines by one-tape machines requires &OHgr;(n log n) time. (2) Simulating k-tape (determin...... Aug 1 1985
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy