ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Guessing secrets
Full text PdfPdf (258 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms table of contents
Washington, D.C., United States
Pages: 723 - 726  
Year of Publication: 2001
ISBN:0-89871-490-7
Authors
Fan Chung  University of California, San Diego
Ronald Graham  University of California, San Diego and Akamai Technologies
Tom Leighton  Akamai Technologies and MIT
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Burgess, On character sums and primitive roots, Proc. London Math. Soc. 12 (1962), 179-192.
 
2
I've Got a Secret, a classic '50's television gameshow, see http://www.timvp.ivegotse.html
 
3
Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998

CITED BY
Fan Chung , Ronald Graham , Linyuan Lu, Guessing secrets with inner product questions, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.247-253, January 06-08, 2002, San Francisco, California

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

  G. Mathematics of Computing


General Terms:
Algorithms, Performance, Security, Theory

Collaborative Colleagues:
Fan Chung: colleagues
Ronald Graham: colleagues
Tom Leighton: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player