Steven M. Kautz

According to our database, Steven M. Kautz authored at least 8 papers between 1996 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Self-Assembling Rulers for Approximating Generalized Sierpinski Carpets.

Steven M. Kautz, Brad Shutters

Algorithmica, 2013

2010

Concurrency by modularity: design patterns, a case in point.

Hridesh Rajan, Steven M. Kautz, Wayne Rowcliffe

Proceedings of the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2010

Almost free concurrency! (using GOF patterns).

Sean L. Mooney, Hridesh Rajan, Steven M. Kautz, Wayne Rowcliffe

Proceedings of the Companion to the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2010

2009

Self-assembly of the Discrete Sierpinski Carpet and Related Fractals.

Steven M. Kautz, James I. Lathrop

Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

2003

Independence Properties of Algorithmically Random Sequences

Steven M. Kautz

CoRR, 2003

1998

An Improved Zero-One Law for Algorithmically Random Sequences.

Steven M. Kautz

Theor. Comput. Sci., 1998

1997

Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures.

Steven M. Kautz

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

1996

Relative to a Random Oracle, NP Is Not Small.

Steven M. Kautz, Peter Bro Miltersen

J. Comput. Syst. Sci., 1996