The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrzej Szepietowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrzej Szepietowski
    Remarks on Searching Labyrinths by Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:457-464 [Conf]
  2. Andrzej Szepietowski
    If Deterministic and Nondeterministic Space Complexities are Equal for log log n then they are also Equal for log n. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:251-255 [Conf]
  3. Andrzej Szepietowski
    A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL]. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:40, n:, pp:266-269 [Journal]
  4. Andrzej Szepietowski, Monika Targan
    The Counterfeit Coin Problem. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:82, n:, pp:263-268 [Journal]
  5. Andrzej Szepietowski
    On Searching Plane Labyrinths by 1-Pebble-Automata. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1983, v:19, n:1/2, pp:79-84 [Journal]
  6. Andrzej Szepietowski
    On Paterson's Problem. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1985, v:21, n:6, pp:313-314 [Journal]
  7. Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski
    Algorithms counting monotone Boolean functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:5, pp:203-209 [Journal]
  8. Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz
    Complexity of weak acceptance conditions in tree automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:4, pp:181-187 [Journal]
  9. Andrzej Szepietowski
    A Finite 5-Pebble-Automaton Can Search Every Maze. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:5, pp:199-204 [Journal]
  10. Andrzej Szepietowski
    There are no Fully Space Constructible Functions Between log log n and log n. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:6, pp:361-362 [Journal]
  11. Andrzej Szepietowski
    Remarks on Languages Acceptable in log n Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:4, pp:201-203 [Journal]
  12. Andrzej Szepietowski
    Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:2, pp:73-78 [Journal]
  13. Andrzej Szepietowski
    Some Notes on Strong and Weak log log n Space Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:2, pp:109-112 [Journal]
  14. Andrzej Szepietowski
    The Element Distinctness Problem on One-Tape Turing Machines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:4, pp:203-206 [Journal]
  15. Andrzej Szepietowski
    Weak and Strong One-Way Space Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:6, pp:299-302 [Journal]
  16. Andrzej Szepietowski, Monika Targan
    A note on the oriented chromatic number of grids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:65-70 [Journal]
  17. Andrzej Szepietowski
    A note on alternating one-pebble Turing machines with sublogarithmic space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:5, pp:174-176 [Journal]
  18. Andrzej Szepietowski
    On three-way two-dimensional turing machines. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1989, v:47, n:2, pp:135-147 [Journal]
  19. Andrzej Szepietowski
    On three-way two-dimensional multicounter automata. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1991, v:55, n:1-3, pp:35-47 [Journal]
  20. Andrzej Szepietowski
    Two-dimensional on-line tessellation acceptors are not closed under complement. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1992, v:64, n:1-2, pp:115-120 [Journal]
  21. Andrzej Szepietowski
    Some remarks on two-dimensional finite automata. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1992, v:63, n:1-2, pp:183-189 [Journal]
  22. Andrzej Szepietowski
    On space functions constructed by two-dimensional turing machines. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1992, v:60, n:1-2, pp:177-183 [Journal]
  23. Joanna Jedrzejowicz, Andrzej Szepietowski
    On the expressive power of the shuffle operator matched with intersection by regular sets. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:4, pp:379-388 [Journal]
  24. Andrzej Szepietowski
    There is no complete axiom system for shuffle expressions. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:3, pp:271-278 [Journal]
  25. Andrzej Szepietowski
    Lower space bounds for accepting shuffle languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:3, pp:303-307 [Journal]
  26. Joanna Jedrzejowicz, Andrzej Szepietowski
    Shuffle languages are in P. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:31-53 [Journal]
  27. Andrzej Szepietowski
    If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:1, pp:115-119 [Journal]

Search in 0.002secs, Finished in 0.003secs
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