Omer Berkman

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 1

Top Topics

Higher Dimensional

Information Space

Cellular Automata

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Liron David, Omer Berkman, Avinatan Hassidim, David Lazarov, Yossi Matias, Moti Yung
Cryptiny: Compacting Cryptography for Space-Restricted Channels and its Use-case for IoT-E2EE. IACR Cryptol. ePrint Arch. 2024 (2024)
Omer Berkman, Benny Pinkas, Moti Yung
Firm Grip Handshakes: A Tool for Bidirectional Vouching. CANS (2012)
Assaf Ben-David, Omer Berkman, Yossi Matias, Sarvar Patel, Cem Paya, Moti Yung
Contextual OTP: Mitigating Emerging Man-in-the-Middle Attacks with Wireless Hardware Tokens. ACNS (2012)
Omer Berkman, Nathan Intrator
Robust Inference in Bayesian Networks with Application to Gene Expression Temporal Data. MCS (2007)
Omer Berkman, Odelia Moshe Ostrovsky
The Unbearable Lightness of PIN Cracking. Financial Cryptography (2007)
Amir M. Ben-Amram, Omer Berkman, Holger Petersen
Element distinctness on one-tape Turing machines: a complete solution. Acta Informatica 40 (2) (2003)
Omer Berkman, Michal Parnas, Yehuda Roditty
All Cycles are Edge-Magic. Ars Comb. 59 (2001)
Omer Berkman, Michal Parnas, Jirí Sgall
Efficient dynamic traitor tracing. SODA (2000)
Omer Berkman, Michal Parnas, Jirí Sgall
Efficient Dynamic Traitor Tracing. SIAM J. Comput. 30 (6) (2000)
Omer Berkman, Yossi Matias, Prabhakar Ragde
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. J. Algorithms 28 (2) (1998)
Omer Berkman, Baruch Schieber, Uzi Vishkin
A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geom. Appl. 6 (2) (1996)
Omer Berkman, Uzi Vishkin
Almost Fully-parallel Parentheses Matching. Discret. Appl. Math. 57 (1) (1995)
Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
The Subtree Max Gap Problem with Application to Parallel String Covering. Inf. Comput. 123 (1) (1995)
Omer Berkman, Phillip B. Gibbons, Yossi Matias
On the Power of Randomization for the Common PRAM. ISTCS (1995)
Omer Berkman, Yossi Matias
Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs. Parallel Process. Lett. 5 (1995)
Omer Berkman, Yossi Matias
Fast parallel algorithms for minimum and related problems with small integer inputs. IPPS (1995)
Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. SIAM J. Comput. 23 (3) (1994)
Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
The Subtree Max Gap Problem with Application to Parallel String Covering. SODA (1994)
Omer Berkman, Uzi Vishkin
Finding Level-Ancestors in Trees. J. Comput. Syst. Sci. 48 (2) (1994)
Omer Berkman, Yossi Matias, Prabhakar Ragde
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. WADS (1993)
Omer Berkman, Uzi Vishkin
Recursive Star-Tree Parallel Data Structure. SIAM J. Comput. 22 (2) (1993)
Omer Berkman, Baruch Schieber, Uzi Vishkin
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. J. Algorithms 14 (3) (1993)
Omer Berkman, Uzi Vishkin
On Parallel Integer Merging Inf. Comput. 106 (2) (1993)
Omer Berkman, Yossi Matias, Uzi Vishkin
Randomized Range-Maxima inNearly-Constant Parallel Time. ISAAC (1992)
Omer Berkman, Yossi Matias, Uzi Vishkin
Randomized Range-Maxima in Nearly-Constant Parallel Time. Comput. Complex. 2 (1992)
Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) FOCS (1990)
Omer Berkman, Uzi Vishkin
Recursive *-Tree Parallel Data-Structure (Extended Abstract) FOCS (1989)
Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
Highly Parallelizable Problems (Extended Abstract) STOC (1989)