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
  Fiat, Amos Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 5 of 5 reviews    
  Derandomization of auctions
Aggarwal G., Fiat A., Goldberg A., Hartline J., Immorlica N., Sudan M.  Theory of computing (Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 22-24, 2005) 619-625, 2005.  Type: Proceedings

In a single-round, sealed-bid auction, every bidder, independently, submits a single bid without seeing the bids of others. One talks about unlimited supply, unit-demand auctions when an infinite number of items is for sale, and every ...
...
Jul 31 2006  
  Making data structures confluently persistent
Fiat A., Kaplan H. Journal of Algorithms 48(1): 16-58, 2003.  Type: Article

This paper presents a general technique to transform any pointer-based data structure into one that is “confluently persistent,” thus answering a longstanding open problem posed by Driscoll, Sarnak, Sleator, and Tar...
...
Aug 5 2004  
  On-line routing of virtual circuits with applications to load balancing and machine scheduling
Aspnes J., Azar Y., Fiat A., Plotkin S., Waarts O. Journal of the ACM 44(3): 486-504, 1997.  Type: Article

Point-to-point circuit routing is a generalization of online load balancing. Jobs arrive online and must be assigned immediately. Assigning a job to a machine increases the machine’s load according to a load vector. All coord...
...
Oct 1 1997  
  Implicit O(1) probe search
Fiat A., Naor M. SIAM Journal on Computing 22(1): 1-10, 1993.  Type: Article

An implicit search technique is based on a table organization that requires no additional storage. In this case, if n is the table size and m is the domain size of the stored elements, with ...
Mar 1 1995  
  How to prove yourself: practical solutions to identification and signature problems
Fiat A., Shamir A.  Advances in cryptology--CRYPTO ’86 (, Santa Barbara, CA, Aug 11-15, 1987) 1941987.  Type: Proceedings

Zero-knowledge, a newly emerging area of complexity theory, is of great interest to cryptographers because it provides a basis for the construction of secure authentication protocols. Most zero-knowledge protocols are of little practic...
...
Apr 1 1989  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy