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