Skip to main content
Springer Nature Link
Log in

Program checkers for probability generation

  • Complexity (Session 4)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 510))

Included in the following conference series:

  • 150 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Blum, W. Evans, P. Gemmell, S. Kannan, and M. Naor, Checking the Correctness of Memories, preprint.

    Google Scholar 

  2. M. Blum and S.Kannan, Designing Programs That Check Their Work, Proc. 21st ACM Symposium on Theory of Computing, 86–97, 1989.

    Google Scholar 

  3. M. Blum, M. Luby, and R. Rubinfeld, Self-testing and self-correcting programs with applications to numerical problems.

    Google Scholar 

  4. K.L. Brooks, C.A.B. Smith, A.H. Stone, and W.T. Tutte, The Dissection of Rectangles into Squares, Duke Math. J. 7, 312–340 (1940).

    Google Scholar 

  5. I.P. Goulden and D.M. Jackson, Combinatorial Enumeration, Wiley — Interscience Series in Discrete Mathematics 1983.

    Google Scholar 

  6. R. Impagliazzo, L. Levin, and M. Luby, Pseudo-random generation from one-way functions, Proc. 21st ACM Symp. on Theory of Computing, 12–24, 1989.

    Google Scholar 

  7. R. Impagliazzo and M. Luby, One-way Functions are Essential for Complexity Based Cryptography, Proc. 30th Symp. on Foundations of Comp. Sci., 230–235, 1989.

    Google Scholar 

  8. M.R. Jerrum, L.G. Valiant, and V.V. Vazirani, Random Generation of Combinatorial Structures from a Uniform Distribution, Theoretical Computer Science 43 (1986) 169–188.

    Google Scholar 

  9. R.M. Karp and M. Luby, Monte-Carlo Algorithms for Enumeration and Reliability Problems 24th Annual FOCS, pp. 56–64 1983.

    Google Scholar 

  10. D.E. Knuth and A.C. Yao, Algorithms and Complexity, ed. J.F. Traub, pp. 357–428 New York: Acad. Press 1976.

    Google Scholar 

  11. J. von Neumann, Various Techniques in Connection with Random Digits, Collected Works, Volume V, pp. 768–770 MacMillan New York 1963.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Arizona, USA

    Sampath Kannan

  2. Computer Science Department, Princeton University, USA

    Andrew Yao

Authors
  1. Sampath Kannan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kannan, S., Yao, A. (1991). Program checkers for probability generation. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_132

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_132

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics