Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Michael Soltys"
download as .bib file
@article{DBLP:journals/jib/BudisKKHGSLSBBDGSTRS24,
author = {Jaroslav Budis and
Werner Krampl and
Marcel Kuchar{\'{\i}}k and
Rastislav Hekel and
Adri{\'{a}}n Goga and
Jozef Sitarc{\'{\i}}k and
Michal Lichv{\'{a}}r and
David Smolak and
Miroslav B{\"{o}}hmer and
Andrej Bal{\'{a}}z and
Frantisek Duris and
Juraj Gazdarica and
Katarina Soltys and
J{\'{a}}n Turna and
J{\'{a}}n Radv{\'{a}}nszky and
Tom{\'{a}}s Szemes},
title = {SnakeLines: integrated set of computational pipelines for sequencing
reads},
journal = {J. Integr. Bioinform.},
volume = {20},
number = {3},
year = {2024},
url = {https://doi.org/10.1515/jib-2022-0059},
doi = {10.1515/JIB-2022-0059},
timestamp = {Sat, 23 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jib/BudisKKHGSLSBBDGSTRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cmpb/RombergSJKWGSTH22,
author = {Daniel Romberg and
Klaus Strohmenger and
Christoph Jansen and
Tobias K{\"{u}}ster and
Nick Weiss and
Christian Gei{\ss}ler and
Tomasz Soltysinski and
Michael Takla and
Peter Hufnagl and
Norman Zerbe and
Andr{\'{e}} Homeyer},
title = {{EMPAIA} App Interface: An open and vendor-neutral interface for {AI}
applications in pathology},
journal = {Comput. Methods Programs Biomed.},
volume = {215},
pages = {106596},
year = {2022},
url = {https://doi.org/10.1016/j.cmpb.2021.106596},
doi = {10.1016/J.CMPB.2021.106596},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cmpb/RombergSJKWGSTH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-14226,
author = {Andr{\'{e}} Homeyer and
Christian Gei{\ss}ler and
Lars Ole Schwen and
Falk Zakrzewski and
Theodore Evans and
Klaus Strohmenger and
Max Westphal and
Roman David B{\"{u}}low and
Michaela Kargl and
Aray Karjauv and
Isidre Munn{\'{e}}{-}Bertran and
Carl Orge Retzlaff and
Adri{\`{a}} Romero{-}L{\'{o}}pez and
Tomasz Soltysinski and
Markus Plass and
Rita Carvalho and
Peter Steinbach and
Yu{-}Chia Lan and
Nassim Bouteldja and
David Haber and
Mateo Rojas{-}Carulla and
Alireza Vafaei Sadr and
Matthias Kraft and
Daniel Kr{\"{u}}ger and
Rutger Fick and
Tobias Lang and
Peter Boor and
Heimo M{\"{u}}ller and
Peter Hufnagl and
Norman Zerbe},
title = {Recommendations on test datasets for evaluating {AI} solutions in
pathology},
journal = {CoRR},
volume = {abs/2204.14226},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.14226},
doi = {10.48550/ARXIV.2204.14226},
eprinttype = {arXiv},
eprint = {2204.14226},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-14226.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jamia/GensheimerABCHW21,
author = {Michael Francis Gensheimer and
Sonya Aggarwal and
Kathryn R. K. Benson and
Justin N. Carter and
Solomon Henry and
Douglas J. Wood and
Scott G. Soltys and
Steven Hancock and
Erqi Pollom and
Nigam H. Shah and
Daniel T. Chang},
title = {Automated model versus treating physician for predicting survival
time of patients with metastatic cancer},
journal = {J. Am. Medical Informatics Assoc.},
volume = {28},
number = {6},
pages = {1108--1116},
year = {2021},
url = {https://doi.org/10.1093/jamia/ocaa290},
doi = {10.1093/JAMIA/OCAA290},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jamia/GensheimerABCHW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fie/Soltys21,
author = {Michael Soltys},
title = {Cloudifying the Curriculum with {AWS}},
booktitle = {{IEEE} Frontiers in Education Conference, {FIE} 2021, Lincoln, NE,
USA, October 13-16, 2021},
pages = {1--7},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FIE49875.2021.9637242},
doi = {10.1109/FIE49875.2021.9637242},
timestamp = {Wed, 29 Dec 2021 09:45:46 +0100},
biburl = {https://dblp.org/rec/conf/fie/Soltys21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-13649,
author = {Jaroslav Budis and
Werner Krampl and
Marcel Kuchar{\'{\i}}k and
Rastislav Hekel and
Adrian Goga and
Michal Lichv{\'{a}}r and
David Smolak and
Miroslav B{\"{o}}hmer and
Andrej Bal{\'{a}}z and
Frantisek Duris and
Juraj Gazdarica and
Katarina Soltys and
J{\'{a}}n Turna and
J{\'{a}}n Radv{\'{a}}nszky and
Tom{\'{a}}s Szemes},
title = {SnakeLines: integrated set of computational pipelines for sequencing
reads},
journal = {CoRR},
volume = {abs/2106.13649},
year = {2021},
url = {https://arxiv.org/abs/2106.13649},
eprinttype = {arXiv},
eprint = {2106.13649},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-13649.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-06944,
author = {Tyler King and
Michael Soltys},
title = {Minimum Path Star Topology Algorithms for Weighted Regions and Obstacles},
journal = {CoRR},
volume = {abs/2109.06944},
year = {2021},
url = {https://arxiv.org/abs/2109.06944},
eprinttype = {arXiv},
eprint = {2109.06944},
timestamp = {Wed, 22 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-06944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SoltysM20,
author = {Michael Soltys and
Neerja Mhaskar},
title = {A formal framework for Stringology},
journal = {Discret. Appl. Math.},
volume = {274},
pages = {141--151},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2018.03.010},
doi = {10.1016/J.DAM.2018.03.010},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SoltysM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/DecanioSH20,
author = {Samuel Decanio and
Michael Soltys and
Kimo Hildreth},
editor = {Matteo Cristani and
Carlos Toro and
Cecilia Zanni{-}Merk and
Robert J. Howlett and
Lakhmi C. Jain},
title = {Voyager: Tracking with a Click},
booktitle = {Knowledge-Based and Intelligent Information {\&} Engineering Systems:
Proceedings of the 24th International Conference KES-2020, Virtual
Event, 16-18 September 2020},
series = {Procedia Computer Science},
volume = {176},
pages = {98--107},
publisher = {Elsevier},
year = {2020},
url = {https://doi.org/10.1016/j.procs.2020.08.011},
doi = {10.1016/J.PROCS.2020.08.011},
timestamp = {Thu, 08 Jul 2021 16:04:01 +0200},
biburl = {https://dblp.org/rec/conf/kes/DecanioSH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/GittinsS20,
author = {Zane Gittins and
Michael Soltys},
editor = {Matteo Cristani and
Carlos Toro and
Cecilia Zanni{-}Merk and
Robert J. Howlett and
Lakhmi C. Jain},
title = {Malware Persistence Mechanisms},
booktitle = {Knowledge-Based and Intelligent Information {\&} Engineering Systems:
Proceedings of the 24th International Conference KES-2020, Virtual
Event, 16-18 September 2020},
series = {Procedia Computer Science},
volume = {176},
pages = {88--97},
publisher = {Elsevier},
year = {2020},
url = {https://doi.org/10.1016/j.procs.2020.08.010},
doi = {10.1016/J.PROCS.2020.08.010},
timestamp = {Thu, 05 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kes/GittinsS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-04020,
author = {Michael Soltys},
title = {Cloudifying the Curriculum with {AWS}},
journal = {CoRR},
volume = {abs/2002.04020},
year = {2020},
url = {https://arxiv.org/abs/2002.04020},
eprinttype = {arXiv},
eprint = {2002.04020},
timestamp = {Wed, 12 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-04020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-12905,
author = {Michael Soltys},
title = {Cybersecurity in the {AWS} Cloud},
journal = {CoRR},
volume = {abs/2003.12905},
year = {2020},
url = {https://arxiv.org/abs/2003.12905},
eprinttype = {arXiv},
eprint = {2003.12905},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-12905.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-01823,
author = {Michael Soltys and
Katharine Soltys},
title = {WordPress on {AWS:} a Communication Framework},
journal = {CoRR},
volume = {abs/2007.01823},
year = {2020},
url = {https://arxiv.org/abs/2007.01823},
eprinttype = {arXiv},
eprint = {2007.01823},
timestamp = {Mon, 06 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-01823.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aes/VernarskyTSK19,
author = {Peter Vernarsky and
Michal Tomko and
Robert Soltys and
Stanislav Kmet},
title = {Numerical simulations of wind circumfluence around a Tensairity cylindrical
beam and predictions of its response},
journal = {Adv. Eng. Softw.},
volume = {129},
pages = {13--34},
year = {2019},
url = {https://doi.org/10.1016/j.advengsoft.2018.12.005},
doi = {10.1016/J.ADVENGSOFT.2018.12.005},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aes/VernarskyTSK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KulakowskiMRS19,
author = {Konrad Kulakowski and
Jir{\'{\i}} Mazurek and
Jaroslav Ram{\'{\i}}k and
Michael Soltys},
title = {When is the condition of order preservation met?},
journal = {Eur. J. Oper. Res.},
volume = {277},
number = {1},
pages = {248--254},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2019.01.046},
doi = {10.1016/J.EJOR.2019.01.046},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/KulakowskiMRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/AbeS19,
author = {Noelle Abe and
Michael Soltys},
editor = {Imre J. Rudas and
J{\'{a}}nos Csirik and
Carlos Toro and
J{\'{a}}nos Botzheim and
Robert J. Howlett and
Lakhmi C. Jain},
title = {Deploying Health Campaign Strategies to Defend Against Social Engineering
Threats},
booktitle = {Knowledge-Based and Intelligent Information {\&} Engineering Systems:
Proceedings of the 23rd International Conference KES-2019, Budapest,
Hungary, 4-6 September 2019},
series = {Procedia Computer Science},
volume = {159},
pages = {824--831},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.procs.2019.09.241},
doi = {10.1016/J.PROCS.2019.09.241},
timestamp = {Thu, 08 Jul 2021 16:04:01 +0200},
biburl = {https://dblp.org/rec/conf/kes/AbeS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/GentryS19,
author = {Eric Gentry and
Michael Soltys},
editor = {Imre J. Rudas and
J{\'{a}}nos Csirik and
Carlos Toro and
J{\'{a}}nos Botzheim and
Robert J. Howlett and
Lakhmi C. Jain},
title = {{SEAKER:} {A} mobile digital forensics triage device},
booktitle = {Knowledge-Based and Intelligent Information {\&} Engineering Systems:
Proceedings of the 23rd International Conference KES-2019, Budapest,
Hungary, 4-6 September 2019},
series = {Procedia Computer Science},
volume = {159},
pages = {1652--1661},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.procs.2019.09.335},
doi = {10.1016/J.PROCS.2019.09.335},
timestamp = {Tue, 05 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kes/GentryS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/KuskeSK19,
author = {Christopher Kuske and
Michael Soltys and
Konrad Kulakowski},
editor = {Imre J. Rudas and
J{\'{a}}nos Csirik and
Carlos Toro and
J{\'{a}}nos Botzheim and
Robert J. Howlett and
Lakhmi C. Jain},
title = {Approximating consistency in pairwise comparisons},
booktitle = {Knowledge-Based and Intelligent Information {\&} Engineering Systems:
Proceedings of the 23rd International Conference KES-2019, Budapest,
Hungary, 4-6 September 2019},
series = {Procedia Computer Science},
volume = {159},
pages = {814--823},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.procs.2019.09.240},
doi = {10.1016/J.PROCS.2019.09.240},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kes/KuskeSK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/ws/Soltys18,
author = {Michael Soltys},
title = {An Introduction to the Analysis of Algorithms},
publisher = {WorldScientific},
year = {2018},
url = {https://doi.org/10.1142/10875},
doi = {10.1142/10875},
isbn = {9789813235908},
timestamp = {Mon, 22 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/ws/Soltys18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/McIntyreS18,
author = {Ryan McIntyre and
Michael Soltys},
title = {An improved upper bound and algorithm for clique covers},
journal = {J. Discrete Algorithms},
volume = {48},
pages = {42--56},
year = {2018},
url = {https://doi.org/10.1016/j.jda.2018.03.002},
doi = {10.1016/J.JDA.2018.03.002},
timestamp = {Sat, 01 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/McIntyreS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HellingRSS18,
author = {Joel Helling and
Patrick J. Ryan and
W. F. Smyth and
Michael Soltys},
title = {Constructing an indeterminate string from its associated graph},
journal = {Theor. Comput. Sci.},
volume = {710},
pages = {88--96},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.02.016},
doi = {10.1016/J.TCS.2017.02.016},
timestamp = {Mon, 16 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HellingRSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-02397,
author = {Konrad Kulakowski and
Jir{\'{\i}} Mazurek and
Jaroslav Ram{\'{\i}}k and
Michael Soltys},
title = {When condition of order preservation is met?},
journal = {CoRR},
volume = {abs/1802.02397},
year = {2018},
url = {http://arxiv.org/abs/1802.02397},
eprinttype = {arXiv},
eprint = {1802.02397},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-02397.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07909,
author = {Michal Soltys and
Szymon Jaroszewicz},
title = {Boosting algorithms for uplift modeling},
journal = {CoRR},
volume = {abs/1807.07909},
year = {2018},
url = {http://arxiv.org/abs/1807.07909},
eprinttype = {arXiv},
eprint = {1807.07909},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07909.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijar/KoczkodajMMPRSS17,
author = {Waldemar W. Koczkodaj and
Jean{-}Pierre Magnot and
Jir{\'{\i}} Mazurek and
James F. Peters and
Hojjat Rakhshani and
Michael Soltys and
Dominik Strzalka and
Jacek Szybowski and
Arturo Tozzi},
title = {On normalization of inconsistency indicators in pairwise comparisons},
journal = {Int. J. Approx. Reason.},
volume = {86},
pages = {73--79},
year = {2017},
url = {https://doi.org/10.1016/j.ijar.2017.04.005},
doi = {10.1016/J.IJAR.2017.04.005},
timestamp = {Thu, 18 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijar/KoczkodajMMPRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KoczkodajMMPRSS17,
author = {Waldemar W. Koczkodaj and
Jean{-}Pierre Magnot and
Jir{\'{\i}} Mazurek and
James F. Peters and
Hojjat Rakhshani and
Michael Soltys and
Dominik Strzalka and
Jacek Szybowski and
Arturo Tozzi},
title = {On normalization of inconsistency indicators in pairwise comparisons},
journal = {CoRR},
volume = {abs/1702.07205},
year = {2017},
url = {http://arxiv.org/abs/1702.07205},
eprinttype = {arXiv},
eprint = {1702.07205},
timestamp = {Thu, 18 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/KoczkodajMMPRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/McIntyreS17,
author = {Ryan McIntyre and
Michael Soltys},
title = {An exact upper bound on the size of minimal clique covers},
journal = {CoRR},
volume = {abs/1705.06326},
year = {2017},
url = {http://arxiv.org/abs/1705.06326},
eprinttype = {arXiv},
eprint = {1705.06326},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/McIntyreS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/KoczkodajMRSSTW16,
author = {Waldemar W. Koczkodaj and
Ludmil Mikhailov and
Grzegorz Redlarski and
Michael Soltys and
Jacek Szybowski and
Gaik Tamazian and
Eliza Wajch and
Kevin Kam Fung Yuen},
title = {Important Facts and Observations about Pairwise Comparisons (the special
issue edition)},
journal = {Fundam. Informaticae},
volume = {144},
number = {3-4},
pages = {291--307},
year = {2016},
url = {https://doi.org/10.3233/FI-2016-1336},
doi = {10.3233/FI-2016-1336},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/KoczkodajMRSSTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/SandrasagraS16,
author = {Barbara Sandrasagra and
Michael Soltys},
title = {Complex Ranking Procedures},
journal = {Fundam. Informaticae},
volume = {144},
number = {3-4},
pages = {223--240},
year = {2016},
url = {https://doi.org/10.3233/FI-2016-1331},
doi = {10.3233/FI-2016-1331},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/SandrasagraS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/MhaskarS16,
author = {Neerja Mhaskar and
Michael Soltys},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {Forced Repetitions over Alphabet Lists},
booktitle = {Proceedings of the Prague Stringology Conference 2016, Prague, Czech
Republic, August 29-31, 2016},
pages = {125--134},
publisher = {Department of Theoretical Computer Science, Faculty of Information
Technology, Czech Technical University in Prague},
year = {2016},
url = {http://www.stringology.org/event/2016/p11.html},
timestamp = {Wed, 10 Feb 2021 08:42:25 +0100},
biburl = {https://dblp.org/rec/conf/stringology/MhaskarS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/SoltysTK15,
author = {Robert Soltys and
Michal Tomko and
Stanislav Kmet},
title = {Analysis of wind-induced vibrations of an anchor cable using a simplified
fluid-structure interaction method},
journal = {Appl. Math. Comput.},
volume = {267},
pages = {223--236},
year = {2015},
url = {https://doi.org/10.1016/j.amc.2015.03.114},
doi = {10.1016/J.AMC.2015.03.114},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amc/SoltysTK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/datamine/SoltysJR15,
author = {Michal Soltys and
Szymon Jaroszewicz and
Piotr Rzepakowski},
title = {Ensemble methods for uplift modeling},
journal = {Data Min. Knowl. Discov.},
volume = {29},
number = {6},
pages = {1531--1559},
year = {2015},
url = {https://doi.org/10.1007/s10618-014-0383-9},
doi = {10.1007/S10618-014-0383-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/datamine/SoltysJR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MhaskarS15,
author = {Neerja Mhaskar and
Michael Soltys},
title = {String shuffle: Circuits and graphs},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {120--128},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.003},
doi = {10.1016/J.JDA.2015.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MhaskarS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/LampisMS15,
author = {Michael Lampis and
Valia Mitsou and
Karolina Soltys},
title = {Scrabble is PSPACE-Complete},
journal = {J. Inf. Process.},
volume = {23},
number = {3},
pages = {284--292},
year = {2015},
url = {https://doi.org/10.2197/ipsjjip.23.284},
doi = {10.2197/IPSJJIP.23.284},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/LampisMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/kes/Soltys16,
author = {Michael Soltys},
title = {A formal approach to ranking procedures},
journal = {Int. J. Knowl. Based Intell. Eng. Syst.},
volume = {19},
number = {4},
pages = {225--234},
year = {2015},
url = {https://doi.org/10.3233/KES-150324},
doi = {10.3233/KES-150324},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/kes/Soltys16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stringology/MhaskarS15,
author = {Neerja Mhaskar and
Michael Soltys},
editor = {Jan Holub and
Jan Zd{\'{a}}rek},
title = {A Formal Framework for Stringology},
booktitle = {Proceedings of the Prague Stringology Conference 2015, Prague, Czech
Republic, August 24-26, 2015},
pages = {90--103},
publisher = {Department of Theoretical Computer Science, Faculty of Information
Technology, Czech Technical University in Prague},
year = {2015},
url = {http://www.stringology.org/event/2015/p10.html},
timestamp = {Wed, 10 Feb 2021 08:42:20 +0100},
biburl = {https://dblp.org/rec/conf/stringology/MhaskarS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/MhaskarS15,
author = {Neerja Mhaskar and
Michael Soltys},
editor = {M. Sohel Rahman and
Etsuji Tomita},
title = {Non-repetitive Strings over Alphabet Lists},
booktitle = {{WALCOM:} Algorithms and Computation - 9th International Workshop,
{WALCOM} 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8973},
pages = {270--281},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15612-5\_24},
doi = {10.1007/978-3-319-15612-5\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/MhaskarS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aes/TomkoKS14,
author = {Michal Tomko and
Stanislav Kmet and
Robert Soltys},
title = {Vibrations of an aramid anchor cable subjected to turbulent wind},
journal = {Adv. Eng. Softw.},
volume = {72},
pages = {39--56},
year = {2014},
url = {https://doi.org/10.1016/j.advengsoft.2013.08.004},
doi = {10.1016/J.ADVENGSOFT.2013.08.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aes/TomkoKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BussS14,
author = {Sam Buss and
Michael Soltys},
title = {Unshuffling a square is NP-hard},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {4},
pages = {766--776},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2013.11.002},
doi = {10.1016/J.JCSS.2013.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BussS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/Soltys14,
author = {Michael Soltys},
editor = {Piotr Jedrzejowicz and
Lakhmi C. Jain and
Robert J. Howlett and
Ireneusz Czarnowski},
title = {Fair Ranking in Competitive Bidding Procurement: {A} Case Analysis},
booktitle = {18th International Conference in Knowledge Based and Intelligent Information
and Engineering Systems, {KES} 2014, Gdynia, Poland, 15-17 September
2014},
series = {Procedia Computer Science},
volume = {35},
pages = {1138--1144},
publisher = {Elsevier},
year = {2014},
url = {https://doi.org/10.1016/j.procs.2014.08.207},
doi = {10.1016/J.PROCS.2014.08.207},
timestamp = {Thu, 08 Jul 2021 16:04:01 +0200},
biburl = {https://dblp.org/rec/conf/kes/Soltys14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Soltys13,
author = {Michael Soltys},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {Circuit Complexity of Shuffle},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {402--411},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_34},
doi = {10.1007/978-3-642-45278-9\_34},
timestamp = {Wed, 25 Sep 2019 18:08:04 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Soltys13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FernandezS13,
author = {Ariel Germ{\'{a}}n Fern{\'{a}}ndez and
Michael Soltys},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Feasible Combinatorial Matrix Theory},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {777--788},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_68},
doi = {10.1007/978-3-642-40313-2\_68},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FernandezS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-6453,
author = {Ariel Germ{\'{a}}n Fern{\'{a}}ndez and
Michael Soltys},
title = {Feasible combinatorial matrix theory},
journal = {CoRR},
volume = {abs/1303.6453},
year = {2013},
url = {http://arxiv.org/abs/1303.6453},
eprinttype = {arXiv},
eprint = {1303.6453},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-6453.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Soltys12,
author = {Michael Soltys},
title = {Proving properties of matrices over Z\({}_{\mbox{2}}\)},
journal = {Arch. Math. Log.},
volume = {51},
number = {5-6},
pages = {535--551},
year = {2012},
url = {https://doi.org/10.1007/s00153-012-0280-0},
doi = {10.1007/S00153-012-0280-0},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Soltys12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/HermanS12,
author = {Grzegorz Herman and
Michael Soltys},
title = {Unambiguous Functions in Logarithmic Space},
journal = {Fundam. Informaticae},
volume = {114},
number = {2},
pages = {129--147},
year = {2012},
url = {https://doi.org/10.3233/FI-2012-621},
doi = {10.3233/FI-2012-621},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/HermanS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/LampisMS12,
author = {Michael Lampis and
Valia Mitsou and
Karolina Soltys},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Scrabble Is PSPACE-Complete},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {258--269},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_26},
doi = {10.1007/978-3-642-30347-0\_26},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/LampisMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BussS12,
author = {Sam Buss and
Michael Soltys},
title = {Unshuffling a Square is NP-Hard},
journal = {CoRR},
volume = {abs/1211.7161},
year = {2012},
url = {http://arxiv.org/abs/1211.7161},
eprinttype = {arXiv},
eprint = {1211.7161},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BussS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-5298,
author = {Michael Lampis and
Valia Mitsou and
Karolina Soltys},
title = {Scrabble is PSPACE-Complete},
journal = {CoRR},
volume = {abs/1201.5298},
year = {2012},
url = {http://arxiv.org/abs/1201.5298},
eprinttype = {arXiv},
eprint = {1201.5298},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-5298.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/Soltys11,
author = {Michael Soltys},
title = {Feasible Proofs of Szpilrajn's Theorem - {A} Proof-Complexity Framework
for Concurrent Automata},
journal = {J. Autom. Lang. Comb.},
volume = {16},
number = {1},
pages = {37--48},
year = {2011},
url = {https://doi.org/10.25596/jalc-2011-037},
doi = {10.25596/JALC-2011-037},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/Soltys11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SoltysW11,
author = {Michael Soltys and
Craig Wilson},
title = {On the Complexity of Computing Winning Strategies for Finite Poset
Games},
journal = {Theory Comput. Syst.},
volume = {48},
number = {3},
pages = {680--692},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9254-y},
doi = {10.1007/S00224-010-9254-Y},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/SoltysW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HermanS09,
author = {Grzegorz Herman and
Michael Soltys},
title = {On the Ehrenfeucht-Mycielski sequence},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {500--508},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2009.01.002},
doi = {10.1016/J.JDA.2009.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HermanS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BremnerDS08,
author = {David Bremner and
Antoine Deza and
Michael Soltys},
title = {Foreword: selected papers from the Franco-Canadian workshop on combinatorial
algorithms},
journal = {J. Comb. Optim.},
volume = {16},
number = {4},
pages = {323},
year = {2008},
url = {https://doi.org/10.1007/s10878-008-9155-z},
doi = {10.1007/S10878-008-9155-Z},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BremnerDS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-3959,
author = {Grzegorz Herman and
Michael Soltys},
title = {A polytime proof of correctness of the Rabin-Miller algorithm from
Fermat's little theorem},
journal = {CoRR},
volume = {abs/0811.3959},
year = {2008},
url = {http://arxiv.org/abs/0811.3959},
eprinttype = {arXiv},
eprint = {0811.3959},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-3959.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Soltys07,
author = {Michael Soltys},
title = {The proof theoretic strength of the Steinitz exchange theorem},
journal = {Discret. Appl. Math.},
volume = {155},
number = {1},
pages = {53--60},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.05.001},
doi = {10.1016/J.DAM.2006.05.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Soltys07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/HermanPS07,
author = {Grzegorz Herman and
Tim Paterson and
Michael Soltys},
title = {A Propositional Proof System with Quantification Over Permutations},
journal = {Fundam. Informaticae},
volume = {79},
number = {1-2},
pages = {71--83},
year = {2007},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi79-1-2-05},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/HermanPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/ThapenS05,
author = {Neil Thapen and
Michael Soltys},
title = {Weak theories of linear algebra},
journal = {Arch. Math. Log.},
volume = {44},
number = {2},
pages = {195--208},
year = {2005},
url = {https://doi.org/10.1007/s00153-004-0249-8},
doi = {10.1007/S00153-004-0249-8},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/ThapenS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Soltys05,
author = {Michael Soltys},
title = {LA, permutations, and the Haj{\'{o}}s Calculus},
journal = {Theor. Comput. Sci.},
volume = {348},
number = {2-3},
pages = {321--333},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.09.021},
doi = {10.1016/J.TCS.2005.09.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Soltys05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Soltys05,
author = {Michael Soltys},
editor = {C.{-}H. Luke Ong},
title = {Feasible Proofs of Matrix Properties with Csanky's Algorithm},
booktitle = {Computer Science Logic, 19th International Workshop, {CSL} 2005, 14th
Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3634},
pages = {493--508},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538363\_34},
doi = {10.1007/11538363\_34},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Soltys05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0505087,
author = {Michael Soltys},
title = {Feasible Proofs of Matrix Properties with Csanky's Algorithm},
journal = {CoRR},
volume = {abs/cs/0505087},
year = {2005},
url = {http://arxiv.org/abs/cs/0505087},
eprinttype = {arXiv},
eprint = {cs/0505087},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0505087.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/SoltysU04,
author = {Michael Soltys and
Alasdair Urquhart},
title = {Matrix identities and the pigeonhole principle},
journal = {Arch. Math. Log.},
volume = {43},
number = {3},
pages = {351--358},
year = {2004},
url = {https://doi.org/10.1007/s00153-003-0205-z},
doi = {10.1007/S00153-003-0205-Z},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/SoltysU04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/SoltysC04,
author = {Michael Soltys and
Stephen A. Cook},
title = {The proof complexity of linear algebra},
journal = {Ann. Pure Appl. Log.},
volume = {130},
number = {1-3},
pages = {277--323},
year = {2004},
url = {https://doi.org/10.1016/j.apal.2003.10.018},
doi = {10.1016/J.APAL.2003.10.018},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/SoltysC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Soltys04,
author = {Michael Soltys},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {LA, Permutations, and the Haj{\'{o}}s Calculus},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {1176--1187},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_97},
doi = {10.1007/978-3-540-27836-8\_97},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Soltys04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/SoltysC02,
author = {Michael Soltys and
Stephen A. Cook},
title = {The Proof Complexity of Linear Algebra},
booktitle = {17th {IEEE} Symposium on Logic in Computer Science {(LICS} 2002),
22-25 July 2002, Copenhagen, Denmark, Proceedings},
pages = {335--344},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/LICS.2002.1029841},
doi = {10.1109/LICS.2002.1029841},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/SoltysC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-08-26 06:30 CEST from data curated 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:
