Steve Kautz

Lecturer, Department of Computer Science

Atanasoff B6
515-294-4183
email:

Office Hours for Spring 2012 (subject to change):

M 4:10 - 5:00

T 1:00 - 2:00

W 11:30 - 12:30

R 1:00 - 2:00

Please send email if you need to see me at some other time.

Teaching Schedule, Spring 2012

Com S 227

MWF 9:00 - 9:50, Hoover 1213
This course is administered through Blackboard. In case Blackboard is down, here are some direct links:

Syllabus (includes all instructor and TA office hours)
Topics and examples page
Assignment documentation (NOTE: there may be additional instructions or changes posted on Blackboard)
Lab writeups
Exam review problems

Com S 336

TR 11:00 - 12:20, MacKay 116
This course is administered through Blackboard. Direct links.

Interests

Concurrency; languages and patterns for concurrent programming; nanoscale self-assembly; algorithmic randomness.
I rejoined the faculty here in January 2008 after spending 8 years in industry. (See my CV for details.) I collaborate with members of the Laboratory for Software Design and the Laboratory for Nanoscale Self-Assembly

Education

Ph.D., Mathematics, Cornell University 1991
M.S., Computer Science, Cornell University, 1990
B.A., Mathematics, California State University, Sacramento, 1985

Publications

"Self-assembling rulers for approximating generalized Sierpinski carpets" (with B. Shutters), in Bin Fu and Ding-Zhu Du, Computing and Combinatorics - 17th Annual International Conference (COCOON 2011), Springer Lecture Notes in Computer Science 6842, pages 284-296, 2011.

"Concurrency by modularity: design patterns, a case in point" (with H. Rajan and W. Rowcliffe), in Proceedings of Onward! 2010, ACM, 2010.

"Self-assembly of the Sierpinski carpet and related fractals" (with J. Lathrop), in R. Deaton and A. Suyama (eds.), DNA Computing and Molecular Programming, 15th International Conference, Springer Lecture Notes in Computer Science 5877, pages 78-87, 2009. See also arXiv:0901.3189v1 [cs.OH], Computing Research Repository, 2009.

"An improved zero-one law for algorithmically random sequences," Theoretical Computer Science, 191:185-192, 1998.

"Resource-bounded randomness and compressibility with respect to nonuniform measures," in J.Rolim (ed.), Randomization and Approximation Techniques in Computer Science, Springer Lecture Notes in Computer Science 1269, pages 197-211, 1997.

"Independence properties of algorithmically random sequences," Technical Report arXiv:cs/0301013v1 [cs.CC], Computing Research Repository, 1995.

"Relative to a random oracle, NP is not small" (with P. Miltersen), Journal of Computer and System Sciences 53:235-250, 1996. Also in Proceedings of the Ninth Annual IEEE Conference on Structure in Complexity Theory, 1994.

"Some sums of some significance" (with M. Dasef), The College Mathematics Journal 28, 1997.

"Degrees of random sets," doctoral dissertation, Cornell University, 1991. Much of the content of this work now appears in Rod Downey and Denis Hirschfeldt, Algorithmic Randomness and Complexity, Springer 2010.