Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Beimel, Amos Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  Secret-sharing schemes for very dense graphs
Beimel A., Farràs O., Mintz Y.  Journal of Cryptology 29(2): 336-362, 2016. Type: Article

Secret-sharing schemes are common when it comes to distributing a secret among individual participants so as to ascertain that no individual has full knowledge of the secret at any given time. The paper presents an approach for maintaining small s...
...
Sep 14 2016  
  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 specifically, its embodim...
...
Jul 1 2000  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2017 ThinkLoud, Inc.
Terms of Use
| Privacy Policy