Omer Berkman

According to our database1, Omer Berkman authored at least 27 papers between 1989 and 2012.

Collaborative distances:



In proceedings 
PhD thesis 




Firm Grip Handshakes: A Tool for Bidirectional Vouching.
Proceedings of the Cryptology and Network Security, 11th International Conference, 2012

Contextual OTP: Mitigating Emerging Man-in-the-Middle Attacks with Wireless Hardware Tokens.
Proceedings of the Applied Cryptography and Network Security, 2012

Robust Inference in Bayesian Networks with Application to Gene Expression Temporal Data.
Proceedings of the Multiple Classifier Systems, 7th International Workshop, 2007

The Unbearable Lightness of PIN Cracking.
Proceedings of the Financial Cryptography and Data Security, 2007

Element distinctness on one-tape Turing machines: a complete solution.
Acta Inf., 2003

All Cycles are Edge-Magic.
Ars Comb., 2001

Efficient Dynamic Traitor Tracing.
SIAM J. Comput., 2000

Efficient dynamic traitor tracing.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains.
J. Algorithms, 1998

A fast parallel algorithm for finding the convex hull of a sorted point set.
Int. J. Comput. Geometry Appl., 1996

Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs.
Parallel Processing Letters, 1995

The Subtree Max Gap Problem with Application to Parallel String Covering.
Inf. Comput., 1995

Almost Fully-parallel Parentheses Matching.
Discrete Applied Mathematics, 1995

On the Power of Randomization for the Common PRAM.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Fast parallel algorithms for minimum and related problems with small integer inputs.
Proceedings of IPPS '95, 1995

Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima.
SIAM J. Comput., 1994

Finding Level-Ancestors in Trees.
J. Comput. Syst. Sci., 1994

The Subtree Max Gap Problem with Application to Parallel String Covering.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

On Parallel Integer Merging
Inf. Comput., October, 1993

Recursive Star-Tree Parallel Data Structure.
SIAM J. Comput., 1993

Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.
J. Algorithms, 1993

Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Randomized Range-Maxima in Nearly-Constant Parallel Time.
Computational Complexity, 1992

Randomized Range-Maxima inNearly-Constant Parallel Time.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Highly Parallelizable Problems (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Recursive *-Tree Parallel Data-Structure (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989