515-294-4183

email: smkautz (AT) iastate.edu

Office Hours: | T 1:10 - 2:00 |

W 12:10 - 1:00 | |

F 1:10 - 2:00 |

Section C: MWF 10:00 - 10:50, Lago W142

This course is administered through Canvas.
All course links, announcements, and discussion are on
Piazza.

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 Piazza)
- Lab writeups
- Exam review problems
- Sample solutions

This course is administered through Canvas.
All course links, announcements, and discussion are on
Piazza.

*Resources from Python workshop*from the Midwest Big Data Summer School in May, 2018.*Archived 227 materials from Spring 2018**Archived 336 materials from Fall 2017**Archived 127x materials from Fall 2016*

The zip file below is a complete Eclipse project that can be imported.*Swing examples*- swingexamples.zip (introductory examples)
- README (explains contents of swingexamples.zip)

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

M.S., Computer Science, Cornell University, 1990

B.A., Mathematics, California State University, Sacramento, 1985

Steven M. Kautz and Brad Shutters, " Self-assembling rulers for approximating generalized Sierpinski carpets ," in Bin Fu and Ding-Zhu Du,

Hridesh Rajan, Steven M. Kautz and Wayne Rowcliffe, " Concurrency by modularity: design patterns, a case in point ," in

Steven M. Kautz and James I. Lathrop, " Self-assembly of the Sierpinski carpet and related fractals ," in R. Deaton and A. Suyama (eds.),

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.),

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

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,