Analysis of Workflow Schedulers in Simulated Distributed Environments

Autor: Beránek, Jakub, Böhm, Stanislav, Cima, Vojtěch

Task graphs provide a simple way to describe scientific workflows (sets of tasks with dependencies) that can be executed on both HPC clusters and in the cloud. An important aspect of executing such graphs is the used scheduling algorithm. Many schedu

Externí odkaz: http://arxiv.org/abs/2204.07211

Haydi: Rapid Prototyping and Combinatorial Objects

Autor: Böhm, Stanislav, Beránek, Jakub, Šurkovský, Martin

Publikováno v: Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018, Proceedings. Lecture Notes in Computer Science 10833, Springer 2018, ISBN 978-3-319-90049-0

Haydi (http://haydi.readthedocs.io) is a framework for generating discrete structures. It provides a way to define a structure from basic building blocks and then enumerate all elements, all non-isomorphic elements, or generate random elements in the

Externí odkaz: http://arxiv.org/abs/1909.12713

Interaction of the lithium cation with [2.2.2]paracyclophane: Experimental and theoretical study

Autor: Vaňura, Petr, Makrlík, Emanuel, Sýkora, David, Böhm, Stanislav

Publikováno v: In Journal of Molecular Structure 15 May 2021 1232

Equivalence of Deterministic One-Counter Automata is NL-complete

Autor: Böhm, Stanislav, Göller, Stefan, Jančar, Petr

We prove that language equivalence of deterministic one-counter automata is NL-complete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson in 1975. Our main contribution is to prove that two deterministic one

Externí odkaz: http://arxiv.org/abs/1301.2181

Cation-π interaction of the univalent sodium cation with [2.2.2]paracyclophane: Experimental and theoretical study

Autor: Makrlík, Emanuel, Sýkora, David, Böhm, Stanislav, Vaňura, Petr

Publikováno v: In Journal of Molecular Structure 15 February 2018 1154:79-82