| Publication | Date of Publication | Type |
|---|
A formal framework for stringology
Discrete Applied Mathematics | 2020-02-14 | Paper |
When is the condition of order preservation met?
European Journal of Operational Research | 2019-03-28 | Paper |
An improved upper bound and algorithm for clique covers
Journal of Discrete Algorithms | 2018-05-09 | Paper |
Constructing an indeterminate string from its associated graph
Theoretical Computer Science | 2018-02-16 | Paper |
| An Introduction to the Analysis of Algorithms | 2018-01-25 | Paper |
On normalization of inconsistency indicators in pairwise comparisons
International Journal of Approximate Reasoning | 2017-10-06 | Paper |
| An exact upper bound on the size of minimal clique covers | 2017-05-17 | Paper |
Complex ranking procedures
Fundamenta Informaticae | 2017-03-22 | Paper |
Important Facts and Observations about Pairwise Comparisons (the special issue edition)
Fundamenta Informaticae | 2017-03-22 | Paper |
Feasible proofs of Szpilrajn's theorem -- a proof-complexity framework for concurrent automata
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
String shuffle: circuits and graphs
Journal of Discrete Algorithms | 2015-03-24 | Paper |
Non-repetitive strings over alphabet lists
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Unshuffling a square is NP-hard
Journal of Computer and System Sciences | 2014-02-13 | Paper |
Circuit complexity of shuffle
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Feasible combinatorial matrix theory
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Proving properties of matrices over \({\mathbb{Z}_{2}}\)
Archive for Mathematical Logic | 2012-09-18 | Paper |
Unambiguous functions in logarithmic space
Fundamenta Informaticae | 2012-05-11 | Paper |
| An introduction to the analysis of algorithms. | 2012-05-02 | Paper |
On the complexity of computing winning strategies for finite poset games
Theory of Computing Systems | 2011-05-23 | Paper |
On the Ehrenfeucht-Mycielski sequence
Journal of Discrete Algorithms | 2009-12-10 | Paper |
| An Introduction to the Analysis of Algorithms | 2009-06-16 | Paper |
| A propositional proof system with quantification over permutations | 2007-10-17 | Paper |
The proof theoretic strength of the Steinitz exchange theorem
Discrete Applied Mathematics | 2007-01-09 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
LA, permutations, and the Hajós calculus
Theoretical Computer Science | 2006-01-09 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Weak theories of linear algebra
Archive for Mathematical Logic | 2005-03-02 | Paper |
Matrix identities and the pigeonhole principle
Archive for Mathematical Logic | 2004-12-16 | Paper |
The proof complexity of linear algebra
Annals of Pure and Applied Logic | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2015272 (Why is no real title available?) | 2003-12-09 | Paper |
Berkowitz's algorithm and clow sequences
ELA. The Electronic Journal of Linear Algebra | 2002-04-23 | Paper |
Berkowitz's algorithm and clow sequences
ELA. The Electronic Journal of Linear Algebra | 2002-04-23 | Paper |
Berkowitz's algorithm and clow sequences
ELA. The Electronic Journal of Linear Algebra | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1471980 (Why is no real title available?) | 2000-07-09 | Paper |
