| Publication | Date of Publication | Type |
|---|
Counting self-dual monotone Boolean functions
| 2023-10-19 | Paper |
scientific article; zbMATH DE number 7732140 (Why is no real title available?)
| 2023-08-28 | Paper |
scientific article; zbMATH DE number 7640036 (Why is no real title available?)
| 2023-01-10 | Paper |
If deterministic and nondeterministic space complexities are equal for \(\log \log n\) then they are also equal for \(\log n\)
STACS 89 | 2022-08-16 | Paper |
Fixes of permutations acting on monotone Boolean functions
| 2022-05-08 | Paper |
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Information Processing Letters | 2021-10-19 | Paper |
Membership problem for two-dimensional general row jumping finite automata
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Oriented cliques and colorings of graphs with low maximum degree
Discrete Mathematics | 2020-03-20 | Paper |
Signed coloring of 2-dimensional grids
Information Processing Letters | 2020-02-11 | Paper |
Hamiltonian paths in hypercubes with local traps
Information Sciences | 2020-01-07 | Paper |
Negative closed walks in signed graphs: A note
| 2019-10-14 | Paper |
Weak and strong one-way space complexity classes
Information Processing Letters | 2016-06-09 | Paper |
The oriented chromatic number of Halin graphs
Information Processing Letters | 2015-06-25 | Paper |
Coloring directed cycles
| 2013-07-19 | Paper |
Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
Information Sciences | 2012-11-15 | Paper |
Fault tolerance of edge pancyclicity in alternating group graphs
Applied Mathematics and Computation | 2012-08-19 | Paper |
Closure properties of hyper-minimized automata
RAIRO - Theoretical Informatics and Applications | 2012-02-28 | Paper |
Fault tolerance of vertex pancyclicity in alternating group graphs
Applied Mathematics and Computation | 2011-04-19 | Paper |
Fault-tolerant edge and vertex pancyclicity in alternating group graphs
Applied Mathematics and Computation | 2010-11-18 | Paper |
Fooling Turing machines with sublogarithmic space: a note on `For completeness, sublogarithmic space is no space' by M. Agrawal
Information Processing Letters | 2010-04-19 | Paper |
A note on alternating one-pebble Turing machines with sublogarithmic space
Information Processing Letters | 2010-01-18 | Paper |
scientific article; zbMATH DE number 5604112 (Why is no real title available?)
| 2009-09-15 | Paper |
A note on the oriented chromatic number of grids
Information Processing Letters | 2009-08-27 | Paper |
Complexity of weak acceptance conditions in tree automata.
Information Processing Letters | 2003-01-21 | Paper |
Algorithms counting monotone Boolean functions
Information Processing Letters | 2002-07-14 | Paper |
On the expressive power of the shuffle operator matched with intersection by regular sets
RAIRO - Theoretical Informatics and Applications | 2002-06-03 | Paper |
Lower Space Bounds for Accepting Shuffle Languages
RAIRO - Theoretical Informatics and Applications | 2000-12-18 | Paper |
Shuffle languages are in P
Theoretical Computer Science | 2000-12-12 | Paper |
There is no complete axiom system for shuffle expressions
RAIRO - Theoretical Informatics and Applications | 2000-01-04 | Paper |
The element distinctness problem on one-tape Turing machines
Information Processing Letters | 1997-02-27 | Paper |
Turing machines with sublogarithmic space
Lecture Notes in Computer Science | 1994-12-01 | Paper |
Some remarks on two-dimensional finite automata
Information Sciences | 1992-09-27 | Paper |
Two-dimensional on-line tessellation acceptors are not closed under complement
Information Sciences | 1992-09-27 | Paper |
On space functions constructed by two-dimensional Turing machines
Information Sciences | 1992-06-28 | Paper |
scientific article; zbMATH DE number 8798 (Why is no real title available?)
| 1992-06-25 | Paper |
On three-way two-dimensional multicounter automata
Information Sciences | 1991-01-01 | Paper |
If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n
Theoretical Computer Science | 1990-01-01 | Paper |
On three-way two-dimensional Turing machines
Information Sciences | 1989-01-01 | Paper |
Some notes on strong and weak log log n space complexity
Information Processing Letters | 1989-01-01 | Paper |
Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space
Information Processing Letters | 1989-01-01 | Paper |
Remarks on languages acceptable in log log n space
Information Processing Letters | 1988-01-01 | Paper |
There are no fully space constructible functions between log log n and log n
Information Processing Letters | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3932392 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3846876 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3810923 (Why is no real title available?)
| 1983-01-01 | Paper |
A finite 5-pebble-automaton can search every maze
Information Processing Letters | 1982-01-01 | Paper |
