| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrzej Szepietowski |
Fault tolerance of edge pancyclicity in alternating group graphs.  |
Applied Mathematics and Computation  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Fault tolerance of vertex pancyclicity in alternating group graphs. |
Applied Mathematics and Computation |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Fault-tolerant edge and vertex pancyclicity in alternating group graphs. |
Applied Mathematics and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Fooling Turing machines with sublogarithmic space: a note on 'For completeness, sublogarithmic space is no space' by M. Agrawal. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
A note on alternating one-pebble Turing machines with sublogarithmic space. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joanna Jedrzejowicz, Andrzej Szepietowski (eds.) |
Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings |
MFCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andrzej Szepietowski, Monika Targan |
A note on the oriented chromatic number of grids. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski, Monika Targan |
The Counterfeit Coin Problem. |
Bulletin of the EATCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz |
Complexity of weak acceptance conditions in tree automata. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski |
Algorithms counting monotone Boolean functions. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joanna Jedrzejowicz, Andrzej Szepietowski |
Shuffle languages are in P. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joanna Jedrzejowicz, Andrzej Szepietowski |
On the expressive power of the shuffle operator matched with intersection by regular sets. |
ITA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Neumann, Andrzej Szepietowski |
The Emptiness Problem for Weak Rabin Tree Automata. |
DCFS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
There is no complete axiom system for shuffle expressions. |
ITA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Lower space bounds for accepting shuffle languages. |
ITA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Weak and Strong One-Way Space Complexity Classes. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
The Element Distinctness Problem on One-Tape Turing Machines. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Turing Machines with Sublogarithmic Space |
|
1994 |
DOI RDF |
|
| 1 | Andrzej Szepietowski |
Some remarks on two-dimensional finite automata. |
Inf. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
On space functions constructed by two-dimensional turing machines. |
Inf. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Two-dimensional on-line tessellation acceptors are not closed under complement. |
Inf. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
On three-way two-dimensional multicounter automata. |
Inf. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL]. |
Bulletin of the EATCS |
1990 |
DBLP BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Some Notes on Strong and Weak log log n Space Complexity. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
On three-way two-dimensional turing machines. |
Inf. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
If Deterministic and Nondeterministic Space Complexities are Equal for log log n then they are also Equal for log n. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Remarks on Languages Acceptable in log n Space. |
Inf. Process. Lett. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
There are no Fully Space Constructible Functions Between log log n and log n. |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
On Paterson's Problem. |
Elektronische Informationsverarbeitung und Kybernetik |
1985 |
DBLP BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
On Searching Plane Labyrinths by 1-Pebble-Automata. |
Elektronische Informationsverarbeitung und Kybernetik |
1983 |
DBLP BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
Remarks on Searching Labyrinths by Automata. |
FCT |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Szepietowski |
A Finite 5-Pebble-Automaton Can Search Every Maze. |
Inf. Process. Lett. |
1982 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")