Marek Krcál

According to our database, Marek Krcál authored at least 17 papers between 2008 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2020

Two Semi-supervised Approaches to Malware Detection with Neural Networks.

Jan Koza, Marek Krcál, Martin Holena

Proceedings of the 20th Conference Information Technologies, 2020

2019

Deep Networks in Online Malware Detection.

Jirí Tumpach, Marek Krcál, Martin Holena

Proceedings of the 19th Conference Information Technologies, 2019

2018

Solving equations and optimization problems with uncertainty.

Peter Franek, Marek Krcál, Hubert Wagner

J. Appl. Comput. Topol., 2018

Deep Convolutional Malware Classifiers Can Learn from Raw Executables and Labels Only.

Marek Krcál, Ondrej Svec, Martin Bálek, Otakar Jasek

Proceedings of the 6th International Conference on Learning Representations, 2018

2017

Algorithmic Solvability of the Lifting-Extension Problem.

Martin Cadek, Marek Krcál, Lukás Vokrínek

Discret. Comput. Geom., 2017

2016

Computation of Cubical Steenrod Squares.

Marek Krcál, Pawel Pilarczyk

Proceedings of the Computational Topology in Image Context - 6th International Workshop, 2016

2015

On the Geometric Ramsey Number of Outerplanar Graphs.

Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr

Discret. Comput. Geom., 2015

Cohomotopy groups capture robust properties of zero sets.

Peter Franek, Marek Krcál

CoRR, 2015

On Computability and Triviality of Well Groups.

Peter Franek, Marek Krcál

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

SIAM J. Comput., 2014

Extendability of Continuous Maps Is Undecidable.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

Discret. Comput. Geom., 2014

Robust Satisfiability of Systems of Equations.

Peter Franek, Marek Krcál

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Polynomial-Time Homology for Simplicial Eilenberg-MacLane Spaces.

Marek Krcál, Jirí Matousek, Francis Sergeraert

Found. Comput. Math., 2013

Extending continuous maps: polynomiality and undecidability.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

Proceedings of the Symposium on Theory of Computing Conference, 2013

Packing directed cycles through a specified vertex set.

Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Computing all maps into a sphere.

Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2008

Graph balancing: a special case of scheduling unrelated parallel machines.

Tomás Ebenlendr, Marek Krcál, Jirí Sgall

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008