The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Klaus Sutner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Computational Processes and Incompleteness [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002