Omer Berkman

According to our database, Omer Berkman authored at least 26 papers between 1989 and 2012.

Collaborative distances:

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

2012

Firm Grip Handshakes: A Tool for Bidirectional Vouching.

Omer Berkman, Benny Pinkas, Moti Yung

Proceedings of the Cryptology and Network Security, 11th International Conference, 2012

Contextual OTP: Mitigating Emerging Man-in-the-Middle Attacks with Wireless Hardware Tokens.

Assaf Ben-David, Omer Berkman, Yossi Matias, Sarvar Patel, Cem Paya, Moti Yung

Proceedings of the Applied Cryptography and Network Security, 2012

2007

Robust Inference in Bayesian Networks with Application to Gene Expression Temporal Data.

Omer Berkman, Nathan Intrator

Proceedings of the Multiple Classifier Systems, 7th International Workshop, 2007

The Unbearable Lightness of PIN Cracking.

Omer Berkman, Odelia Moshe Ostrovsky

Proceedings of the Financial Cryptography and Data Security, 2007

2003

Element distinctness on one-tape Turing machines: a complete solution.

Amir M. Ben-Amram, Omer Berkman, Holger Petersen

Acta Informatica, 2003

2001

All Cycles are Edge-Magic.

Omer Berkman, Michal Parnas, Yehuda Roditty

Ars Comb., 2001

2000

Efficient Dynamic Traitor Tracing.

Omer Berkman, Michal Parnas, Jirí Sgall

SIAM J. Comput., 2000

1998

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

Omer Berkman, Yossi Matias, Prabhakar Ragde

J. Algorithms, 1998

1996

A fast parallel algorithm for finding the convex hull of a sorted point set.

Omer Berkman, Baruch Schieber, Uzi Vishkin

Int. J. Comput. Geom. Appl., 1996

1995

Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs.

Omer Berkman, Yossi Matias

Parallel Process. Lett., 1995

The Subtree Max Gap Problem with Application to Parallel String Covering.

Omer Berkman, Costas S. Iliopoulos, Kunsoo Park

Inf. Comput., 1995

Almost Fully-parallel Parentheses Matching.

Omer Berkman, Uzi Vishkin

Discret. Appl. Math., 1995

On the Power of Randomization for the Common PRAM.

Omer Berkman, Phillip B. Gibbons, Yossi Matias

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

1994

Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima.

Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin

SIAM J. Comput., 1994

Finding Level-Ancestors in Trees.

Omer Berkman, Uzi Vishkin

J. Comput. Syst. Sci., 1994

The Subtree Max Gap Problem with Application to Parallel String Covering.

Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

On Parallel Integer Merging

Omer Berkman, Uzi Vishkin

Inf. Comput., October, 1993

Recursive Star-Tree Parallel Data Structure.

Omer Berkman, Uzi Vishkin

SIAM J. Comput., 1993

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

Omer Berkman, Baruch Schieber, Uzi Vishkin

J. Algorithms, 1993

Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.

Omer Berkman, Yossi Matias, Prabhakar Ragde

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

Randomized Range-Maxima in Nearly-Constant Parallel Time.

Omer Berkman, Yossi Matias, Uzi Vishkin

Comput. Complex., 1992

Randomized Range-Maxima inNearly-Constant Parallel Time.

Omer Berkman, Yossi Matias, Uzi Vishkin

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Paradigms for very fast parallel algorithms

Omer Berkman

PhD thesis, 1991

1990

Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)

Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Highly Parallelizable Problems (Extended Abstract)

Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Recursive *-Tree Parallel Data-Structure (Extended Abstract)

Omer Berkman, Uzi Vishkin

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989