Skip to main content
SpringerLink
Log in

Synthesizing parallel divide-and-conquer algorithms using the list interleave operator

  • Posters
  • Conference paper
  • First Online:
Concurrency and Parallelism, Programming, Networking, and Security (ASIAN 1996)

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

Included in the following conference series:

  • 115 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

References

  1. Bellegarde, F.: Induction and Synthesis for Automatic Program Transformation. Technical Report CS/E94-022, Oregon Graduate Institute of Science and Technology, Department of Computer Science and Engineering, 1994.

    Google Scholar 

  2. Chin, W.N.: Synthesizing Efficient Parallel Programs from Sequential Specifications. TRA9/95, Department of Information Systems and Computer Science, National University of Singapore, September 1995.

    Google Scholar 

  3. Grant-Duff, Z., Harrison P.G.: Skeletons, List Homomorphisms and Parallel Program Transformation. Technical Report 94/14, Department of Computing, Imperial College, July 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, ”Gh. Asachi” Technical University, 22 Copou Blvd., 6600, Iaşi, Romania

    Răzvan Voicu

Authors
  1. Răzvan Voicu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joxan Jaffar Roland H. C. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voicu, R. (1996). Synthesizing parallel divide-and-conquer algorithms using the list interleave operator. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027818

Download citation

  • DOI: https://doi.org/10.1007/BFb0027818

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49626-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation