| 2007 |
|---|
| 25 | EE | Omer Berkman,
Odelia Moshe Ostrovsky:
The Unbearable Lightness of PIN Cracking.
Financial Cryptography 2007: 224-238 |
| 24 | EE | Omer Berkman,
Nathan Intrator:
Robust Inference in Bayesian Networks with Application to Gene Expression Temporal Data.
MCS 2007: 479-489 |
| 2003 |
|---|
| 23 | EE | Amir M. Ben-Amram,
Omer Berkman,
Holger Petersen:
Element distinctness on one-tape Turing machines: a complete solution.
Acta Inf. 40(2): 81-94 (2003) |
| 2001 |
|---|
| 22 | | Omer Berkman,
Michal Parnas,
Yehuda Roditty:
All Cycles are Edge-Magic.
Ars Comb. 59: (2001) |
| 2000 |
|---|
| 21 | EE | Omer Berkman,
Michal Parnas,
Jiri Sgall:
Efficient dynamic traitor tracing.
SODA 2000: 586-595 |
| 20 | EE | Omer Berkman,
Michal Parnas,
Jiri Sgall:
Efficient Dynamic Traitor Tracing.
SIAM J. Comput. 30(6): 1802-1828 (2000) |
| 1998 |
|---|
| 19 | | 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): 197-215 (1998) |
| 1996 |
|---|
| 18 | | Omer Berkman,
Baruch Schieber,
Uzi Vishkin:
A fast parallel algorithm for finding the convex hull of a sorted point set.
Int. J. Comput. Geometry Appl. 6(2): 231-242 (1996) |
| 1995 |
|---|
| 17 | EE | Omer Berkman,
Yossi Matias:
Fast parallel algorithms for minimum and related problems with small integer inputs.
IPPS 1995: 203-207 |
| 16 | | Omer Berkman,
Phillip B. Gibbons,
Yossi Matias:
On the Power of Randomization for the Common PRAM.
ISTCS 1995: 229-240 |
| 15 | EE | Omer Berkman,
Uzi Vishkin:
Almost Fully-parallel Parentheses Matching.
Discrete Applied Mathematics 57(1): 11-28 (1995) |
| 14 | | Omer Berkman,
Costas S. Iliopoulos,
Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering.
Inf. Comput. 123(1): 127-137 (1995) |
| 13 | | Omer Berkman,
Yossi Matias:
Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs.
Parallel Processing Letters 5: 223-230 (1995) |
| 1994 |
|---|
| 12 | | Amir M. Ben-Amram,
Omer Berkman,
Costas S. Iliopoulos,
Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering.
SODA 1994: 501-510 |
| 11 | | Omer Berkman,
Uzi Vishkin:
Finding Level-Ancestors in Trees.
J. Comput. Syst. Sci. 48(2): 214-230 (1994) |
| 10 | | Omer Berkman,
Joseph 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): 449-465 (1994) |
| 1993 |
|---|
| 9 | | Omer Berkman,
Yossi Matias,
Prabhakar Ragde:
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.
WADS 1993: 175-187 |
| 8 | | Omer Berkman,
Uzi Vishkin:
On Parallel Integer Merging
Inf. Comput. 106(2): 266-285 (1993) |
| 7 | | Omer Berkman,
Baruch Schieber,
Uzi Vishkin:
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.
J. Algorithms 14(3): 344-370 (1993) |
| 6 | | Omer Berkman,
Uzi Vishkin:
Recursive Star-Tree Parallel Data Structure.
SIAM J. Comput. 22(2): 221-242 (1993) |
| 1992 |
|---|
| 5 | | Omer Berkman,
Yossi Matias,
Uzi Vishkin:
Randomized Range-Maxima inNearly-Constant Parallel Time.
ISAAC 1992: 135-144 |
| 4 | | Omer Berkman,
Yossi Matias,
Uzi Vishkin:
Randomized Range-Maxima in Nearly-Constant Parallel Time.
Computational Complexity 2: 350-373 (1992) |
| 1990 |
|---|
| 3 | | Omer Berkman,
Joseph JáJá,
Sridhar Krishnamurthy,
Ramakrishna Thurimella,
Uzi Vishkin:
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)
FOCS 1990: 871-881 |
| 1989 |
|---|
| 2 | | Omer Berkman,
Uzi Vishkin:
Recursive *-Tree Parallel Data-Structure (Extended Abstract)
FOCS 1989: 196-202 |
| 1 | | Omer Berkman,
Dany Breslauer,
Zvi Galil,
Baruch Schieber,
Uzi Vishkin:
Highly Parallelizable Problems (Extended Abstract)
STOC 1989: 309-319 |
