Steve Kautz

[pic of sk]

Senior Lecturer, Department of Computer Science

Atanasoff 101
515-294-4183
email: smkautz (AT) iastate.edu


Office Hours: M 1:10 - 2:00
T 1:30 - 2:30
R 1:30 - 2:30
(Please send email if you need to see me at some other time. Com S 227 students: Note that I can usually be found right after class in the atrium outside Hoover 2055.)

Teaching Schedule, Fall 2017

Com S 227 (Section B)

MWF 3:10 - 4:00, Hoover 2055
Course links, announcements, and discussion are administered through Piazza.

Here are some direct links:

Com S 336

TR 11:00 - 12:15, Town Engineering 230
Course links, announcements, and discussion are administered through Piazza.
  • Direct links.

    Other stuff

    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 Molecular Programming

    Education

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

    Publications

    Hridesh Rajan, Steven M. Kautz, Eric Lin, Sarah Kabala, Ganesha Upadhyaya, Yuheng Long, Rex Fernando and Loránd Szakács, " Capsule-oriented programming ," Technical Report 13-01, Computer Science, Iowa State University, February 2013.

    Steven M. Kautz and Brad Shutters, " Self-assembling rulers for approximating generalized Sierpinski carpets ," 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. To appear in Algorithmica.

    Hridesh Rajan, Steven M. Kautz and Wayne Rowcliffe, " Concurrency by modularity: design patterns, a case in point ," in Proceedings of Onward! 2010, ACM, 2010.

    Steven M. Kautz and James I. Lathrop, " Self-assembly of the Sierpinski carpet and related fractals ," 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.

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

    Steven M. Kautz, " 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.

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

    Steven M. Kautz and Peter Bro Miltersen, " Relative to a random oracle, NP is not small ," 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.

    Martha E. Dasef and Steven M. Kautz, " Some sums of some significance ," The College Mathematics Journal 28, 1997.

    Steven M. Kautz, " 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.