- Michal Soltys, Szymon Jaroszewicz
, Piotr Rzepakowski:
Ensemble methods for uplift modeling. Data Min. Knowl. Discov. 29(6): 1531-1559 (2015) - Neerja Mhaskar, Michael Soltys
:
String shuffle: Circuits and graphs. J. Discrete Algorithms 31: 120-128 (2015) - Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble is PSPACE-Complete. J. Inf. Process. 23(3): 284-292 (2015) - Michael Soltys
:
A formal approach to ranking procedures. Int. J. Knowl. Based Intell. Eng. Syst. 19(4): 225-234 (2015) - Neerja Mhaskar, Michael Soltys:
A Formal Framework for Stringology. Stringology 2015: 90-103 - Neerja Mhaskar, Michael Soltys
:
Non-repetitive Strings over Alphabet Lists. WALCOM 2015: 270-281 - 2014
- Michal Tomko
, Stanislav Kmet
, Robert Soltys:
Vibrations of an aramid anchor cable subjected to turbulent wind. Adv. Eng. Softw. 72: 39-56 (2014) - Sam Buss, Michael Soltys
:
Unshuffling a square is NP-hard. J. Comput. Syst. Sci. 80(4): 766-776 (2014) - Michael Soltys
:
Fair Ranking in Competitive Bidding Procurement: A Case Analysis. KES 2014: 1138-1144 - 2013
- Michael Soltys
:
Circuit Complexity of Shuffle. IWOCA 2013: 402-411 - Ariel Germán Fernández, Michael Soltys
:
Feasible Combinatorial Matrix Theory. MFCS 2013: 777-788 - Ariel Germán Fernández, Michael Soltys:
Feasible combinatorial matrix theory. CoRR abs/1303.6453 (2013) - 2012
- Michael Soltys
:
Proving properties of matrices over Z2. Arch. Math. Log. 51(5-6): 535-551 (2012) - Grzegorz Herman
, Michael Soltys
:
Unambiguous Functions in Logarithmic Space. Fundam. Informaticae 114(2): 129-147 (2012) - Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble Is PSPACE-Complete. FUN 2012: 258-269 - Sam Buss, Michael Soltys:
Unshuffling a Square is NP-Hard. CoRR abs/1211.7161 (2012) - Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble is PSPACE-Complete. CoRR abs/1201.5298 (2012) - 2011
- Michael Soltys:
Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata. J. Autom. Lang. Comb. 16(1): 37-48 (2011) - Michael Soltys
, Craig Wilson:
On the Complexity of Computing Winning Strategies for Finite Poset Games. Theory Comput. Syst. 48(3): 680-692 (2011) - 2009
- Grzegorz Herman
, Michael Soltys
:
On the Ehrenfeucht-Mycielski sequence. J. Discrete Algorithms 7(4): 500-508 (2009) - 2008
- David Bremner, Antoine Deza, Michael Soltys
:
Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. J. Comb. Optim. 16(4): 323 (2008) - Grzegorz Herman, Michael Soltys:
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem. CoRR abs/0811.3959 (2008) - 2007
- Michael Soltys
:
The proof theoretic strength of the Steinitz exchange theorem. Discret. Appl. Math. 155(1): 53-60 (2007) - Grzegorz Herman, Tim Paterson, Michael Soltys:
A Propositional Proof System with Quantification Over Permutations. Fundam. Informaticae 79(1-2): 71-83 (2007) - 2005
- Neil Thapen, Michael Soltys
:
Weak theories of linear algebra. Arch. Math. Log. 44(2): 195-208 (2005) - Michael Soltys
:
LA, permutations, and the Hajós Calculus. Theor. Comput. Sci. 348(2-3): 321-333 (2005) - Michael Soltys
:
Feasible Proofs of Matrix Properties with Csanky's Algorithm. CSL 2005: 493-508 - Michael Soltys:
Feasible Proofs of Matrix Properties with Csanky's Algorithm. CoRR abs/cs/0505087 (2005) - 2004
- Michael Soltys
, Alasdair Urquhart:
Matrix identities and the pigeonhole principle. Arch. Math. Log. 43(3): 351-358 (2004) - Michael Soltys
, Stephen A. Cook:
The proof complexity of linear algebra. Ann. Pure Appl. Log. 130(1-3): 277-323 (2004)