Randomness of finite strings

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Randomness of finite strings: a reconstructive approach

Full text

Pdf (461 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1997 ACM symposium on Applied computing table of contents

San Jose, California, United States

Pages: 527 - 531

Year of Publication: 1997

ISBN:0-89791-850-9

Authors

Sami Khuri	Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA
Frederick Stern	Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA
Teresa Chiu	Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA

Sponsors

SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 4, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/331697.332343 What is a DOI?

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	Thomas M. Cover , Joy A. Thomas, Elements of information theory, Wiley-Interscience, New York, NY, 1991
	2	W. Feller. An introduction to Probability Theory and its Applications. Volume I, third edition, John Wiley, New York, NY, 1968.
	3	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	4	A.N. Kolmogorov. Three approaches to the quantitative definition of information. International Journal of Computer Mathematics, (2):157-168, 1968. Originally published in Problemy Peredachi Informatsii, I (1965).
	5	A. Lempel and J. Ziv. On the complexity of finite sequences. IEEE Transactions on Information Theory, 22:75-81, 1976.
	6	David Maier, The Complexity of Some Problems on Subsequences and Supersequences, Journal of the ACM (JACM), v.25 n.2, p.322-336, April 1978 [doi>10.1145/322063.322075]
	7	Reuven Y. Rubinstein, Simulation and the Monte Carlo Method, John Wiley & Sons, Inc., New York, NY, 1981