3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DC2022★ 3 cited
Analysis of Workflow Schedulers in Simulated Distributed Environments
Jakub Beránek, Stanislav Böhm, Vojtěch Cima
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…
cs.FL2019
Haydi: Rapid Prototyping and Combinatorial Objects
Stanislav Böhm, Jakub Beránek, Martin Šurkovský
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 ele…
cs.FL2013
Equivalence of Deterministic One-Counter Automata is NL-complete
Stanislav Böhm, Stefan Göller, Petr Jančar
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…