Skip to content

Stanislav Bhm

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

11

Venues

11

Active years

2010–2021

Best venue rank

A*

Where they publish

Papers

11 indexed papers, newest first.

YearVenueTitleAuthors
2021DATEEVEREST: A design environment for extreme-scale big data analytics on heterogeneous platforms.Christian Pilato, Stanislav Bhm, Fabien Brocheton, Jernimo Castrilln, Riccardo Cevasco, Vojtech Cima, Radim Cmar, Dionysios Diamantopoulos, Fabrizio Ferrandi, Jan Martinovic, Gianluca Palermo, Michele Paolino, Antonio Parodi, Lorenzo Pittaluga, Daniel Raho, Francesco Regazzoni, Katerina Slaninov, Christoph Hagleitner
2017CISISHyperLoom Possibilities for Executing Scientific Workflows on the Cloud.Vojtech Cima, Stanislav Bhm, Jan Martinovic, Jiri Dvorsk, Thomas J. Ashby, Vladimir I. Chupakhin
2017STACSOn Bchi One-Counter Automata.Stanislav Bhm, Stefan Gller, Simon Halfon, Piotr Hofman
2016FMState-Space Reduction of Non-deterministically Synchronizing Systems Applicable to Deadlock Detection in MPI.Stanislav Bhm, Ondrej Meca, Petr Jancar
2013FedCSISVisual Programming of MPI Applications: Debugging and Performance Analysis.Stanislav Bhm, Marek Behalek, Ondrej Meca, Martin Surkovsk
2013PPAMPrototyping Framework for Parallel Numerical Computations.Ondrej Meca, Stanislav Bhm, Marek Behalek, Martin Surkovsk
2013STOCEquivalence of deterministic one-counter automata is NL-complete.Stanislav Bhm, Stefan Gller, Petr Jancar
2012ICFPUsage of petri nets for high performance computing.Stanislav Bhm, Marek Behalek
2011ISDAParallelization of ant colony optimization algorithm using Kaira.Marek Behalek, Stanislav Bhm, Pavel Krmer, Martin Surkovsk, Ondrej Meca
2011MFCSLanguage Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete.Stanislav Bhm, Stefan Gller
2010CONCURBisimilarity of One-Counter Processes Is PSPACE-Complete.Stanislav Bhm, Stefan Gller, Petr Jancar