Matrix identities and the pigeonhole principle. - Michael Soltys; Alasdair Urquhart (Arch. Math. Log., 2004)

The proof complexity of linear algebra. - Michael Soltys; Stephen A. Cook (Ann. Pure Appl. Log., 2004)

Feasible Proofs of Matrix Properties with Csanky's Algorithm. - Michael Soltys (CSL, 2005)

Weak theories of linear algebra. - Neil Thapen; Michael Soltys (Arch. Math. Log., 2005)

LA, permutations, and the Hajós Calculus. - Michael Soltys (Theor. Comput. Sci., 2005)

The proof theoretic strength of the Steinitz exchange theorem. - Michael Soltys (Discret. Appl. Math., 2007)

A Propositional Proof System with Quantification Over Permutations. - Grzegorz Herman; Tim Paterson; Michael Soltys (Fundam. Informaticae, 2007)

A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem - Grzegorz Herman; Michael Soltys (CoRR, 2008)

Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. - David Bremner; Antoine Deza; Michael Soltys (J. Comb. Optim., 2008)

On the Ehrenfeucht-Mycielski sequence. - Grzegorz Herman; Michael Soltys (J. Discrete Algorithms, 2009)

Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata. - Michael Soltys (J. Autom. Lang. Comb., 2011)

On the Complexity of Computing Winning Strategies for Finite Poset Games. - Michael Soltys; Craig Wilson (Theory Comput. Syst., 2011)

Proving properties of matrices over Z2. - Michael Soltys (Arch. Math. Log., 2012)

Unambiguous Functions in Logarithmic Space. - Grzegorz Herman; Michael Soltys (Fundam. Informaticae, 2012)

Circuit Complexity of Shuffle. - Michael Soltys (IWOCA, 2013)

Feasible Combinatorial Matrix Theory. - Ariel Germán Fernández; Michael Soltys (MFCS, 2013)

Fair Ranking in Competitive Bidding Procurement: A Case Analysis. - Michael Soltys (KES, 2014)

Unshuffling a square is NP-hard. - Sam Buss; Michael Soltys (J. Comput. Syst. Sci., 2014)

Non-repetitive Strings over Alphabet Lists. - Neerja Mhaskar; Michael Soltys (WALCOM, 2015)

String shuffle: Circuits and graphs. - Neerja Mhaskar; Michael Soltys (J. Discrete Algorithms, 2015)

A formal approach to ranking procedures. - Michael Soltys (Int. J. Knowl. Based Intell. Eng. Syst., 2015)

Forced Repetitions over Alphabet Lists. - Neerja Mhaskar; Michael Soltys (Stringology, 2016)

Important Facts and Observations about Pairwise Comparisons (the special issue edition). - Waldemar W. Koczkodaj; Ludmil Mikhailov; Grzegorz Redlarski; Michael Soltys; Jacek Szybowski; Gaik Tamazian; Eliza Wajch; Kevin Kam Fung Yuen (Fundam. Informaticae, 2016)

Complex Ranking Procedures. - Barbara Sandrasagra; Michael Soltys (Fundam. Informaticae, 2016)

An exact upper bound on the size of minimal clique covers. - Ryan McIntyre; Michael Soltys (CoRR, 2017)

On normalization of inconsistency indicators in pairwise comparisons. - Waldemar W. Koczkodaj; Jean-Pierre Magnot; Jirí Mazurek; James F. Peters; Hojjat Rakhshani; Michael Soltys; Dominik Strzalka; Jacek Szybowski; Arturo Tozzi (Int. J. Approx. Reason., 2017)

An Introduction to the Analysis of Algorithms - Michael Soltys (WorldScientific, 2018)

When condition of order preservation is met? - Konrad Kulakowski; Jirí Mazurek; Jaroslav Ramík; Michael Soltys (CoRR, 2018)

An improved upper bound and algorithm for clique covers. - Ryan McIntyre; Michael Soltys (J. Discrete Algorithms, 2018)

Constructing an indeterminate string from its associated graph. - Joel Helling; Patrick J. Ryan; W. F. Smyth; Michael Soltys (Theor. Comput. Sci., 2018)

Deploying Health Campaign Strategies to Defend Against Social Engineering Threats. - Noelle Abe; Michael Soltys (KES, 2019)

SEAKER: A mobile digital forensics triage device. - Eric Gentry; Michael Soltys (KES, 2019)

Approximating consistency in pairwise comparisons. - Christopher Kuske; Michael Soltys; Konrad Kulakowski (KES, 2019)

When is the condition of order preservation met? - Konrad Kulakowski; Jirí Mazurek; Jaroslav Ramík; Michael Soltys (Eur. J. Oper. Res., 2019)

Voyager: Tracking with a Click. - Samuel Decanio; Michael Soltys; Kimo Hildreth (KES, 2020)

Malware Persistence Mechanisms. - Zane Gittins; Michael Soltys (KES, 2020)

Cybersecurity in the AWS Cloud. - Michael Soltys (CoRR, 2020)

WordPress on AWS: a Communication Framework. - Michael Soltys; Katharine Soltys (CoRR, 2020)

A formal framework for Stringology. - Michael Soltys; Neerja Mhaskar (Discret. Appl. Math., 2020)

Cloudifying the Curriculum with AWS. - Michael Soltys (FIE, 2021)

Minimum Path Star Topology Algorithms for Weighted Regions and Obstacles. - Tyler King; Michael Soltys (CoRR, 2021)