Combinatorial Algorithms in Scientific Computing

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Pinar, Ali

Contributors dc:contributor

• Michael Heath
• Bruce Hendrickson

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI3023171

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81585