Andrzej Szepietowski

48 papers A 1B 2Journal 43Unranked 1
YearRankTypeTitle / Venue / Authors
2021 J jnl
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges.
Inf. Process. Lett.
Janusz Dybizbanski, Andrzej Szepietowski
2020 J jnl
Membership Problem for Two-Dimensional General Row Jumping Finite Automata.
Int. J. Found. Comput. Sci.
Grzegorz Madejski, Andrzej Szepietowski
2020 J jnl
Oriented cliques and colorings of graphs with low maximum degree.
Discret. Math.
Janusz Dybizbanski, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski
2020 J jnl
Signed coloring of 2-dimensional grids.
Inf. Process. Lett.
Janusz Dybizbanski, Anna Nenca, Andrzej Szepietowski
2019 J jnl
Negative closed walks in signed graphs: A note.
CoRR
Andrzej Szepietowski
2018 J jnl
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges.
CoRR
Janusz Dybizbanski, Andrzej Szepietowski
2018 J jnl
Hamiltonian cycles in hypercubes with faulty edges.
CoRR
Janusz Dybizbanski, Andrzej Szepietowski
2018 J jnl
Hamiltonian cycles in hypercubes with faulty edges.
Int. J. Comput. Math. Comput. Syst. Theory
Janusz Dybizbanski, Andrzej Szepietowski
2017 J jnl
Hamiltonian paths in hypercubes with local traps.
Inf. Sci.
Janusz Dybizbanski, Andrzej Szepietowski
2014 J jnl
The oriented chromatic number of Halin graphs.
Inf. Process. Lett.
Janusz Dybizbanski, Andrzej Szepietowski
2013 J jnl
Coloring directed cycles.
CoRR
Andrzej Szepietowski
2013 J jnl
Oriented chromatic number of Halin graphs.
CoRR
Janusz Dybizbanski, Andrzej Szepietowski
2012 J jnl
Fault tolerance of edge pancyclicity in alternating group graphs.
Appl. Math. Comput.
Andrzej Szepietowski
2012 J jnl
Hamiltonian cycles in hypercubes with 2n-4 faulty edges.
Inf. Sci.
Andrzej Szepietowski
2011 J jnl
Closure properties of hyper-minimized automata.
RAIRO Theor. Informatics Appl.
Andrzej Szepietowski
2011 J jnl
Fault tolerance of vertex pancyclicity in alternating group graphs.
Appl. Math. Comput.
Andrzej Szepietowski
2010 J jnl
Fault-tolerant edge and vertex pancyclicity in alternating group graphs.
Appl. Math. Comput.
Andrzej Szepietowski
2008 J jnl
Fooling Turing machines with sublogarithmic space: a note on 'For completeness, sublogarithmic space is no space' by M. Agrawal.
Inf. Process. Lett.
Andrzej Szepietowski
2006 J jnl
A note on alternating one-pebble Turing machines with sublogarithmic space.
Inf. Process. Lett.
Andrzej Szepietowski
2005 B ed.
Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings
MFCS
Joanna Jedrzejowicz, Andrzej Szepietowski
2004 J jnl
A note on the oriented chromatic number of grids.
Inf. Process. Lett.
Andrzej Szepietowski, Monika Targan
2004 J jnl
The Counterfeit Coin Problem.
Bull. EATCS
Andrzej Szepietowski, Monika Targan
2002 J jnl
Complexity of weak acceptance conditions in tree automata.
Inf. Process. Lett.
Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz
2001 J jnl
Algorithms counting monotone Boolean functions.
Inf. Process. Lett.
Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski
2001 J jnl
On the expressive power of the shuffle operator matched with intersection by regular sets.
RAIRO Theor. Informatics Appl.
Joanna Jedrzejowicz, Andrzej Szepietowski
2001 J jnl
Shuffle languages are in P.
Theor. Comput. Sci.
Joanna Jedrzejowicz, Andrzej Szepietowski
2001 — conf
The Emptiness Problem for Weak Rabin Tree Automata.
DCFS
Jakub Neumann, Andrzej Szepietowski
1999 J jnl
Lower space bounds for accepting shuffle languages.
RAIRO Theor. Informatics Appl.
Andrzej Szepietowski
1999 J jnl
There is no complete axiom system for shuffle expressions.
RAIRO Theor. Informatics Appl.
Andrzej Szepietowski
1998 J jnl
Weak and Strong One-Way Space Complexity Classes.
Inf. Process. Lett.
Andrzej Szepietowski
1996 J jnl
The Element Distinctness Problem on One-Tape Turing Machines.
Inf. Process. Lett.
Andrzej Szepietowski
1994 — book
Turing Machines with Sublogarithmic Space
Andrzej Szepietowski
1992 J jnl
On space functions constructed by two-dimensional turing machines.
Inf. Sci.
Andrzej Szepietowski
1992 J jnl
Some remarks on two-dimensional finite automata.
Inf. Sci.
Andrzej Szepietowski
1992 J jnl
Two-dimensional on-line tessellation acceptors are not closed under complement.
Inf. Sci.
Andrzej Szepietowski
1991 J jnl
On three-way two-dimensional multicounter automata.
Inf. Sci.
Andrzej Szepietowski
1990 J jnl
A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL].
Bull. EATCS
Andrzej Szepietowski
1990 J jnl
If Deterministic and Nondeterministic Space Complexities are Equal for
Theor. Comput. Sci.
Andrzej Szepietowski
1989 A conf
If Deterministic and Nondeterministic Space Complexities are Equal for
STACS
Andrzej Szepietowski
1989 J jnl
On three-way two-dimensional turing machines.
Inf. Sci.
Andrzej Szepietowski
1989 J jnl
Some Notes on Strong and Weak log log n Space Complexity.
Inf. Process. Lett.
Andrzej Szepietowski
1989 J jnl
Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space.
Inf. Process. Lett.
Andrzej Szepietowski
1988 J jnl
Remarks on Languages Acceptable in log n Space.
Inf. Process. Lett.
Andrzej Szepietowski
1987 J jnl
There are no Fully Space Constructible Functions Between log log n and log n.
Inf. Process. Lett.
Andrzej Szepietowski
1985 J jnl
On Paterson's Problem.
J. Inf. Process. Cybern.
Andrzej Szepietowski
1983 J jnl
On Searching Plane Labyrinths by 1-Pebble-Automata.
J. Inf. Process. Cybern.
Andrzej Szepietowski
1983 B conf
Remarks on Searching Labyrinths by Automata.
FCT
Andrzej Szepietowski
1982 J jnl
A Finite 5-Pebble-Automaton Can Search Every Maze.
Inf. Process. Lett.
Andrzej Szepietowski