Files in this item



application/pdf3023171.pdf (8MB)Restricted to U of Illinois
(no description provided)PDF


Title:Combinatorial Algorithms in Scientific Computing
Author(s):Pinar, Ali
Doctoral Committee Chair(s):Michael Heath; Bruce Hendrickson
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Computer Science
Abstract:This thesis highlighted combinatorial techniques in scientific computing as a research field full of interesting problems with real impact. From the scientific computing point of view, our results show that very significant computational savings can be achieved by employing combinatorial techniques. Moreover, the complexity of problems often requires sophisticated combinatorial techniques, and using simple, brute-force techniques may be very inefficient. From the computer science point of view, it is easy to find challenging combinatorial problems to apply or adapt existing theories or develop new techniques for real-world applications. The breadth of this thesis demonstrates the abundance of combinatorial algorithms in scientific computing as a research field. Each of the six chapters of this thesis was motivated by a different application and the solutions employ different solution techniques. Our results, together with the importance of the problems studied, show the impact of our solutions on real-world applications.
Issue Date:2001
Description:157 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.
Other Identifier(s):(MiAaPQ)AAI3023171
Date Available in IDEALS:2015-09-25
Date Deposited:2001

This item appears in the following Collection(s)

Item Statistics