default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Soltys
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c15]Michael Soltys:
Cloudifying the Curriculum with AWS. FIE 2021: 1-7- [i11]Tyler King, Michael Soltys:
Minimum Path Star Topology Algorithms for Weighted Regions and Obstacles. CoRR abs/2109.06944 (2021) - 2020
- [j22]Michael Soltys
, Neerja Mhaskar:
A formal framework for Stringology. Discret. Appl. Math. 274: 141-151 (2020) - [c14]Zane Gittins, Michael Soltys:
Malware Persistence Mechanisms. KES 2020: 88-97 - [c13]Samuel Decanio, Michael Soltys, Kimo Hildreth:
Voyager: Tracking with a Click. KES 2020: 98-107 - [i10]Michael Soltys:
Cloudifying the Curriculum with AWS. CoRR abs/2002.04020 (2020) - [i9]Michael Soltys:
Cybersecurity in the AWS Cloud. CoRR abs/2003.12905 (2020) - [i8]Michael Soltys, Katharine Soltys:
WordPress on AWS: a Communication Framework. CoRR abs/2007.01823 (2020)
2010 – 2019
- 2019
- [j21]Konrad Kulakowski, Jirí Mazurek, Jaroslav Ramík, Michael Soltys:
When is the condition of order preservation met? Eur. J. Oper. Res. 277(1): 248-254 (2019) - [c12]Christopher Kuske, Michael Soltys, Konrad Kulakowski:
Approximating consistency in pairwise comparisons. KES 2019: 814-823 - [c11]Noelle Abe, Michael Soltys:
Deploying Health Campaign Strategies to Defend Against Social Engineering Threats. KES 2019: 824-831 - [c10]Eric Gentry, Michael Soltys:
SEAKER: A mobile digital forensics triage device. KES 2019: 1652-1661 - 2018
- [b1]Michael Soltys:
An Introduction to the Analysis of Algorithms. WorldScientific 2018, ISBN 9789813235908, pp. 1-328 - [j20]Ryan McIntyre, Michael Soltys:
An improved upper bound and algorithm for clique covers. J. Discrete Algorithms 48: 42-56 (2018) - [j19]Joel Helling, Patrick J. Ryan, W. F. Smyth, Michael Soltys:
Constructing an indeterminate string from its associated graph. Theor. Comput. Sci. 710: 88-96 (2018) - [i7]Konrad Kulakowski, Jirí Mazurek, Jaroslav Ramík, Michael Soltys:
When condition of order preservation is met? CoRR abs/1802.02397 (2018) - 2017
- [j18]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: 73-79 (2017) - [i6]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 abs/1702.07205 (2017) - [i5]Ryan McIntyre, Michael Soltys:
An exact upper bound on the size of minimal clique covers. CoRR abs/1705.06326 (2017) - 2016
- [j17]Barbara Sandrasagra, Michael Soltys:
Complex Ranking Procedures. Fundam. Informaticae 144(3-4): 223-240 (2016) - [j16]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): 291-307 (2016) - [c9]Neerja Mhaskar, Michael Soltys:
Forced Repetitions over Alphabet Lists. Stringology 2016: 125-134 - 2015
- [j15]Neerja Mhaskar, Michael Soltys:
String shuffle: Circuits and graphs. J. Discrete Algorithms 31: 120-128 (2015) - [j14]Michael Soltys:
A formal approach to ranking procedures. Int. J. Knowl. Based Intell. Eng. Syst. 19(4): 225-234 (2015) - [c8]Neerja Mhaskar, Michael Soltys:
A Formal Framework for Stringology. Stringology 2015: 90-103 - [c7]Neerja Mhaskar, Michael Soltys:
Non-repetitive Strings over Alphabet Lists. WALCOM 2015: 270-281 - 2014
- [j13]Sam Buss, Michael Soltys:
Unshuffling a square is NP-hard. J. Comput. Syst. Sci. 80(4): 766-776 (2014) - [c6]Michael Soltys:
Fair Ranking in Competitive Bidding Procurement: A Case Analysis. KES 2014: 1138-1144 - 2013
- [c5]Michael Soltys:
Circuit Complexity of Shuffle. IWOCA 2013: 402-411 - [c4]Ariel Germán Fernández, Michael Soltys:
Feasible Combinatorial Matrix Theory. MFCS 2013: 777-788 - [i4]Ariel Germán Fernández, Michael Soltys:
Feasible combinatorial matrix theory. CoRR abs/1303.6453 (2013) - 2012
- [j12]Michael Soltys:
Proving properties of matrices over Z2. Arch. Math. Log. 51(5-6): 535-551 (2012) - [j11]Grzegorz Herman, Michael Soltys:
Unambiguous Functions in Logarithmic Space. Fundam. Informaticae 114(2): 129-147 (2012) - [i3]Sam Buss, Michael Soltys:
Unshuffling a Square is NP-Hard. CoRR abs/1211.7161 (2012) - 2011
- [j10]Michael Soltys:
Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata. J. Autom. Lang. Comb. 16(1): 37-48 (2011) - [j9]Michael Soltys, Craig Wilson:
On the Complexity of Computing Winning Strategies for Finite Poset Games. Theory Comput. Syst. 48(3): 680-692 (2011)
2000 – 2009
- 2009
- [j8]Grzegorz Herman, Michael Soltys:
On the Ehrenfeucht-Mycielski sequence. J. Discrete Algorithms 7(4): 500-508 (2009) - 2008
- [j7]David Bremner, Antoine Deza, Michael Soltys:
Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. J. Comb. Optim. 16(4): 323 (2008) - [i2]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
- [j6]Michael Soltys:
The proof theoretic strength of the Steinitz exchange theorem. Discret. Appl. Math. 155(1): 53-60 (2007) - [j5]Grzegorz Herman, Tim Paterson, Michael Soltys:
A Propositional Proof System with Quantification Over Permutations. Fundam. Informaticae 79(1-2): 71-83 (2007) - 2005
- [j4]Neil Thapen, Michael Soltys:
Weak theories of linear algebra. Arch. Math. Log. 44(2): 195-208 (2005) - [j3]Michael Soltys:
LA, permutations, and the Hajós Calculus. Theor. Comput. Sci. 348(2-3): 321-333 (2005) - [c3]Michael Soltys:
Feasible Proofs of Matrix Properties with Csanky's Algorithm. CSL 2005: 493-508 - [i1]Michael Soltys:
Feasible Proofs of Matrix Properties with Csanky's Algorithm. CoRR abs/cs/0505087 (2005) - 2004
- [j2]Michael Soltys, Alasdair Urquhart:
Matrix identities and the pigeonhole principle. Arch. Math. Log. 43(3): 351-358 (2004) - [j1]Michael Soltys, Stephen A. Cook:
The proof complexity of linear algebra. Ann. Pure Appl. Log. 130(1-3): 277-323 (2004) - [c2]Michael Soltys:
LA, Permutations, and the Hajós Calculus. ICALP 2004: 1176-1187 - 2002
- [c1]Michael Soltys, Stephen A. Cook:
The Proof Complexity of Linear Algebra. LICS 2002: 335-344
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
