Ondrej Sýkora

80 papers A 7B 25C 5Misc 1Journal 33Unranked 9

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