On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem.
A. Apostolico, C. Iliopoulos, and R. Paige. Parallel Algorithms and Architectures, volume 269 of Lecture Notes in Computer Science, page 70-76. Springer, (1987)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/paa/ApostolicoIP87
%A Apostolico, Alberto
%A Iliopoulos, Costas S.
%A Paige, Robert
%B Parallel Algorithms and Architectures
%D 1987
%E Albrecht, Andreas Alexander
%E Jung, Hermann
%E Mehlhorn, Kurt
%I Springer
%K dblp
%P 70-76
%T On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem.
%U http://dblp.uni-trier.de/db/conf/paa/paa1987.html#ApostolicoIP87
%V 269
%@ 3-540-18099-0
@inproceedings{conf/paa/ApostolicoIP87,
added-at = {2017-05-19T00:00:00.000+0200},
author = {Apostolico, Alberto and Iliopoulos, Costas S. and Paige, Robert},
biburl = {https://www.bibsonomy.org/bibtex/2c12867a09586471767ae1a3fc98c6416/dblp},
booktitle = {Parallel Algorithms and Architectures},
crossref = {conf/paa/1987},
editor = {Albrecht, Andreas Alexander and Jung, Hermann and Mehlhorn, Kurt},
ee = {https://doi.org/10.1007/3-540-18099-0_30},
interhash = {1ad91e8e4483ce60f1398aac81931b77},
intrahash = {c12867a09586471767ae1a3fc98c6416},
isbn = {3-540-18099-0},
keywords = {dblp},
pages = {70-76},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T18:52:45.000+0200},
title = {On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem.},
url = {http://dblp.uni-trier.de/db/conf/paa/paa1987.html#ApostolicoIP87},
volume = 269,
year = 1987
}
