Skip to main content
padlock icon - secure page this page is secure
Home / JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, Volume 76, Number 1

Space-efficient parallel algorithms for combinatorial search problems

Notice

The availability of this item is unknown.

Please log in to view the availability and price of this article.

Authors: Pietracaprina, A.; Pucci, G.; Silvestri, F.; Vandin, F.

Source: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, Volume 76, Number 1, 2015, pp. 58-65(8)

Publisher: Elsevier

No Abstract

No References
No Citations
No Supplementary Data
No Article Media
No Metrics

Document Type: Research Article

Publication date: January 1, 2015

Share Content

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more