| 2008 |
|---|
| 25 | | Klaus Sutner:
Computational Processes and Incompleteness.
CSP 2008: 293-304 |
| 2005 |
|---|
| 24 | EE | Klaus Sutner:
CDM: Teaching discrete mathematics to computer science majors.
ACM Journal of Educational Resources in Computing 5(2): 1-11 (2005) |
| 2004 |
|---|
| 23 | EE | Klaus Sutner:
Universality and Cellular Automata.
MCU 2004: 50-59 |
| 22 | EE | Klaus Sutner:
The complexity of reversible cellular automata.
Theor. Comput. Sci. 325(2): 317-328 (2004) |
| 2003 |
|---|
| 21 | EE | Klaus Sutner:
The Ehrenfeucht-Mycielski Sequence.
CIAA 2003: 282-293 |
| 20 | EE | Klaus Sutner:
Almost Periodic Configurations on Linear Cellular Automata.
Fundam. Inform. 58(2003): 223-240 (2003) |
| 19 | EE | Klaus Sutner:
Reduced Power Automata And Sofic Systems.
Int. J. Found. Comput. Sci. 14(6): 1117- (2003) |
| 18 | EE | Klaus Sutner:
The size of power automata.
Theor. Comput. Sci. 295: 371-386 (2003) |
| 17 | EE | Klaus Sutner:
Cellular automata and intermediate degrees.
Theor. Comput. Sci. 296(2): 365-375 (2003) |
| 2002 |
|---|
| 16 | EE | Klaus Sutner:
Reduced Power Automata.
CIAA 2002: 194-202 |
| 15 | EE | Klaus Sutner:
automata, a Hybrid System for Computational Automata Theory.
CIAA 2002: 221-227 |
| 14 | EE | Klaus Sutner:
Cellular Automata and Intermediate Reachability Problems.
Fundam. Inform. 52(1-3): 249-256 (2002) |
| 2001 |
|---|
| 13 | EE | Klaus Sutner:
The Size of Power Automata.
MFCS 2001: 666-677 |
| 2000 |
|---|
| 12 | EE | Klaus Sutner:
sigma-Automata and Chebyshev-Polynomials.
Theor. Comput. Sci. 230(1-2): 49-73 (2000) |
| 1998 |
|---|
| 11 | | Dajin Wang,
Klaus Sutner:
Two algorithms for a reachability problem in one-dimensional space.
IEEE Transactions on Systems, Man, and Cybernetics, Part A 28(4): 478-486 (1998) |
| 1997 |
|---|
| 10 | EE | Philip Miller,
Kris Stewart,
Klaus Sutner,
Joseph L. Zachary:
Exploiting computer algebra systems in computer science courses (panel).
SIGCSE 1997: 377-378 |
| 9 | EE | Constantine Stivaros,
Klaus Sutner:
Computing Optimal Assignments for Residual Network Reliability.
Discrete Applied Mathematics 75(3): 285-295 (1997) |
| 8 | | Klaus Sutner:
Linear Cellular Automata and Fischer Automata.
Parallel Computing 23(11): 1613-1634 (1997) |
| 1995 |
|---|
| 7 | | Klaus Sutner:
On the Computational Complexity of Finite Cellular Automata.
J. Comput. Syst. Sci. 50(1): 87-87 (1995) |
| 1993 |
|---|
| 6 | EE | Charles J. Colbourn,
Appajosyula Satyanarayana,
Charles L. Suffel,
Klaus Sutner:
Computing Residual Connectedness Reliability for Restricted Networks.
Discrete Applied Mathematics 44(1-3): 221-232 (1993) |
| 1991 |
|---|
| 5 | | Klaus Sutner,
Appajosyula Satyanarayana,
Charles L. Suffel:
The Complexity of the Residual Node Connectedness Reliability Problem.
SIAM J. Comput. 20(1): 149-155 (1991) |
| 1990 |
|---|
| 4 | | Klaus Sutner:
The Ordertype of beta-R.E. sets.
J. Symb. Log. 55(2): 573-576 (1990) |
| 1989 |
|---|
| 3 | | Klaus Sutner:
The Computational Complexity of Cellular Automata.
FCT 1989: 451-459 |
| 2 | | Stephen L. Bloom,
Klaus Sutner:
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets.
TAPSOFT, Vol.1 1989: 134-148 |
| 1988 |
|---|
| 1 | | Klaus Sutner,
Wolfgang Maass:
Motion Planning Among Time Dependent Obstacles.
Acta Inf. 26(1/2): 93-122 (1988) |
