Andrzej Szepietowski

From MaRDI portal
Person:293472

Available identifiers

zbMath Open szepietowski.andrzejDBLP96/2354WikidataQ76375645 ScholiaQ76375645MaRDI QIDQ293472

List of research outcomes





PublicationDate of PublicationType
Counting self-dual monotone Boolean functions2023-10-19Paper
https://portal.mardi4nfdi.de/entity/Q61360252023-08-28Paper
https://portal.mardi4nfdi.de/entity/Q50603062023-01-10Paper
If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n2022-08-16Paper
Fixes of permutations acting on monotone Boolean functions2022-05-08Paper
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges2021-10-19Paper
Membership Problem for Two-Dimensional General Row Jumping Finite Automata2021-04-19Paper
Oriented cliques and colorings of graphs with low maximum degree2020-03-20Paper
Signed coloring of 2-dimensional grids2020-02-11Paper
Hamiltonian paths in hypercubes with local traps2020-01-07Paper
Negative closed walks in signed graphs: A note2019-10-14Paper
Weak and strong one-way space complexity classes2016-06-09Paper
The oriented chromatic number of Halin graphs2015-06-25Paper
Coloring directed cycles2013-07-19Paper
Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges2012-11-15Paper
Fault tolerance of edge pancyclicity in alternating group graphs2012-08-19Paper
Closure properties of hyper-minimized automata2012-02-28Paper
Fault tolerance of vertex pancyclicity in alternating group graphs2011-04-19Paper
Fault-tolerant edge and vertex pancyclicity in alternating group graphs2010-11-18Paper
Fooling Turing machines with sublogarithmic space: a note on `For completeness, sublogarithmic space is no space' by M. Agrawal2010-04-19Paper
A note on alternating one-pebble Turing machines with sublogarithmic space2010-01-18Paper
https://portal.mardi4nfdi.de/entity/Q33959962009-09-15Paper
A note on the oriented chromatic number of grids2009-08-27Paper
Complexity of weak acceptance conditions in tree automata.2003-01-21Paper
Algorithms counting monotone Boolean functions2002-07-14Paper
On the expressive power of the shuffle operator matched with intersection by regular sets2002-06-03Paper
Lower Space Bounds for Accepting Shuffle Languages2000-12-18Paper
Shuffle languages are in P2000-12-12Paper
There is no complete axiom system for shuffle expressions2000-01-04Paper
The element distinctness problem on one-tape Turing machines1997-02-27Paper
Turing machines with sublogarithmic space1994-12-01Paper
Some remarks on two-dimensional finite automata1992-09-27Paper
Two-dimensional on-line tessellation acceptors are not closed under complement1992-09-27Paper
On space functions constructed by two-dimensional Turing machines1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39712881992-06-25Paper
On three-way two-dimensional multicounter automata1991-01-01Paper
If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n1990-01-01Paper
On three-way two-dimensional Turing machines1989-01-01Paper
Some notes on strong and weak log log n space complexity1989-01-01Paper
Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space1989-01-01Paper
Remarks on languages acceptable in log log n space1988-01-01Paper
There are no fully space constructible functions between log log n and log n1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37048931985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33165971983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36591401983-01-01Paper
A finite 5-pebble-automaton can search every maze1982-01-01Paper

Research outcomes over time

This page was built for person: Andrzej Szepietowski