Recursive *-Tree Parallel Data-Structure (Extended Abstract) - Omer Berkman; Uzi Vishkin (FOCS, 1989)

Highly Parallelizable Problems (Extended Abstract) - Omer Berkman; Dany Breslauer; Zvi Galil; Baruch Schieber; Uzi Vishkin (STOC, 1989)

Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) - Omer Berkman; Joseph F. JáJá; Sridhar Krishnamurthy; Ramakrishna Thurimella; Uzi Vishkin (FOCS, 1990)

Paradigms for very fast parallel algorithms - Omer Berkman (1991)

Randomized Range-Maxima inNearly-Constant Parallel Time. - Omer Berkman; Yossi Matias; Uzi Vishkin (ISAAC, 1992)

Randomized Range-Maxima in Nearly-Constant Parallel Time. - Omer Berkman; Yossi Matias; Uzi Vishkin (Comput. Complex., 1992)

Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. - Omer Berkman; Yossi Matias; Prabhakar Ragde (WADS, 1993)

Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. - Omer Berkman; Baruch Schieber; Uzi Vishkin (J. Algorithms, 1993)

Recursive Star-Tree Parallel Data Structure. - Omer Berkman; Uzi Vishkin (SIAM J. Comput., 1993)

On Parallel Integer Merging - Omer Berkman; Uzi Vishkin (Inf. Comput., 1993)

The Subtree Max Gap Problem with Application to Parallel String Covering. - Amir M. Ben-Amram; Omer Berkman; Costas S. Iliopoulos; Kunsoo Park (SODA, 1994)

Finding Level-Ancestors in Trees. - Omer Berkman; Uzi Vishkin (J. Comput. Syst. Sci., 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)

On the Power of Randomization for the Common PRAM. - Omer Berkman; Phillip B. Gibbons; Yossi Matias (ISTCS, 1995)

Almost Fully-parallel Parentheses Matching. - Omer Berkman; Uzi Vishkin (Discret. Appl. Math., 1995)

The Subtree Max Gap Problem with Application to Parallel String Covering. - Omer Berkman; Costas S. Iliopoulos; Kunsoo Park (Inf. Comput., 1995)

Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs. - Omer Berkman; Yossi Matias (Parallel Process. Lett., 1995)

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)

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. - Omer Berkman; Yossi Matias; Prabhakar Ragde (J. Algorithms, 1998)

Efficient Dynamic Traitor Tracing. - Omer Berkman; Michal Parnas; Jirí Sgall (SIAM J. Comput., 2000)

All Cycles are Edge-Magic. - Omer Berkman; Michal Parnas; Yehuda Roditty (Ars Comb., 2001)

Element distinctness on one-tape Turing machines: a complete solution. - Amir M. Ben-Amram; Omer Berkman; Holger Petersen 001 (Acta Informatica, 2003)

The Unbearable Lightness of PIN Cracking. - Omer Berkman; Odelia Moshe Ostrovsky (Financial Cryptography, 2007)

Robust Inference in Bayesian Networks with Application to Gene Expression Temporal Data. - Omer Berkman; Nathan Intrator (MCS, 2007)

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 (ACNS, 2012)

Firm Grip Handshakes: A Tool for Bidirectional Vouching. - Omer Berkman; Benny Pinkas; Moti Yung (CANS, 2012)

Cryptiny: Compacting Cryptography for Space-Restricted Channels and its Use-case for IoT-E2EE. - Liron David; Omer Berkman; Avinatan Hassidim; David Lazarov; Yossi Matias; Moti Yung (IACR Cryptol. ePrint Arch., 2024)

Extended Diffie-Hellman Encryption for Secure and Efficient Real-Time Beacon Notifications. - Liron David; Omer Berkman; Avinatan Hassidim; David Lazarov; Yossi Matias; Moti Yung (SP, 2025)