Andrzej Szepietowski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2021

Hamiltonian cycles and paths in hypercubes with disjoint faulty edgesJanusz Dybizbanski, Andrzej Szepietowski. ipl, 172:106157, 2021. [doi]

2020

Signed coloring of 2-dimensional gridsJanusz Dybizbanski, Anna Nenca, Andrzej Szepietowski. ipl, 156:105918, 2020. [doi]

Oriented cliques and colorings of graphs with low maximum degreeJanusz Dybizbanski, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski. DM, 343(5):111829, 2020. [doi]

Membership Problem for Two-Dimensional General Row Jumping Finite AutomataGrzegorz Madejski, Andrzej Szepietowski. ijfcs, 31(4):527-538, 2020. [doi]

2018

Hamiltonian cycles in hypercubes with faulty edgesJanusz Dybizbanski, Andrzej Szepietowski. ijcmcst, 3(4):244-261, 2018. [doi]

2017

Hamiltonian paths in hypercubes with local trapsJanusz Dybizbanski, Andrzej Szepietowski. isci, 375:258-270, 2017. [doi]

2014

The oriented chromatic number of Halin graphsJanusz Dybizbanski, Andrzej Szepietowski. ipl, 114(1-2):45-49, 2014. [doi]

2012

Hamiltonian cycles in hypercubes with 2n-4 faulty edgesAndrzej Szepietowski. isci, 215:75-82, 2012. [doi]

Fault tolerance of edge pancyclicity in alternating group graphsAndrzej Szepietowski. amc, 218(19):9875-9881, 2012. [doi]

2011

Fault tolerance of vertex pancyclicity in alternating group graphsAndrzej Szepietowski. amc, 217(16):6785-6791, 2011. [doi]

Closure properties of hyper-minimized automataAndrzej Szepietowski. ita, 45(4):459-466, 2011. [doi]

2010

Fault-tolerant edge and vertex pancyclicity in alternating group graphsAndrzej Szepietowski. amc, 217(6):2827-2832, 2010. [doi]

2008

Fooling Turing machines with sublogarithmic space: a note on For completeness, sublogarithmic space is no space by M. AgrawalAndrzej Szepietowski. ipl, 106(4):162-163, 2008. [doi]

2006

A note on alternating one-pebble Turing machines with sublogarithmic spaceAndrzej Szepietowski. ipl, 98(5):174-176, 2006. [doi]

2004

A note on the oriented chromatic number of gridsAndrzej Szepietowski, Monika Targan. ipl, 92(2):65-70, 2004. [doi]

The Counterfeit Coin ProblemAndrzej Szepietowski, Monika Targan. eatcs, 82:263-268, 2004.

2002

Complexity of weak acceptance conditions in tree automataJakub Neumann, Andrzej Szepietowski, Igor Walukiewicz. ipl, 84(4):181-187, 2002. [doi]

2001

1999

There is no complete axiom system for shuffle expressionsAndrzej Szepietowski. ita, 33(3):271-278, 1999.

Lower space bounds for accepting shuffle languagesAndrzej Szepietowski. ita, 33(3):303-307, 1999.

1998

Weak and Strong One-Way Space Complexity ClassesAndrzej Szepietowski. ipl, 68(6):299-302, 1998. [doi]

1996

The Element Distinctness Problem on One-Tape Turing MachinesAndrzej Szepietowski. ipl, 59(4):203-206, 1996. [doi]

1994

Turing Machines with Sublogarithmic SpaceAndrzej Szepietowski. Volume 843 of Lecture Notes in Computer Science, Springer, 1994.

1992

Two-dimensional on-line tessellation acceptors are not closed under complementAndrzej Szepietowski. isci, 64(1-2):115-120, 1992. [doi]

Some remarks on two-dimensional finite automataAndrzej Szepietowski. isci, 63(1-2):183-189, 1992. [doi]

On space functions constructed by two-dimensional turing machinesAndrzej Szepietowski. isci, 60(1-2):177-183, 1992. [doi]

1991

On three-way two-dimensional multicounter automataAndrzej Szepietowski. isci, 55(1-3):35-47, 1991. [doi]

1990

A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL]Andrzej Szepietowski. eatcs, 40:266-269, 1990.

If Deterministic and Nondeterministic Space Complexities are Equal for ::::log log n::::, then they are also Equal for ::::log n::::Andrzej Szepietowski. TCS, 74(1):115-119, 1990.

1989

On three-way two-dimensional turing machinesAndrzej Szepietowski. isci, 47(2):135-147, 1989. [doi]

If Deterministic and Nondeterministic Space Complexities are Equal for ::::log log n:::: then they are also Equal for ::::log n::::Andrzej Szepietowski. STACS 1989: 251-255

Some Notes on Strong and Weak log log n Space ComplexityAndrzej Szepietowski. ipl, 33(2):109-112, 1989.

Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic SpaceAndrzej Szepietowski. ipl, 33(2):73-78, 1989.

1988

Remarks on Languages Acceptable in log n SpaceAndrzej Szepietowski. ipl, 27(4):201-203, 1988.

1987

There are no Fully Space Constructible Functions Between log log n and log nAndrzej Szepietowski. ipl, 24(6):361-362, 1987.

1985

On Paterson s ProblemAndrzej Szepietowski. eik, 21(6):313-314, 1985.

1983

Remarks on Searching Labyrinths by AutomataAndrzej Szepietowski. fct 1983: 457-464

On Searching Plane Labyrinths by 1-Pebble-AutomataAndrzej Szepietowski. eik, 19(1/2):79-84, 1983.

1982

A Finite 5-Pebble-Automaton Can Search Every MazeAndrzej Szepietowski. ipl, 15(5):199-204, 1982.

Sign in or sign up to see more results.

runs on WebDSL