Data Structures and Algorithms
Theory of Computation
B. A., Central College (Mathematics/Computer Science)
M. S., University of Minnesota (Computer Science)
Ph. D., University of Minnesota (Computer Science)
Ihinger, P., D. J. Kawatski, L. M. Grosvold, and S. J. Ratering, Quantifying Crystal Growth Rates in the Natural Environment, 8th International Symposium on Crystallization in Glasses and Liquids, September 2006.
Bayuk, R. J. and S. J. Ratering, A Comparison of Robot Navigation Algorithms for an Unknown Goal. Proceedings of the 38th Midwest Instruction and Computing Symposium, 2005.
Wick, M. R., D. E. Stevenson, and S. J. Ratering. Steganography and Cartography: Interesting Assignments that Reinforce Machine Representation, Bit Manipulation, and Discrete Structures Concepts. SIGCSE 2005.
Ratering, S. J. and M. R. Wick. Using an Environment Chain Model to Teach Inheritance in C#. Proceedings of the 37th Midwest Instruction and Computing Symposium, 2004.
Andringa, C. C. and S. J. Ratering. A Case Study in Refactoring. Proceedings of the 37th Midwest Instruction and Computing Symposium, 2004.
Ratering, S. J. and M. L. Gini. Robot Navigation in a Known Environment with Unknown Moving Obstacles. Autonomous Robots, Vol. 1, No. 2, pp. 149 - 165, February, 1995.
Ratering, S. J. and M. L. Gini. Robot Navigation in a Known Environment with Unknown Moving Obstacles. IEEE International Conference on Robotics and Automation, May 2-6, 1993, Atlanta, Georgia.
Ratering, S. J. An Interesting Subset of the Highly Composite Numbers. Mathematics Magazine, Vol. 64, No. 5, December, 1991.