Daniel Olejár

According to our database, Daniel Olejár authored at least 8 papers between 1992 and 2012.

Collaborative distances:

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

2012

A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs.

Martin Nehéz, Daniel Olejár, Michal Demetrian

Proceedings of the Theory and Applications of Models of Computation, 2012

2008

On Emergence of Dominating Cliques in Random Graphs

Martin Nehéz, Daniel Olejár, Michal Demetrian

CoRR, 2008

Average Degree in the Interval Graph of a Random Boolean Function.

Eduard Toman, Daniel Olejár, Martin Stanek

Comput. Informatics, 2008

2005

An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques.

Martin Nehéz, Daniel Olejár

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

1999

Integrity Testing in WWW Environment.

Martin Stanek, Daniel Olejár

Proceedings of the Integrity and Internal Control in Information Systems, 1999

Weaknesses in EHA Authentication and Key Distribution Protocol.

Martin Stanek, Daniel Olejár

Proceedings of the Secure Information Networks: Communications and Multimedia Security, 1999

1998

On Cryptographic Properties of Random Boolean Functions.

Daniel Olejár, Martin Stanek

J. Univers. Comput. Sci., 1998

1992

On the Geometry of a Random Square Boolean Matrix.

Daniel Olejár

J. Inf. Process. Cybern., 1992