Student Research

Below is a list of student research projects in computer science and software engineering dating back through the 1990s. This list contains both ongoing faculty research projects that include students, and student-initiated research projects.

Zeke Maier ('06, computer science) and
Greg McCullough ('07, computer science and electrical engineering): Measuring the Complexity of Multi-language Software in the .NET Environment; When: 2005-2006; Mentor: Panos Linos; Sponsor: Holcomb Research Institute Faculty Research Grant

Kate Soloducha ('06, computer science): Fast Algorithms for Approximately Counting Smooth Numbers; When: 2005-2006; Mentor: Jon Sorenson; Sponsors: Butler Summer Institute and Holcomb Research Institute Faculty Research Grant; Presentation: URC, April 2006.

Wanhsin (Ellie) Tu ('07, mathematics): Eulerian Trails with and without selected edges in a graph; When: 2005-2006; Mentor: Zhi-Hong Chen; Sponsor: Butler Summer Institute; Presentation: URC, April 2006.

Rachel Martin ('04, computer science): A Discrete-Log Cryptosystem (Honors Thesis); When: 2003-2004; Mentor: Jon Sorenson; Sponsor: none.; Presentation/Demo: URC, April 2004.

Seth Berrier ('03, computer science and music),
Stephanie Herman ('03, computer science),
Rachel Martin ('04, computer science),
Brian O'Rourke ('03, computer science and english), and
Collin Ruud ('04, computer science and music): Tool Support for Maintaining Multilanguage Software Systems; When: 2001-2002; Mentor: Panos Linos; Sponsor: Holcomb Research Institute Faculty Research Grant; Presentations/Demos: Software Engineering Research Center (SERC) Show Cases at IUPUI (May 2001) and Ball State University (December 2001).

Julie Lally ('03, mathematics and computer science): Julie worked on fast algorithms for computing extended GCDs of single-precision integers.; When: Summer 2001; Mentor: Jon Sorenson; Sponsor: Holcomb Research Institute Faculty Research Grant

Charles Jochim ('02, computer science): Interoperability of Software Re-engineering Tools Using XML; When: Summer 2001; Mentor: Panos Linos; Sponsor: Butler Summer Institute; Poster Presentation/Demo: Software Engineering Research Center (SERC) Show Case at Ball State University (December 2001).

Nick Deibel ('01, mathematics and computer science): Nick worked on problems related to DNA computing.; When: Summer 2000; Mentor: Anne Condon (University of British Columbia); Sponsor: University of British Columbia; Presentation: URC, April 2001

Jeremy Lanman ('01, computer science): Jeremy worked on programming related to mathematical games; When: Summer 2000; Mentor: Jerry Farrell; Sponsor: none.; Presentation: URC, April 2001

Adam Rattray ('00, computer science): Adam worked on GCD algorithms.; When: Summer 1999; Mentor: Jon Sorenson; Sponsor: Holcomb Research Institute Faculty Research Grant

Rachel Butler ('99, mathematics education) and
Tina Hobbs ('99, computer science): Rachel and Tina worked on improving algorithms for counting smooth numbers; such algorithms have applications in cryptography.; When: Summer 1998; Mentor: Jon Sorenson; Sponsor: Butler Summer Institute and the National Science Foundation; Presentation: URC, April 1999 (Rachel).

Justin Hockemeyer ('97, mathematics, computer science, and spanish): Justin implemented several algorithms for finding lists of prime numbers.; When: Summer 1997; Mentor: Jon Sorenson; Sponsor: Butler Summer Institute and the National Science Foundation; Presentation: Fall 1997 Indiana Sectional Meeting of the Mathematical Association of America (MAA).

Valerie Piehl ('98, mathematics education) and
Neil Tiedeman ('97, computer science): Valerie and Neil worked on genetic algorithms for solving the n-input extended GCD problem.; When: Summer 1996; Mentor: Jon Sorenson; Sponsor: Butler Summer Institute and the National Science Foundation; Presentations: URC, April 1997 (both) and the CUR Poster Session on Capitol Hill, April 1997 (both); Publication: The paper "Genetic Algorithms for the Extended GCD Problem" by Piehl, Sorenson, and Tiedeman, has been accepted for publication in the Journal of Symbolic Computing.

Shawna Eikenberry (Meyer) ('96, mathematics and political science): Shawna worked on algorithms for computing Jacobi symbols.; When: Summer 1995; Mentor: Jon Sorenson; Sponsor: Butler Summer Institute; Presentations: URC, April 1996; Publication: Shawna Meyer Eikenberry and Jonathan P. Sorenson, "Efficient Algorithms for Computing the Jacobi Symbol", Journal of Symbolic Computing (1998) 26, 509-523.

Simon Hunter ('95, computer science): Simon worked on algorithms for counting smooth numbers.; When: Summer 1994; Mentor: Jon Sorenson; Sponsor: National Science Foundation; Presentations: URC, April 1995.; Publication: Simon Hunter and Jonathan Sorenson, "Approximating the Number of Integers Free of Large Prime Factors", Mathematics of Computation (1997), 66(220), 1729-1741.

Brian Dunten ('94, computer science) and
Julie Jones ('94, mathematics and computer science): Brian and Julie worked on algorithms for computing lists of prime numbers.; When: Summer 1993; Mentor: Jon Sorenson; Sponsor: Butler Summer Institute and the National Science Foundation; Presentations: URC, April 1994 (Julie).; Publication: Brian Dunten, Julie Jones, and Jonathan Sorenson, "A Space-Efficient Fast Prime Number Sieve", Information Processing Letters (1996), 59, 79-84.

Brian Nice ('93, computer science): Brian worked on extended GCD algorithms.; When: Summer 1992; Mentor: Jon Sorenson; Sponsor: Butler Summer Institute; Presentations: URC, April 1993

David Dillon ('92 computer science) and
Frank Smietana ('94 computer science): David and Frank wrote software to manipulate and display graphs and digraphs.; When: Fall 1991-Spring 1992; Mentor: Jerry Farrel and Jon Sorenson,; Sponsor: none.; Presentations: DIMACS Workshop on the Computational Support for Discrete Mathematics, March 1992 (both).; Publication: David S. Dillon and Frank Smietana, "An Interactive, Graphical, Educationally Oriented Graph Analysis Package", Proceedings of the DIMACS Workshop on the Computational Support for Discrete Mathematics, Nathaniel Dean and Gregory E. Shannon, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1994) 15, 71-74.