We stand with Ukraine  

Andrzej Szepietowski

Orcid: 0000-0002-4884-3811

According to our database1, Andrzej Szepietowski authored at least 43 papers between 1982 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Andrzej Szepietowski
Inf. Process. Lett., 2021

2020
Signed coloring of 2-dimensional grids.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Anna Nenca
,
Andrzej Szepietowski
Inf. Process. Lett., 2020

Membership Problem for Two-Dimensional General Row Jumping Finite Automata.
[BibTeX]
[DOI]
Grzegorz Madejski
,
Andrzej Szepietowski
Int. J. Found. Comput. Sci., 2020

Oriented cliques and colorings of graphs with low maximum degree.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Pascal Ochem
,
Alexandre Pinlou
,
Andrzej Szepietowski
Discret. Math., 2020

2019
Negative closed walks in signed graphs: A note.
[BibTeX]
[DOI]
Andrzej Szepietowski
CoRR, 2019

2018
Hamiltonian cycles in hypercubes with faulty edges.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Andrzej Szepietowski
Int. J. Comput. Math. Comput. Syst. Theory, 2018

2017
Hamiltonian paths in hypercubes with local traps.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Andrzej Szepietowski
Inf. Sci., 2017

2014
The oriented chromatic number of Halin graphs.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Andrzej Szepietowski
Inf. Process. Lett., 2014

2013
Coloring directed cycles.
[BibTeX]
[DOI]
Andrzej Szepietowski
CoRR, 2013

2012
Hamiltonian cycles in hypercubes with 2n-4 faulty edges.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Sci., 2012

Fault tolerance of edge pancyclicity in alternating group graphs.
[BibTeX]
[DOI]
Andrzej Szepietowski
Appl. Math. Comput., 2012

2011
Closure properties of hyper-minimized automata.
[BibTeX]
[DOI]
Andrzej Szepietowski
RAIRO Theor. Informatics Appl., 2011

Fault tolerance of vertex pancyclicity in alternating group graphs.
[BibTeX]
[DOI]
Andrzej Szepietowski
Appl. Math. Comput., 2011

2010
Fault-tolerant edge and vertex pancyclicity in alternating group graphs.
[BibTeX]
[DOI]
Andrzej Szepietowski
Appl. Math. Comput., 2010

2008
Fooling Turing machines with sublogarithmic space: a note on 'For completeness, sublogarithmic space is no space' by M. Agrawal.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 2008

2006
A note on alternating one-pebble Turing machines with sublogarithmic space.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 2006

2004
A note on the oriented chromatic number of grids.
[BibTeX]
[DOI]
Andrzej Szepietowski
,
Monika Targan
Inf. Process. Lett., 2004

The Counterfeit Coin Problem.
[BibTeX]
Andrzej Szepietowski
,
Monika Targan
Bull. EATCS, 2004

2002
Complexity of weak acceptance conditions in tree automata.
[BibTeX]
[DOI]
Jakub Neumann
,
Andrzej Szepietowski
,
Igor Walukiewicz
Inf. Process. Lett., 2002

2001
Shuffle languages are in P.
[BibTeX]
[DOI]
Joanna Jedrzejowicz
,
Andrzej Szepietowski
Theor. Comput. Sci., 2001

On the expressive power of the shuffle operator matched with intersection by regular sets.
[BibTeX]
[DOI]
Joanna Jedrzejowicz
,
Andrzej Szepietowski
RAIRO Theor. Informatics Appl., 2001

Algorithms counting monotone Boolean functions.
[BibTeX]
[DOI]
Robert Fidytek
,
Andrzej Wlodzimierz Mostowski
,
Rafal Somla
,
Andrzej Szepietowski
Inf. Process. Lett., 2001

The Emptiness Problem for Weak Rabin Tree Automata.
[BibTeX]
Jakub Neumann
,
Andrzej Szepietowski
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

1999
Lower space bounds for accepting shuffle languages.
[BibTeX]
[DOI]
Andrzej Szepietowski
RAIRO Theor. Informatics Appl., 1999

There is no complete axiom system for shuffle expressions.
[BibTeX]
[DOI]
Andrzej Szepietowski
RAIRO Theor. Informatics Appl., 1999

1998
Weak and Strong One-Way Space Complexity Classes.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 1998

1996
The Element Distinctness Problem on One-Tape Turing Machines.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 1996

1994
Turing Machines with Sublogarithmic Space
[BibTeX]
[DOI]
Andrzej Szepietowski
Lecture Notes in Computer Science 843, Springer, ISBN: 3-540-58355-6, 1994

1992
On space functions constructed by two-dimensional turing machines.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Sci., 1992

Some remarks on two-dimensional finite automata.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Sci., 1992

Two-dimensional on-line tessellation acceptors are not closed under complement.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Sci., 1992

1991
On three-way two-dimensional multicounter automata.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Sci., 1991

1990
If Deterministic and Nondeterministic Space Complexities are Equal for <i>log log n</i>, then they are also Equal for <i>log n</i>.
[BibTeX]
[DOI]
Andrzej Szepietowski
Theor. Comput. Sci., 1990

A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL].
[BibTeX]
Andrzej Szepietowski
Bull. EATCS, 1990

1989
On three-way two-dimensional turing machines.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Sci., 1989

Some Notes on Strong and Weak log log n Space Complexity.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 1989

Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 1989

1988
Remarks on Languages Acceptable in log n Space.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 1988

1987
There are no Fully Space Constructible Functions Between log log n and log n.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 1987

1985
On Paterson's Problem.
[BibTeX]
Andrzej Szepietowski
J. Inf. Process. Cybern., 1985

1983
On Searching Plane Labyrinths by 1-Pebble-Automata.
[BibTeX]
Andrzej Szepietowski
J. Inf. Process. Cybern., 1983

Remarks on Searching Labyrinths by Automata.
[BibTeX]
[DOI]
Andrzej Szepietowski
Proceedings of the Fundamentals of Computation Theory, 1983

1982
A Finite 5-Pebble-Automaton Can Search Every Maze.
[BibTeX]
[DOI]
Andrzej Szepietowski
Inf. Process. Lett., 1982


  Loading...