| Turing machines with sublogarithmic space A Szepietowski Springer Berlin Heidelberg, 1994 | 155 | 1994 |
| Shuffle languages are in P J Jȩdrzejowicz, A Szepietowski Theoretical Computer Science 250 (1-2), 31-53, 2001 | 67 | 2001 |
| Algorithms counting monotone Boolean functions R Fidytek, AW Mostowski, R Somla, A Szepietowski Information Processing Letters 79 (5), 203-209, 2001 | 38 | 2001 |
| A finite 5-pebble-automaton can search every maze A Szepietowski Inf. Process. Lett. 15 (5), 199-204, 1982 | 21 | 1982 |
| A note on the oriented chromatic number of grids A Szepietowski, M Targan Information processing letters 92 (2), 65-70, 2004 | 17 | 2004 |
| On three-way two-dimensional Turing machines A Szepietowski Information sciences 47 (2), 135-147, 1989 | 17 | 1989 |
| Fault tolerance of vertex pancyclicity in alternating group graphs A Szepietowski Applied Mathematics and Computation 217 (16), 6785-6791, 2011 | 16 | 2011 |
| The oriented chromatic number of Halin graphs J Dybizbański, A Szepietowski Information Processing Letters 114 (1-2), 45-49, 2014 | 15 | 2014 |
| Remarks on languages acceptable in log log n space A Szepietowski Information processing letters 27 (4), 201-203, 1988 | 15 | 1988 |
| Hamiltonian cycles in hypercubes with 2n-4 faulty edges A Szepietowski Information Sciences 215, 75-82, 2012 | 14 | 2012 |
| If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n A Szepietowski Theoretical Computer Science 74 (1), 115-119, 1990 | 13 | 1990 |
| Complexity of weak acceptance conditions in tree automata J Neumann, A Szepietowski, I Walukiewicz Information processing letters 84 (4), 181-187, 2002 | 12 | 2002 |
| On three-way two-dimensional multicounter automata A Szepietowski Information Sciences 55 (1-3), 35-47, 1991 | 11 | 1991 |
| Oriented cliques and colorings of graphs with low maximum degree J Dybizbański, P Ochem, A Pinlou, A Szepietowski Discrete Mathematics 343 (5), 111829, 2020 | 10 | 2020 |
| Hamiltonian paths in hypercubes with local traps J Dybizbański, A Szepietowski Information Sciences 375, 258-270, 2017 | 10 | 2017 |
| Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space A Szepietowski Information processing letters 33 (2), 73-78, 1989 | 10 | 1989 |
| On the expressive power of the shuffle operator matched with intersection by regular sets J Jędrzejowicz, A Szepietowski RAIRO-Theoretical Informatics and Applications 35 (4), 379-388, 2001 | 9 | 2001 |
| Proceedings of the 30th international conference on Mathematical Foundations of Computer Science J Jȩdrzejowicz, A Szepietowski Springer-Verlag, 2005 | 8 | 2005 |
| Some notes on strong and weak log log n space complexity A Szepietowski Information processing letters 33 (2), 109-112, 1989 | 8 | 1989 |
| If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n A Szepietowski STACS 89: 6th Annual Symposium on Theoretical Aspects of Computer Science …, 1989 | 8 | 1989 |
