Combinatorial algorithms enabling computational science: tales from the front

doi:10.1088/1742-6596/46/1/062

Combinatorial algorithms enabling computational science: tales from the front

Sanjukta Bhowmick et al 2006 J. Phys.: Conf. Ser. 46 453-457 doi: 10.1088/1742-6596/46/1/062

PDF (183 KB) | References

Sanjukta Bhowmick^1,4, Erik G Boman², Karen Devine², Assefaw Gebremedhin³, Bruce Hendrickson², Paul Hovland¹, Todd Munson¹ and Alex Pothen³
¹ Mathematics and Computer Science Division, Argonne National Laboratory, USA
² Discrete Algorithms and Math Department, Sandia National Laboratories, USA
³ Computer Science Department, Old Dominion University, USA
⁴ Department of Applied Physics and Applied Mathematics, Columbia University, USA
E-mail: bah@sandia.gov

Abstract. Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations. The importance of discrete algorithms continues to grow with the demands of new applications and advanced architectures. This paper surveys some recent developments in this rapidly changing and highly interdisciplinary field.

Post to CiteUlike |

Post to Connotea |

Post to Bibsonomy

Combinatorial algorithms enabling computational science: tales from the front

Find related articles

Article options

Authors & Referees