Ondrej Sýkora

According to our database, Ondrej Sýkora authored at least 72 papers between 1977 and 2022.

Collaborative distances:

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

2022

GRANITE: A Graph Neural Network Model for Basic Block Throughput Estimation.

Ondrej Sýkora, Phitchaya Mangpo Phothilimthana, Charith Mendis, Amir Yazdanbakhsh

Proceedings of the IEEE International Symposium on Workload Characterization, 2022

2021

automemcpy: a framework for automatic generation of fundamental memory operations.

Guillaume Châtelet, Chris Kennelly, Sam (Likun) Xi, Ondrej Sýkora, Clement Courbet, Xinliang David Li, Bruno De Backer

Proceedings of the ISMM '21: 2021 ACM SIGPLAN International Symposium on Memory Management, 2021

2019

BHive: A Benchmark Suite and Measurement Framework for Validating x86-64 Basic Block Performance Models.

Yishen Chen, Ajay Brahmakshatriya, Charith Mendis, Alex Renda, Eric Atkinson, Ondrej Sýkora, Saman P. Amarasinghe, Michael Carbin

Proceedings of the IEEE International Symposium on Workload Characterization, 2019

2015

Implementing the Aho-Corasick Automata for Phonetic Search.

Ondrej Sýkora

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

Visualization of Semantic Data.

Martin Zácek, Rostislav Miarka, Ondrej Sýkora

Proceedings of the Artificial Intelligence Perspectives and Applications, 2015

2012

Cost-Sensitive Classification with Unconstrained Influence Diagrams.

Jirí Isa, Zuzana Reitermanová, Ondrej Sýkora

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

2010

Speaker Clustering Using Trails in Feature Space.

Ondrej Sýkora

Proceedings of the Ninth International Conference on Machine Learning and Applications, 2010

2009

Antibandwidth and cyclic antibandwidth of meshes and hypercubes.

André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto

Discret. Math., 2009

On the Complexity of General Solution DAGs.

Jirí Isa, Zuzana Reitermanová, Ondrej Sýkora

Proceedings of the International Conference on Machine Learning and Applications, 2009

2008

Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method.

Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrto

Random Struct. Algorithms, 2008

An improved upper bound on the crossing number of the hypercube.

Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto

J. Graph Theory, 2008

2007

Parallelisation of genetic algorithms for the 2-page crossing number problem.

Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen

J. Parallel Distributed Comput., 2007

Genetic algorithms for the 2-page book drawing problem of graphs.

Hongmei He, Ondrej Sýkora, Erkki Mäkinen

J. Heuristics, 2007

On k-planar crossing numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Discret. Appl. Math., 2007

Unconstrained Influence Diagram Solver: Guido.

Jirí Isa, Viliam Lisý, Zuzana Reitermanová, Ondrej Sýkora

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

2006

Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem.

Hongmei He, Ondrej Sýkora, Ana Salagean

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2006

A Hopfield Neural Network Model for the Outerplanar Drawing Problem.

Hongmei He, Ondrej Sýkora

Proceedings of the International MultiConference of Engineers and Computer Scientists 2006, 2006

2005

The Cyclic Antibandwidth Problem.

Ondrej Sýkora, Lubomir Torok, Imrich Vrto

Electron. Notes Discret. Math., 2005

Crossing Minimisation Heuristics for 2-page Drawings.

Hongmei He, Ondrej Sýkora, Imrich Vrto

Electron. Notes Discret. Math., 2005

Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs.

Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem.

Xuan Liu, Hongmei He, Ondrej Sýkora

Proceedings of the Advanced Data Mining and Applications, First International Conference, 2005

2004

A note on Halton's conjecture.

Ondrej Sýkora, László A. Székely, Imrich Vrto

Inf. Sci., 2004

Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes.

Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Discret. Appl. Math., 2004

Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions.

Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrt'o

Electron. J. Comb., 2004

No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes.

Guillaume Fertin, André Raspaud, Ondrej Sýkora

Proceedings of the Structural Information and Communication Complexity, 2004

New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes.

Matthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing.

Matthew Newton, Ondrej Sýkora, Mark S. Withall, Imrich Vrto

Proceedings of the Developments in Applied Artificial Intelligence, 2003

Bounds and Methods for k-Planar Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Bounds for Convex Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Permutation Communication in All-Optical Rings.

Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Parallel Process. Lett., 2002

Two Counterexamples in Graph Drawing.

Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Fractional Lengths and Crossing Numbers.

Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Two New Heuristics for Two-Sided Bipartite Graph Drawing.

Matthew Newton, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

Preface.

Juraj Hromkovic, Ondrej Sýkora

Discret. Appl. Math., 2001

2000

A new lower bound for the bipartite crossing number with applications.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Theor. Comput. Sci., 2000

On Bipartite Drawings and the Linear Arrangement Problem.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

SIAM J. Comput., 2000

Evolutionary graph colouring.

Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Inf. Process. Lett., 2000

Diameter of the Knödel Graph.

Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Congestion and dilation, similarities and differences: A survey.

André Raspaud, Ondrej Sýkora, Imrich Vrto

Proceedings of the SIROCCO 7, 2000

1999

Cyclic Cutwidth of the Mesh.

Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

1998

Intersection of Curves and Crossing Number of C_m x C_n on Surfaces.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Discret. Comput. Geom., 1998

On permutation communications in all-optical rings.

Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the SIROCCO'98, 1998

1997

Special Issue on Parallel and Distributed Computing.

Ondrej Sýkora

Comput. Artif. Intell., 1997

On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Optical All-to-All Communication for Some Product Graphs.

Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Approximation Algorithms for the Vertex Bipartization Problem.

Heiko Schröder, A. E. May, Imrich Vrto, Ondrej Sýkora

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Bipartite Crossing Numbers of Meshes and Hypercubes.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

The book crossing number of a graph.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o

J. Graph Theory, 1996

Drawings of Graphs on Surfaces with Few Crossings.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto

Algorithmica, 1996

1995

On Embeddings in Cycles

Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto

Inf. Comput., May, 1995

Cutwidth of the Bruijn Graph.

André Raspaud, Ondrej Sýkora, Imrich Vrto

RAIRO Theor. Informatics Appl., 1995

Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes.

José D. P. Rolim, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Crossing Numbers of Meshes.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

On VLSI layouts of the star graph and related networks.

Ondrej Sýkora, Imrich Vrt'o

Integr., 1994

Book Embeddings and Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993

Edge Separators for Graphs of Bounded Genus with Applications.

Ondrej Sýkora, Imrich Vrto

Theor. Comput. Sci., 1993

Edge Separators of Planar and Outerplanar Graphs with Applications.

Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto

J. Algorithms, 1993

A Short Proof of the Dilation of a Toroidal Mesh in a Path.

Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Inf. Process. Lett., 1993

On Crossing Numbers of Hypercubes and Cube Connected Cycles.

Ondrej Sýkora, Imrich Vrto

BIT, 1993

Improving Bounds for the Crossing Numbers on Surfaces of Genus g.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

On Embedding Interconnection Networks into Rings of Processors.

Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto

Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

1991

Area Complexity of Merging.

Vladimir Palko, Ondrej Sýkora, Imrich Vrto

Theor. Comput. Sci., 1991

On the Crossing Number of the Hypercube and the Cube Connected Cycles.

Ondrej Sýkora, Imrich Vrto

Proceedings of the 17th International Workshop, 1991

Area Complexity of Multilective Merging.

P. Ferianc, Ondrej Sýkora

Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Optimal Embedding of a Toroidal Array in a Linear Array.

Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1988

Edge Separators for Planar Graphs and Their Applications.

Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

Tight Chip Area Lower Bounds for String Matching.

Ondrej Sýkora, Imrich Vrto

Inf. Process. Lett., 1987

A Minimum-Area Circuit for l-Selection.

Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto

Algorithmica, 1987

1985

Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations.

Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson

Inf. Process. Lett., 1985

1984

VLSI systems for some problems of computational geometry.

Ondrej Sýkora

Parallel Comput., 1984

Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region.

Ondrej Sýkora, Imrich Vrto

Proceedings of the STACS 84, 1984

1977

A Fast Non-Commutative Algorithm for Matrix Multiplication.

Ondrej Sýkora

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977