Michael Soltys

Available identifiers

zbMath Open soltys.michaelDBLP99/1925WikidataQ57199505 ScholiaQ57199505MaRDI QIDQ453197

List of research outcomes

Publication	Date of Publication	Type
A formal framework for stringology	2020-02-14	Paper
When is the condition of order preservation met?	2019-03-28	Paper
An improved upper bound and algorithm for clique covers	2018-05-09	Paper
Constructing an indeterminate string from its associated graph	2018-02-16	Paper
An Introduction to the Analysis of Algorithms	2018-01-25	Paper
On normalization of inconsistency indicators in pairwise comparisons	2017-10-06	Paper
An exact upper bound on the size of minimal clique covers	2017-05-17	Paper
Complex Ranking Procedures	2017-03-22	Paper
Important Facts and Observations about Pairwise Comparisons (the special issue edition)	2017-03-22	Paper
Feasible proofs of Szpilrajn's theorem -- a proof-complexity framework for concurrent automata	2016-09-29	Paper
String shuffle: circuits and graphs	2015-03-24	Paper
Non-repetitive Strings over Alphabet Lists	2015-02-27	Paper
Unshuffling a square is NP-hard	2014-02-13	Paper
Circuit Complexity of Shuffle	2014-01-17	Paper
Feasible Combinatorial Matrix Theory	2013-09-20	Paper
Proving properties of matrices over \({\mathbb{Z}_{2}}\)	2012-09-18	Paper
Unambiguous functions in logarithmic space	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	2011-05-23	Paper
On the Ehrenfeucht-Mycielski sequence	2009-12-10	Paper
An Introduction to the Analysis of Algorithms	2009-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q5422267	2007-10-17	Paper
The proof theoretic strength of the Steinitz exchange theorem	2007-01-09	Paper
Computer Science Logic	2006-11-01	Paper
LA, permutations, and the Hajós calculus	2006-01-09	Paper
Automata, Languages and Programming	2005-08-24	Paper
Weak theories of linear algebra	2005-03-02	Paper
Matrix identities and the pigeonhole principle	2004-12-16	Paper
The proof complexity of linear algebra	2004-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q4438100	2003-12-09	Paper
Berkowitz's algorithm and clow sequences	2002-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4489064	2000-07-09	Paper

Research outcomes over time

This page was built for person: Michael Soltys