ICME Ph.D. students complete theses in a variety of research areas as a part of the degree program.
Theses for both ICME and ICME's predecessor program, SCCM (Scientific Computing and Computational Mathematics) may be accessed through the Stanford University Libraries via the following links:
ICME faculty and students participate in a wide array of research activities. Here are just a few research groups with ties to ICME:
AHPCRC, or the Army High Performance Computing Research Center, houses a research program focused on two primary objectives: producing cutting-edge software tools for the next-generation HPC environments, and developing innovative computational methodologies that harness the power of these new environments for the solution of some of the most challenging problems in engineering and science. Professor Charbel Farhat heads the AHPCRC.
PSAAP II is a collaboration between Stanford, the University of Michigan, the University of Minnesota, the University of Colorado at Boulder, the University of Texas Austin and the State University of New York at Stony Brook. The project, Predictive Simulations of Particle-laden Turbulence in a Radiation Environment, investigates the effect of radiation on particle motion in an air-turbulent environment. Professor Gianluca Iaccarino directs the project, which also involves Professors Juan Alonso, Eric Darve, Patrick Hanrahan, Sanjiva Lele, Parviz Moin, and George Papanicolaou.
SDSI is the Stanford Data Science Initiative (SDSI), a university-wide organization focused on core data technologies with strong ties to application areas across campus. Professors Margot Gerritsen, Ashish Goel, Trevor Hastie, and Vijay Pande are members of the SDSI Working Group.
SOAL, the SOcial Algorithms Lab, works on problems at the interface of social and economic sciences on one hand, and computational science and algorithms on the other. SOAL faculty leaders include Professors Ashish Goel, Ramesh Johari, and Amin Saberi.
Arun Jambulapati, ICME M.S. student, co-authored a paper, "A Collection of Results on Saturation Numbers," published in the November 2014 Journal of Combinatorial Mathematics and Combinatorial Computing.
Abstract: A graph G is H-saturated if G does not contain H as a subgraph, but the addition of any edge between two nonadjacent vertices in G results in a copy of H in G. The saturation number sat(n,H) is the smallest possible number of edges in a n-vertex H-saturated. The values of saturation numbers for small graphs and n are obtained computationally, and some general results for some specific path unions are also obtained. Full paper: A Collection of Results on Saturation Numbers.pdf