Michael Soltys

50 papers A* 2B 9C 2Misc 2Journal 33
YearRankTypeTitle / Venue / Authors
2026 — book
An Introduction to the Analysis of Algorithms, 4
An Introduction to the Analysis of Algorithms (4th Ed.)
Michael Soltys
2021 C conf
Cloudifying the Curriculum with AWS.
FIE
Michael Soltys
2021 J jnl
Minimum Path Star Topology Algorithms for Weighted Regions and Obstacles.
CoRR
Tyler King, Michael Soltys
2020 J jnl
A formal framework for Stringology.
Discret. Appl. Math.
Michael Soltys, Neerja Mhaskar
2020 J jnl
Cloudifying the Curriculum with AWS.
CoRR
Michael Soltys
2020 J jnl
Cybersecurity in the AWS Cloud.
CoRR
Michael Soltys
2020 B conf
Malware Persistence Mechanisms.
KES
Zane Gittins, Michael Soltys
2020 B conf
Voyager: Tracking with a Click.
KES
Samuel Decanio, Michael Soltys, Kimo Hildreth
2020 J jnl
WordPress on AWS: a Communication Framework.
CoRR
Michael Soltys, Katharine Soltys
2019 B conf
Approximating consistency in pairwise comparisons.
KES
Christopher Kuske, Michael Soltys, Konrad Kulakowski
2019 B conf
Deploying Health Campaign Strategies to Defend Against Social Engineering Threats.
KES
Noelle Abe, Michael Soltys
2019 B conf
SEAKER: A mobile digital forensics triage device.
KES
Eric Gentry, Michael Soltys
2019 J jnl
When is the condition of order preservation met?
Eur. J. Oper. Res.
Konrad Kulakowski, Jirí Mazurek, Jaroslav Ramík, Michael Soltys
2018 — book
An Introduction to the Analysis of Algorithms, 3
An Introduction to the Analysis of Algorithms (3rd Ed.)
Michael Soltys
2018 J jnl
An improved upper bound and algorithm for clique covers.
J. Discrete Algorithms
Ryan McIntyre, Michael Soltys
2018 J jnl
Constructing an indeterminate string from its associated graph.
Theor. Comput. Sci.
Joel Helling, Patrick J. Ryan, W. F. Smyth, Michael Soltys
2018 J jnl
When condition of order preservation is met?
CoRR
Konrad Kulakowski, Jirí Mazurek, Jaroslav Ramík, Michael Soltys
2017 J jnl
An exact upper bound on the size of minimal clique covers.
CoRR
Ryan McIntyre, Michael Soltys
2017 J jnl
On normalization of inconsistency indicators in pairwise comparisons.
CoRR
Waldemar W. Koczkodaj, Jean-Pierre Magnot, Jirí Mazurek, James F. Peters, Hojjat Rakhshani, Michael Soltys, Dominik Strzalka, Jacek Szybowski, Arturo Tozzi
2017 J jnl
On normalization of inconsistency indicators in pairwise comparisons.
Int. J. Approx. Reason.
Waldemar W. Koczkodaj, Jean-Pierre Magnot, Jirí Mazurek, James F. Peters, Hojjat Rakhshani, Michael Soltys, Dominik Strzalka, Jacek Szybowski, Arturo Tozzi
2016 J jnl
Complex Ranking Procedures.
Fundam. Informaticae
Barbara Sandrasagra, Michael Soltys
2016 Misc conf
Forced Repetitions over Alphabet Lists.
PSC
Neerja Mhaskar, Michael Soltys
2016 J jnl
Important Facts and Observations about Pairwise Comparisons (the special issue edition).
Fundam. Informaticae
Waldemar W. Koczkodaj, Ludmil Mikhailov, Grzegorz Redlarski, Michael Soltys, Jacek Szybowski, Gaik Tamazian, Eliza Wajch, Kevin Kam Fung Yuen
2015 Misc conf
A Formal Framework for Stringology.
PSC
Neerja Mhaskar, Michael Soltys
2015 J jnl
A formal approach to ranking procedures.
Int. J. Knowl. Based Intell. Eng. Syst.
Michael Soltys
2015 B conf
Non-repetitive Strings over Alphabet Lists.
WALCOM
Neerja Mhaskar, Michael Soltys
2015 J jnl
String shuffle: Circuits and graphs.
J. Discrete Algorithms
Neerja Mhaskar, Michael Soltys
2014 B conf
Fair Ranking in Competitive Bidding Procurement: A Case Analysis.
KES
Michael Soltys
2014 J jnl
Unshuffling a square is NP-hard.
J. Comput. Syst. Sci.
Sam Buss, Michael Soltys
2013 C conf
Circuit Complexity of Shuffle.
IWOCA
Michael Soltys
2013 B conf
Feasible Combinatorial Matrix Theory.
MFCS
Ariel Germán Fernández, Michael Soltys
2013 J jnl
Feasible combinatorial matrix theory
CoRR
Ariel Germán Fernández, Michael Soltys
2012 J jnl
Proving properties of matrices over Z
Arch. Math. Log.
Michael Soltys
2012 J jnl
Unambiguous Functions in Logarithmic Space.
Fundam. Informaticae
Grzegorz Herman, Michael Soltys
2012 J jnl
Unshuffling a Square is NP-Hard.
CoRR
Sam Buss, Michael Soltys
2011 J jnl
Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata.
J. Autom. Lang. Comb.
Michael Soltys
2011 J jnl
On the Complexity of Computing Winning Strategies for Finite Poset Games.
Theory Comput. Syst.
Michael Soltys, Craig Wilson
2009 J jnl
On the Ehrenfeucht-Mycielski sequence.
J. Discrete Algorithms
Grzegorz Herman, Michael Soltys
2008 J jnl
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
CoRR
Grzegorz Herman, Michael Soltys
2008 J jnl
Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms.
J. Comb. Optim.
David Bremner, Antoine Deza, Michael Soltys
2007 J jnl
A Propositional Proof System with Quantification Over Permutations.
Fundam. Informaticae
Grzegorz Herman, Tim Paterson, Michael Soltys
2007 J jnl
The proof theoretic strength of the Steinitz exchange theorem.
Discret. Appl. Math.
Michael Soltys
2005 J jnl
Feasible Proofs of Matrix Properties with Csanky's Algorithm
CoRR
Michael Soltys
2005 B conf
Feasible Proofs of Matrix Properties with Csanky's Algorithm.
CSL
Michael Soltys
2005 J jnl
LA, permutations, and the Hajós Calculus.
Theor. Comput. Sci.
Michael Soltys
2005 J jnl
Weak theories of linear algebra.
Arch. Math. Log.
Neil Thapen, Michael Soltys
2004 A* conf
LA, Permutations, and the Hajós Calculus.
ICALP
Michael Soltys
2004 J jnl
Matrix identities and the pigeonhole principle.
Arch. Math. Log.
Michael Soltys, Alasdair Urquhart
2004 J jnl
The proof complexity of linear algebra.
Ann. Pure Appl. Log.
Michael Soltys, Stephen A. Cook
2002 A* conf
The Proof Complexity of Linear Algebra.
LICS
Michael Soltys, Stephen A. Cook