Search for Author All Reviews
	Kushilevitz, Eyal     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       Learning functions represented as multiplicity automata Beimel A., Bergadano F., Bshouty N., Kushilevitz E., Varricchio S. Journal of the ACM 47(3): 506-530, 2000.  Type: Article One of the earliest paradigms for feasible exact learning,  Angluin’s  formulation of learning from membership and equivalence queries, continues to supply a framework for new and interesting results. More s...... Jul 1 2000     Lower bounds for randomized mutual exclusion Kushilevitz E., Mansour Y., Rabin M., Zuckerman D. SIAM Journal on Computing 27(6): 1550-1563, 1998.  Type: Article Mutual exclusion deals with the problem of not having more than one process at a time using a section of code (specifically, a critical section). If there are n distributed processes that can ask to use a critical se...... Jul 1 1999     Communication complexity Kushilevitz E., Nisan N., Cambridge University Press, New York, NY, 1997.  Type: Book (9780521560672) The communication complexity of two-party protocols was introduced by Abelson [1] and Yao [2] in 1978 and 1979. The initial goal was to develop a method for proving lower bounds on the complexity of distributed and parallel computation...... Dec 1 1998     On learning Read-k-Satisfy-j DNF Blum A., Khardon R., Kushilevitz E., Pitt L., Roth D.  Computational learning theory (Proceedings of the seventh annual conference, New Brunswick, New Jersey, United States, Jul 12-15, 1994) 110-117, 1994.  Type: Proceedings The authors provide a dense paper that brings the study of disjunctive normal form (DNF) formulas a step forward. They prove that the class of Read-k-Satisfy-j (RkSj) DNF formulas, in which the max...... Aug 1 1995
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy