Andrzej Szepietowski

Available identifiers

zbMath Open szepietowski.andrzejWikidataQ76375645 ScholiaQ76375645MaRDI QIDQ293472

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6136025	2023-08-28	Paper
https://portal.mardi4nfdi.de/entity/Q5060306	2023-01-10	Paper
If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n	2022-08-16	Paper
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges	2021-10-19	Paper
Membership Problem for Two-Dimensional General Row Jumping Finite Automata	2021-04-19	Paper
Oriented cliques and colorings of graphs with low maximum degree	2020-03-20	Paper
Signed coloring of 2-dimensional grids	2020-02-11	Paper
Hamiltonian paths in hypercubes with local traps	2020-01-07	Paper
Weak and strong one-way space complexity classes	2016-06-09	Paper
The oriented chromatic number of Halin graphs	2015-06-25	Paper
Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges	2012-11-15	Paper
Fault tolerance of edge pancyclicity in alternating group graphs	2012-08-19	Paper
Closure properties of hyper-minimized automata	2012-02-28	Paper
Fault tolerance of vertex pancyclicity in alternating group graphs	2011-04-19	Paper
Fault-tolerant edge and vertex pancyclicity in alternating group graphs	2010-11-18	Paper
Fooling Turing machines with sublogarithmic space: a note on `For completeness, sublogarithmic space is no space' by M. Agrawal	2010-04-19	Paper
A note on alternating one-pebble Turing machines with sublogarithmic space	2010-01-18	Paper
https://portal.mardi4nfdi.de/entity/Q3395996	2009-09-15	Paper
A note on the oriented chromatic number of grids	2009-08-27	Paper
Complexity of weak acceptance conditions in tree automata.	2003-01-21	Paper
Algorithms counting monotone Boolean functions	2002-07-14	Paper
On the expressive power of the shuffle operator matched with intersection by regular sets	2002-06-03	Paper
Lower Space Bounds for Accepting Shuffle Languages	2000-12-18	Paper
Shuffle languages are in P	2000-12-12	Paper
There is no complete axiom system for shuffle expressions	2000-01-04	Paper
The element distinctness problem on one-tape Turing machines	1997-02-27	Paper
Turing machines with sublogarithmic space	1994-12-01	Paper
Two-dimensional on-line tessellation acceptors are not closed under complement	1992-09-27	Paper
Some remarks on two-dimensional finite automata	1992-09-27	Paper
On space functions constructed by two-dimensional Turing machines	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3971288	1992-06-25	Paper
On three-way two-dimensional multicounter automata	1991-01-01	Paper
If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n	1990-01-01	Paper
On three-way two-dimensional Turing machines	1989-01-01	Paper
Some notes on strong and weak log log n space complexity	1989-01-01	Paper
Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space	1989-01-01	Paper
Remarks on languages acceptable in log log n space	1988-01-01	Paper
There are no fully space constructible functions between log log n and log n	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3704893	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3316597	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3659140	1983-01-01	Paper
A finite 5-pebble-automaton can search every maze	1982-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Andrzej Szepietowski