Ondrej Sýkora

Publication Activity (10 Years)

Years Active: 1977-2022
Publications (10 Years): 4

Top Topics

Multi Layer Perceptron

Neural Network Model

Benchmark Suite

Top Venues

SOFSEM (Student Research Forum Papers / Posters)

Publications

Ondrej Sýkora, Phitchaya Mangpo Phothilimthana, Charith Mendis, Amir Yazdanbakhsh
GRANITE: A Graph Neural Network Model for Basic Block Throughput Estimation. CoRR (2022)
Ondrej Sýkora, Phitchaya Mangpo Phothilimthana, Charith Mendis, Amir Yazdanbakhsh
GRANITE: A Graph Neural Network Model for Basic Block Throughput Estimation. IISWC (2022)
Guillaume Châtelet, Chris Kennelly, Sam (Likun) Xi, Ondrej Sýkora, Clement Courbet, Xinliang David Li, Bruno De Backer
automemcpy: a framework for automatic generation of fundamental memory operations. ISMM (2021)
Yishen Chen, Ajay Brahmakshatriya, Charith Mendis, Alex Renda, Eric Atkinson, Ondrej Sýkora, Saman P. Amarasinghe, Michael Carbin
BHive: A Benchmark Suite and Measurement Framework for Validating x86-64 Basic Block Performance Models. IISWC (2019)
Ondrej Sýkora
Implementing the Aho-Corasick Automata for Phonetic Search. SOFSEM (Student Research Forum Papers / Posters) (2015)
Martin Zácek, Rostislav Miarka, Ondrej Sýkora
Visualization of Semantic Data. CSOC (1) (2015)
Jirí Isa, Zuzana Reitermanová, Ondrej Sýkora
Cost-Sensitive Classification with Unconstrained Influence Diagrams. SOFSEM (2012)
Ondrej Sýkora
Speaker Clustering Using Trails in Feature Space. ICMLA (2010)
André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discret. Math. 309 (11) (2009)
Jirí Isa, Zuzana Reitermanová, Ondrej Sýkora
On the Complexity of General Solution DAGs. ICMLA (2009)
Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto
An improved upper bound on the crossing number of the hypercube. J. Graph Theory 59 (2) (2008)
Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrto
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method. Random Struct. Algorithms 33 (4) (2008)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
On k-planar crossing numbers. Discret. Appl. Math. 155 (9) (2007)
Hongmei He, Ondrej Sýkora, Erkki Mäkinen
Genetic algorithms for the 2-page book drawing problem of graphs. J. Heuristics 13 (1) (2007)
Jirí Isa, Viliam Lisý, Zuzana Reitermanová, Ondrej Sýkora
Unconstrained Influence Diagram Solver: Guido. ICTAI (1) (2007)
Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen
Parallelisation of genetic algorithms for the 2-page crossing number problem. J. Parallel Distributed Comput. 67 (2) (2007)
Hongmei He, Ondrej Sýkora
A Hopfield Neural Network Model for the Outerplanar Drawing Problem. IMECS (2006)
Hongmei He, Ondrej Sýkora, Ana Salagean
Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem. Parallel and Distributed Computing and Networks (2006)
Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. SOFSEM (2005)
Hongmei He, Ondrej Sýkora, Imrich Vrto
Crossing Minimisation Heuristics for 2-page Drawings. Electron. Notes Discret. Math. 22 (2005)
Ondrej Sýkora, Lubomir Torok, Imrich Vrto
The Cyclic Antibandwidth Problem. Electron. Notes Discret. Math. 22 (2005)
Xuan Liu, Hongmei He, Ondrej Sýkora
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem. ADMA (2005)
Guillaume Fertin, André Raspaud, Ondrej Sýkora
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. SIROCCO (2004)
Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. Discret. Appl. Math. 143 (1-3) (2004)
Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrt'o
Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions. Electron. J. Comb. 11 (1) (2004)
Ondrej Sýkora, László A. Székely, Imrich Vrto
A note on Halton's conjecture. Inf. Sci. 164 (1-4) (2004)
Matthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto
New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. Graph Drawing (2004)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bounds and Methods for k-Planar Crossing Numbers. Graph Drawing (2003)
Matthew Newton, Ondrej Sýkora, Mark S. Withall, Imrich Vrto
A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing. IEA/AIE (2003)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bounds for Convex Crossing Numbers. COCOON (2003)
Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto
An Improved Upper Bound on the Crossing Number of the Hypercube. WG (2003)
Ondrej Sýkora, László A. Székely, Imrich Vrto
Fractional Lengths and Crossing Numbers. Graph Drawing (2002)
Ondrej Sýkora, László A. Székely, Imrich Vrto
Two Counterexamples in Graph Drawing. WG (2002)
Matthew Newton, Ondrej Sýkora, Imrich Vrto
Two New Heuristics for Two-Sided Bipartite Graph Drawing. Graph Drawing (2002)
Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Permutation Communication in All-Optical Rings. Parallel Process. Lett. 12 (1) (2002)
Juraj Hromkovic, Ondrej Sýkora
Preface. Discret. Appl. Math. 108 (1-2) (2001)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
On Bipartite Drawings and the Linear Arrangement Problem. SIAM J. Comput. 30 (6) (2000)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
A new lower bound for the bipartite crossing number with applications. Theor. Comput. Sci. 245 (2) (2000)
André Raspaud, Ondrej Sýkora, Imrich Vrto
Congestion and dilation, similarities and differences: A survey. SIROCCO (2000)
Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Evolutionary graph colouring. Inf. Process. Lett. 76 (1-2) (2000)
Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Diameter of the Knödel Graph. WG (2000)
Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Evolutionary Graph Colouring. SIROCCO (1999)
Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Cyclic Cutwidth of the Mesh. SOFSEM (1999)
Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
On permutation communications in all-optical rings. SIROCCO (1998)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
on Surfaces. Discret. Comput. Geom. 19 (2) (1998)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. WADS (1997)
Heiko Schröder, A. E. May, Imrich Vrto, Ondrej Sýkora
Approximation Algorithms for the Vertex Bipartization Problem. SOFSEM (1997)
Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Optical All-to-All Communication for Some Product Graphs. SOFSEM (1997)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bipartite Crossing Numbers of Meshes and Hypercubes. Graph Drawing (1997)
Ondrej Sýkora
Special Issue on Parallel and Distributed Computing. Comput. Artif. Intell. 16 (2) (1997)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o
The book crossing number of a graph. J. Graph Theory 21 (4) (1996)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
Drawings of Graphs on Surfaces with Few Crossings. Algorithmica 16 (1) (1996)
André Raspaud, Ondrej Sýkora, Imrich Vrto
Cutwidth of the Bruijn Graph. RAIRO Theor. Informatics Appl. 29 (6) (1995)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Crossing Numbers of Meshes. Graph Drawing (1995)
José D. P. Rolim, Ondrej Sýkora, Imrich Vrto
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. WG (1995)
Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
On Embeddings in Cycles Inf. Comput. 118 (2) (1995)
Ondrej Sýkora, Imrich Vrt'o
On VLSI layouts of the star graph and related networks. Integr. 17 (1) (1994)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Book Embeddings and Crossing Numbers. WG (1994)
Ondrej Sýkora, Imrich Vrto
Edge Separators for Graphs of Bounded Genus with Applications. Theor. Comput. Sci. 112 (2) (1993)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
Improving Bounds for the Crossing Numbers on Surfaces of Genus g. WG (1993)
Ondrej Sýkora, Imrich Vrto
On Crossing Numbers of Hypercubes and Cube Connected Cycles. BIT 33 (2) (1993)
Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
Edge Separators of Planar and Outerplanar Graphs with Applications. J. Algorithms 14 (2) (1993)
Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
A Short Proof of the Dilation of a Toroidal Mesh in a Path. Inf. Process. Lett. 48 (4) (1993)
Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
On Embedding Interconnection Networks into Rings of Processors. PARLE (1992)
Vladimir Palko, Ondrej Sýkora, Imrich Vrto
Area Complexity of Merging. Theor. Comput. Sci. 82 (1) (1991)
Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Optimal Embedding of a Toroidal Array in a Linear Array. FCT (1991)
Ondrej Sýkora, Imrich Vrto
On the Crossing Number of the Hypercube and the Cube Connected Cycles. WG (1991)
Ondrej Sýkora, Imrich Vrto
Edge Separators for Graphs of Bounded Genus with Applications. WG (1991)
P. Ferianc, Ondrej Sýkora
Area Complexity of Multilective Merging. PARLE (1) (1991)
Vladimir Palko, Ondrej Sýkora, Imrich Vrto
Area Complexity of Merging. MFCS (1989)
Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
Edge Separators for Planar Graphs and Their Applications. MFCS (1988)
Ondrej Sýkora, Imrich Vrto
Tight Chip Area Lower Bounds for String Matching. Inf. Process. Lett. 26 (3) (1987)
Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto
A Minimum-Area Circuit for l-Selection. Algorithmica 2 (1987)
Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson
Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. Inf. Process. Lett. 21 (5) (1985)
Ondrej Sýkora, Imrich Vrto
Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. STACS (1984)
Ondrej Sýkora
VLSI systems for some problems of computational geometry. Parallel Comput. 1 (3-4) (1984)
Ondrej Sýkora
A Fast Non-Commutative Algorithm for Matrix Multiplication. MFCS (1977)