default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Szepietowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1994
[b1]Andrzej Szepietowski:
Turing Machines with Sublogarithmic Space. Lecture Notes in Computer Science 843, Springer 1994, ISBN 3-540-58355-6
Journal Articles
- 2021
- [j38]Janusz Dybizbanski
, Andrzej Szepietowski:
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges. Inf. Process. Lett. 172: 106157 (2021) - 2020
- [j37]Janusz Dybizbanski, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski:
Oriented cliques and colorings of graphs with low maximum degree. Discret. Math. 343(5): 111829 (2020) - [j36]Grzegorz Madejski, Andrzej Szepietowski:
Membership Problem for Two-Dimensional General Row Jumping Finite Automata. Int. J. Found. Comput. Sci. 31(4): 527-538 (2020) - [j35]Janusz Dybizbanski, Anna Nenca, Andrzej Szepietowski:
Signed coloring of 2-dimensional grids. Inf. Process. Lett. 156: 105918 (2020) - 2018
- [j34]Janusz Dybizbanski, Andrzej Szepietowski:
Hamiltonian cycles in hypercubes with faulty edges. Int. J. Comput. Math. Comput. Syst. Theory 3(4): 244-261 (2018) - 2017
- [j33]Janusz Dybizbanski, Andrzej Szepietowski:
Hamiltonian paths in hypercubes with local traps. Inf. Sci. 375: 258-270 (2017) - 2014
- [j32]Janusz Dybizbanski, Andrzej Szepietowski:
The oriented chromatic number of Halin graphs. Inf. Process. Lett. 114(1-2): 45-49 (2014) - 2012
- [j31]Andrzej Szepietowski:
Fault tolerance of edge pancyclicity in alternating group graphs. Appl. Math. Comput. 218(19): 9875-9881 (2012) - [j30]Andrzej Szepietowski:
Hamiltonian cycles in hypercubes with 2n-4 faulty edges. Inf. Sci. 215: 75-82 (2012) - 2011
- [j29]Andrzej Szepietowski:
Fault tolerance of vertex pancyclicity in alternating group graphs. Appl. Math. Comput. 217(16): 6785-6791 (2011) - [j28]Andrzej Szepietowski:
Closure properties of hyper-minimized automata. RAIRO Theor. Informatics Appl. 45(4): 459-466 (2011) - 2010
- [j27]Andrzej Szepietowski:
Fault-tolerant edge and vertex pancyclicity in alternating group graphs. Appl. Math. Comput. 217(6): 2827-2832 (2010) - 2008
- [j26]Andrzej Szepietowski:
Fooling Turing machines with sublogarithmic space: a note on 'For completeness, sublogarithmic space is no space' by M. Agrawal. Inf. Process. Lett. 106(4): 162-163 (2008) - 2006
- [j25]Andrzej Szepietowski:
A note on alternating one-pebble Turing machines with sublogarithmic space. Inf. Process. Lett. 98(5): 174-176 (2006) - 2004
- [j24]Andrzej Szepietowski, Monika Targan:
The Counterfeit Coin Problem. Bull. EATCS 82: 263-268 (2004) - [j23]Andrzej Szepietowski, Monika Targan:
A note on the oriented chromatic number of grids. Inf. Process. Lett. 92(2): 65-70 (2004) - 2002
- [j22]Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz:
Complexity of weak acceptance conditions in tree automata. Inf. Process. Lett. 84(4): 181-187 (2002) - 2001
- [j21]Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski:
Algorithms counting monotone Boolean functions. Inf. Process. Lett. 79(5): 203-209 (2001) - [j20]Joanna Jedrzejowicz, Andrzej Szepietowski:
On the expressive power of the shuffle operator matched with intersection by regular sets. RAIRO Theor. Informatics Appl. 35(4): 379-388 (2001) - [j19]Joanna Jedrzejowicz, Andrzej Szepietowski:
Shuffle languages are in P. Theor. Comput. Sci. 250(1-2): 31-53 (2001) - 1999
- [j18]Andrzej Szepietowski:
There is no complete axiom system for shuffle expressions. RAIRO Theor. Informatics Appl. 33(3): 271-278 (1999) - [j17]Andrzej Szepietowski:
Lower space bounds for accepting shuffle languages. RAIRO Theor. Informatics Appl. 33(3): 303-307 (1999) - 1998
- [j16]Andrzej Szepietowski:
Weak and Strong One-Way Space Complexity Classes. Inf. Process. Lett. 68(6): 299-302 (1998) - 1996
- [j15]Andrzej Szepietowski:
The Element Distinctness Problem on One-Tape Turing Machines. Inf. Process. Lett. 59(4): 203-206 (1996) - 1992
- [j14]Andrzej Szepietowski:
On space functions constructed by two-dimensional turing machines. Inf. Sci. 60(1-2): 177-183 (1992) - [j13]Andrzej Szepietowski:
Some remarks on two-dimensional finite automata. Inf. Sci. 63(1-2): 183-189 (1992) - [j12]Andrzej Szepietowski:
Two-dimensional on-line tessellation acceptors are not closed under complement. Inf. Sci. 64(1-2): 115-120 (1992) - 1991
- [j11]Andrzej Szepietowski:
On three-way two-dimensional multicounter automata. Inf. Sci. 55(1-3): 35-47 (1991) - 1990
- [j10]Andrzej Szepietowski:
A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL]. Bull. EATCS 40: 266-269 (1990) - [j9]Andrzej Szepietowski:
If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n. Theor. Comput. Sci. 74(1): 115-119 (1990) - 1989
- [j8]Andrzej Szepietowski:
Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space. Inf. Process. Lett. 33(2): 73-78 (1989) - [j7]Andrzej Szepietowski:
Some Notes on Strong and Weak log log n Space Complexity. Inf. Process. Lett. 33(2): 109-112 (1989) - [j6]Andrzej Szepietowski:
On three-way two-dimensional turing machines. Inf. Sci. 47(2): 135-147 (1989) - 1988
- [j5]Andrzej Szepietowski:
Remarks on Languages Acceptable in log n Space. Inf. Process. Lett. 27(4): 201-203 (1988) - 1987
- [j4]Andrzej Szepietowski:
There are no Fully Space Constructible Functions Between log log n and log n. Inf. Process. Lett. 24(6): 361-362 (1987) - 1985
- [j3]Andrzej Szepietowski:
On Paterson's Problem. J. Inf. Process. Cybern. 21(6): 313-314 (1985) - 1983
- [j2]Andrzej Szepietowski:
On Searching Plane Labyrinths by 1-Pebble-Automata. J. Inf. Process. Cybern. 19(1/2): 79-84 (1983) - 1982
- [j1]Andrzej Szepietowski:
A Finite 5-Pebble-Automaton Can Search Every Maze. Inf. Process. Lett. 15(5): 199-204 (1982)
Conference and Workshop Papers
- 2001
- [c3]Jakub Neumann, Andrzej Szepietowski:
The Emptiness Problem for Weak Rabin Tree Automata. DCFS 2001: 149-158 - 1989
- [c2]Andrzej Szepietowski:
If Deterministic and Nondeterministic Space Complexities are Equal for log log n then they are also Equal for log n. STACS 1989: 251-255 - 1983
- [c1]Andrzej Szepietowski:
Remarks on Searching Labyrinths by Automata. FCT 1983: 457-464
Editorship
- 2005
- [e1]Joanna Jedrzejowicz, Andrzej Szepietowski:
Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings. Lecture Notes in Computer Science 3618, Springer 2005, ISBN 3-540-28702-7 [contents]
Informal and Other Publications
- 2019
- [i5]Andrzej Szepietowski:
Negative closed walks in signed graphs: A note. CoRR abs/1910.06032 (2019) - 2018
- [i4]Janusz Dybizbanski, Andrzej Szepietowski:
Hamiltonian cycles in hypercubes with faulty edges. CoRR abs/1803.00064 (2018) - [i3]Janusz Dybizbanski, Andrzej Szepietowski:
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges. CoRR abs/1811.11516 (2018) - 2013
- [i2]Janusz Dybizbanski, Andrzej Szepietowski:
Oriented chromatic number of Halin graphs. CoRR abs/1307.4901 (2013) - [i1]Andrzej Szepietowski:
Coloring directed cycles. CoRR abs/1307.5186 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
