Research in the Computer Science Department

REU

Please click here to learn more about our new 2008 NSF REU Site.

Summer 2008 Research Opportunities

There will be many research opportunities available to HMC students this summer. Come to Colloquium on February 28th to learn more.

For a complete list of our summer research opportunities, check out the link in the sidebar, and then apply.

Faculty Research Interests

This information is really out of date. It'll be updated soon!

Several areas of research are being pursued by faculty and students in the Computer Science Department at Harvey Mudd College. Faculty research is supported by funding agencies such as the National Science Foundation and the Mellon Foundation. Students are strongly encouraged to participate in faculty research and a number of senior theses and co-authored publications have resulted from such collaboration.

Selected Faculty and Student Publications

  • F.C.H. Lin and R.M. Keller, "The Gradient model: A load-balancing scheme for medium-grain tasking", IEEE Transactions on Software Engineering, Vol. SE-13, No. 1, 1987, pp. 32-38.
  • R.M. Keller and P. Panangaden. "Semantics of digital networks containing indeterminate operators", Distributed Computing Vol. 1, 1986, pp. 235-245.
  • R.M. Keller and M.R. Sleep. "Applicative caching". ACM Transactions on Programming Languages and Systems, Vol. 8, No. 1, January 1986, pp. 88-108.
  • G. H. Kuenning, "The Design of the SEER Predictive Caching System", Proceedings of Mobile Computing Systems and Applications, December, 1994.
  • G. H. Kuenning, "Precise Interactive Measurement of Operating Systems Kernels" Software--Practice and Experience Vol. 25, No. 1, January 1995, pp. 1-22.
  • Z. Dodds, J. Wang, and W. Miranker, "Principal Component Analysis for Place Recognition", The Journal of Neural, Parallel, and Scientific Computations, 1996.
  • V. Gore, M. Jerrum, S. Kannan, E. Sweedyk, and S. Mahaney, w"A quasi-polynomial-time algorithm for sampling words from a context-free language", Information and Computation, Vol. 54, No. 2, April 1997, pp. 313-331.
  • B. DasGupta, T. Jiang, M. Li, S. Kannan, and E. Sweedyk, "On the complexity and approximation of syntenic distance", Discrete Applied Mathematics (special issue on computational biology), Vol. 88, No. 1-3, November 1998, pp. 59-62
  • R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan, "Tree-Based Multicasting in Wormhole-Routed Irregular Topologies", Proceedings of the Merged 12th International Parallel Processing Symposium and the 9th Symposium on Parallel and Distributed Processing, April 1998, Orlando, Florida.
  • R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan, "Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations", Proceedings of the Merged 12th International Parallel Processing Symposium and the 9th Symposium on Parallel and Distributed Processing, April 1998, Orlando, Florida.
  • R.E. Valdes-Perez and C.A. Stone, "Systematic Detection of Subtle Spatio-Temporal Patterns in Time-Lapse Imaging, II. Particle Migrations", Bioimaging Vol. 6, No. 2, 1998, pp. 71-78.
  • T. W. Page, Jr., R. G.. Guy, J. S. Heidemann, D. H. Ratner, P. L. Reiher, A. Goel, G. H. Kuenning, and G. Popek. "Perspectives on Optimistically Replicated Peer-to-Peer Filing", Software--Practice and Experience Vol. 28, No. 2, February 1998, pp. 155-180.
  • G. H. Kuenning, R. Bagrodia, R. G. Guy, G. J. Popek, P. Reiher, and A.-I Wang. "Measuring the Quality of Service of Optimistic Replication", Proceedings of the ECOOP Workshop on Mobility and Replication, July, 1998.
  • A. Rudenko, P. Reiher, G. J. Popek, and G. H. Kuenning. "Saving Portable Computer Battery Power through Remote Process Execution", ACM Mobile Computing and Communications Review Vol. 2, Nol. 1, Winter 1998.
  • R. Libeskind-Hadas, "A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing," IEEE Transactions on Computers, Vol. 47, No. 10, October 1998, pp. 1158-1160.
  • B. Barden, J. Davis, R. Libeskind-Hadas, and W. Williams, "On Edge-Disjoint Spanning Trees in Hypercubes," Information Processing Letters, Vol. 70, Issue 1, April 16, 1999, pp. 13-16.
  • A. Rudenko, P. Reiher, G.J. Popek, and G.H. Kuenning. "The Remote Processing Framework for Portable Computer Power Saving", Proceedings of the ACM Symposium on Applied Computing, San Antonio, TX, February 1999.
  • B. Jayaraman and R.M. Keller, "Semantics and implementation of resource expressions". Journal of Parallel and Distributed Computing Vol. 7, No 1, 1989, pp 40-63.
  • J. Hespanha, Z. Dodds, G.D. Hager, and A.S. Morse, "What tasks can be Performed with an Uncalibrated Stereo Vision System?", International Journal of Computer Vision, Vol. 35, No. 1, November 1999, pp. 65-85.
  • J. Kadane, C. Stone, and G. Wallstrom, "The donation paradox for peremptory challenges", Theory and Decision, Vol. 47, No. 2, October 1999, pp 139-155.
  • Z. Dodds, J. Hespanha, G.D. Hager, and A.S. Morse, "Task Specification and Monitoring for Uncalibrated Hand/Eye Coordination" 1999 International Conference on Robotics and Automation, April 1999, 1607-1613.
  • Z. Dodds and G.D. Hager, "Complete Languages for Visually Specified Tasks: From Theory to Practice", 2000 World Automation Conference, June 2000.
  • Z. Dodds and G.D. Hager, "On Specifying and Performing Visual Tasks with Qualitative Object Models", 2000 International Conference on Robotics and Automation June 2000, pp. 636-643.
  • E. Sweedyk, "A 2 1/2 approximation algorithm for shortest super-string", SIAM Journal of Computing, Vol. 29, No. 3, January 2000, pp. 954-986
  • Christopher A. Stone and Robert Harper, "Deciding Type Equivalence in a Language with Singleton Kinds", ACM Principles of Programming Languages 2000.
  • Christopher A. Stone and Robert Harper, "A Type-Theoretic Interpretation of Standard ML", Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte eds., MIT Press, 2000.
  • R. Libeskind-Hadas, J. R. Hartline, P. Boothe, G. Rae, and J. Swisher, "On Multicast Algorithms for Heterogeneous Networks of Workstations", Journal of Parallel and Distributed Computing, Vol. 61, No. 11, November 2001, pp. 1665-1679.
  • R. Libeskind-Hadas and R. Melhem, "Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks", IEEE/ACM Transactions on Networking, Vol. 10, No. 5, October 2002, pp. 621-629.
  • B.J. Culpepper and R.M. Keller, "Enabling Computer Decisions Based on EEG Input", IEEE Transactions on Neural Systems and Rehabilitation Engineering, Vol. 11, No. 4, December 2003, pp. 354-360.
  • J. R. Hartline and R. Libeskind-Hadas, "The Computational Complexity of Motion Planning", SIAM Review, Vol. 45, No. 3, October 2003, pp. 543-557.
  • J. R. Hartline, R. Libeskind-Hadas, K. Dresner, E. Drucker, and K. Ray, "Optimal Virtual Topologies for One-To-Many Communication in WDM Paths and Rings" IEEE/ACM Transactions on Networking Vol 12, No. 2, April 2004, pp. 375-383.
  • B. Thom and M. Nelson, "An In-Depth Analysis of Real-Time MIDI Performance", Proceedings of 2004 International Conference Musical Conference (ICMC 2004), Miami, Florida, 2004.
  • M. Nelson and B. Thom, "A Survey of Real-Time MIDI Performance", Proceedings of 2004 International Conference on New Interfaces for Musical Expression (NIME 2004), Hamamatsu, Japan, 2004
  • Titus Winters, Ryan Ausanka-Crues, Mark Kegel, Erik Shimshock, Damiel Turner, Michael Erlinger, TinkerNet: A Low-Cost and Ready-To-Deploy Networking Laboratory Platform, 8th Australasian Computing Education Conference, ACE2006, Jan 06.

Faculty Patents

  • R.R. Rasmussen, D.L. Dvorak, K.P. Gostelow, T.W. Starbird, E. Gat, S. A. Chien, R.M. Keller, Adaptable state based control system, United States Patent No. US 6,745,089 B2, June 1, 2004.