Klaus Sutner

50 papers A 1B 3C 6Journal 32Unranked 6
YearRankTypeTitle / Venue / Authors
2019 C conf
Orbits of Abelian Automaton Groups.
LATA
Tim Becker, Klaus Sutner
2018 — ch.
Abelian Invertible Automata.
Reversibility and Universality
Klaus Sutner
2016 B conf
Cognitive Tutors Produce Adaptive Online Course: Inaugural Field Trial.
ITS
Noboru Matsuda, Martin Van Velsen, Nikolaos Barbalios, Shuqiong Lin, Hardik Vasa, Roya Hosseini, Klaus Sutner, Norman L. Bier
2015 J jnl
Iterating Transducers.
Fundam. Informaticae
Klaus Sutner
2014 J jnl
Iteration of Invertible Transductions.
Int. J. Found. Comput. Sci.
Klaus Sutner
2013 C conf
Invertible Transducers, Iteration and Coordinates.
CIAA
Klaus Sutner
2013 — conf
Invertible Transductions and Iteration.
DCFS
Klaus Sutner
2012 J jnl
Computational classification of cellular automata.
Int. J. Gen. Syst.
Klaus Sutner
2012 J jnl
Iterating Inverse Binary Transducers.
J. Autom. Lang. Comb.
Klaus Sutner, Kevin Lewi
2012 — conf
Iterating Invertible Binary Transducers.
DCFS
Klaus Sutner, Kevin Lewi
2012 J jnl
Preface.
Int. J. Found. Comput. Sci.
Jérôme Durand-Lose, Maurice Margenstern, Klaus Sutner
2011 J jnl
Computational processes, observers and Turing incompleteness.
Theor. Comput. Sci.
Klaus Sutner
2011 J jnl
Stephen L. Bloom 1940-2010.
Fundam. Informaticae
Zoltán Ésik, Klaus Sutner
2010 J jnl
Cellular Automata, Decidability and Phasespace.
Fundam. Informaticae
Klaus Sutner
2009 — ch.
Cellular Automata, Classification of.
Encyclopedia of Complexity and Systems Science
Klaus Sutner
2009 — conf
Cellular Automata, Decidability and Phasespace.
NCMA
Klaus Sutner
2009 J jnl
Model Checking One-Dimensional Cellular Automata.
J. Cell. Autom.
Klaus Sutner
2008 — conf
Computational Processes and Incompleteness
CSP
Klaus Sutner
2005 J jnl
CDM: Teaching discrete mathematics to computer science majors.
ACM J. Educ. Resour. Comput.
Klaus Sutner
2004 J jnl
The complexity of reversible cellular automata.
Theor. Comput. Sci.
Klaus Sutner
2004 C conf
Universality and Cellular Automata.
MCU
Klaus Sutner
2003 J jnl
Almost Periodic Configurations on Linear Cellular Automata.
Fundam. Informaticae
Klaus Sutner
2003 J jnl
Cellular automata and intermediate degrees.
Theor. Comput. Sci.
Klaus Sutner
2003 J jnl
Reduced Power Automata And Sofic Systems.
Int. J. Found. Comput. Sci.
Klaus Sutner
2003 C conf
The Ehrenfeucht-Mycielski Sequence.
CIAA
Klaus Sutner
2003 J jnl
The size of power automata.
Theor. Comput. Sci.
Klaus Sutner
2002 J jnl
Cellular Automata and Intermediate Reachability Problems.
Fundam. Informaticae
Klaus Sutner
2002 J jnl
Decomposition of Additive Cellular Automata.
Complex Syst.
Klaus Sutner
2002 C conf
Reduced Power Automata.
CIAA
Klaus Sutner
2002 C conf
automata, a Hybrid System for Computational Automata Theory.
CIAA
Klaus Sutner
2001 B conf
The Size of Power Automata.
MFCS
Klaus Sutner
2000 J jnl
sigma-Automata and Chebyshev-Polynomials.
Theor. Comput. Sci.
Klaus Sutner
1998 J jnl
Two algorithms for a reachability problem in one-dimensional space.
IEEE Trans. Syst. Man Cybern. Part A
Dajin Wang, Klaus Sutner
1997 J jnl
Computing Optimal Assignments for Residual Network Reliability.
Discret. Appl. Math.
Constantine Stivaros, Klaus Sutner
1997 A conf
Exploiting computer algebra systems in computer science courses (panel).
SIGCSE
Philip Miller, Kris Stewart, Klaus Sutner, Joseph L. Zachary
1997 J jnl
Linear Cellular Automata and Fischer Automata.
Parallel Comput.
Klaus Sutner
1995 J jnl
On the Computational Complexity of Finite Cellular Automata.
J. Comput. Syst. Sci.
Klaus Sutner
1995 J jnl
Preface.
Networks
Charles J. Colbourn, Klaus Sutner
1995 J jnl
The intractability of the reliable assignment problem in split networks.
Networks
Constantine Stivaros, Klaus Sutner
1993 J jnl
Computing Residual Connectedness Reliability for Restricted Networks.
Discret. Appl. Math.
Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner
1992 — conf
Implementing Finite State Machines.
Computational Support for Discrete Mathematics
Klaus Sutner
1991 J jnl
De Bruijn Graphs and Linear Cellular Automata.
Complex Syst.
Klaus Sutner
1991 J jnl
The Complexity of the Residual Node Connectedness Reliability Problem.
SIAM J. Comput.
Klaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel
1990 J jnl
The Ordertype of beta-R.E. sets.
J. Symb. Log.
Klaus Sutner
1989 J jnl
A Note on Culik-Yu Classes.
Complex Syst.
Klaus Sutner
1989 — conf
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets.
TAPSOFT, Vol.1
Stephen L. Bloom, Klaus Sutner
1989 B conf
The Computational Complexity of Cellular Automata.
FCT
Klaus Sutner
1988 J jnl
Additive Automata On Graphs.
Complex Syst.
Klaus Sutner
1988 J jnl
Motion Planning Among Time Dependent Obstacles.
Acta Informatica
Klaus Sutner, Wolfgang Maass
1988 J jnl
On σ-Automata.
Complex Syst.
Klaus Sutner