Michael Soltys

Publication Activity (10 Years)

Years Active: 2002-2021
Publications (10 Years): 21

Top Topics

Pairwise Comparison

Ordinal Regression

Computationally Challenging

Top Venues

Fundam. Informaticae

J. Discrete Algorithms

Publications

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