Skip to main content
SpringerLink
Log in

Optimal parallelization of Las Vegas algorithms

  • Conference paper
  • First Online:
STACS 94 (STACS 1994)

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

Included in the following conference series:

Abstract

We describe a parallel simulation strategy with optimal expected running time for Las Vegas Algorithms. This strategy has been implemented on a network of workstations and applied to a randomized automated theorem prover.

Research supported in part by NSF Grants CCR-9016468 & CCR-9304722 and grant No. 89-00312 & 92-00226 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel.

Research supported by an ICSI Postdoctoral Fellowship.

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. Luby, A. Sinclair, D. Zuckerman. Optimal speedup of las vegas algorithms. Information Processing Letters 47, 1993, 173–180.

    Google Scholar 

  2. M. Luby, W. Ertel. Optimal Parallelisation of Las Vegas Algorithms. TR-93-041, International Computer Science Institute, Berkeley CA, 1993.

    Google Scholar 

  3. W. Ertel. OR-Parallel theorem proving with random competition. In: Logic Programming and Automated Reasoning, Springer LNAI 624, 1992, 226–237.

    Google Scholar 

  4. R. Letz, J. Schumann, S. Bayerl, W. Bibel. SETHEO, a high-performance theorem prover. Journal of Automated Reasoning 8(2), 1992, 183–212.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Computer Science Institute, Berkeley, California

    Michael Luby & Wolfgang Ertel

Authors
  1. Michael Luby
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Ertel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luby, M., Ertel, W. (1994). Optimal parallelization of Las Vegas algorithms. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_163

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_163

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57785-0

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation