The SCEAS System
| |||||||

## Search the dblp DataBase
Omer Berkman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
**Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1990, pp:871-881 [Conf] - Omer Berkman, Uzi Vishkin
**Recursive *-Tree Parallel Data-Structure (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1989, pp:196-202 [Conf] - Omer Berkman, Yossi Matias
**Fast parallel algorithms for minimum and related problems with small integer inputs.**[Citation Graph (0, 0)][DBLP] IPPS, 1995, pp:203-207 [Conf] - Omer Berkman, Yossi Matias, Uzi Vishkin
**Randomized Range-Maxima inNearly-Constant Parallel Time.**[Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:135-144 [Conf] - Omer Berkman, Phillip B. Gibbons, Yossi Matias
**On the Power of Randomization for the Common PRAM.**[Citation Graph (0, 0)][DBLP] ISTCS, 1995, pp:229-240 [Conf] - Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
**The Subtree Max Gap Problem with Application to Parallel String Covering.**[Citation Graph (0, 0)][DBLP] SODA, 1994, pp:501-510 [Conf] - Omer Berkman, Michal Parnas, Jiri Sgall
**Efficient dynamic traitor tracing.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:586-595 [Conf] - Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
**Highly Parallelizable Problems (Extended Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1989, pp:309-319 [Conf] - Omer Berkman, Yossi Matias, Prabhakar Ragde
**Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.**[Citation Graph (0, 0)][DBLP] WADS, 1993, pp:175-187 [Conf] - Amir M. Ben-Amram, Omer Berkman, Holger Petersen
**Element distinctness on one-tape Turing machines: a complete solution.**[Citation Graph (0, 0)][DBLP] Acta Inf., 2003, v:40, n:2, pp:81-94 [Journal] - Omer Berkman, Michal Parnas, Yehuda Roditty
**All Cycles are Edge-Magic.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:59, n:, pp:- [Journal] - Omer Berkman, Yossi Matias, Uzi Vishkin
**Randomized Range-Maxima in Nearly-Constant Parallel Time.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1992, v:2, n:, pp:350-373 [Journal] - Omer Berkman, Uzi Vishkin
**Almost Fully-parallel Parentheses Matching.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:57, n:1, pp:11-28 [Journal] - Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
**The Subtree Max Gap Problem with Application to Parallel String Covering.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:123, n:1, pp:127-137 [Journal] - Omer Berkman, Uzi Vishkin
**On Parallel Integer Merging**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1993, v:106, n:2, pp:266-285 [Journal] - Omer Berkman, Baruch Schieber, Uzi Vishkin
**A fast parallel algorithm for finding the convex hull of a sorted point set.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:231-242 [Journal] - Omer Berkman, Yossi Matias, Prabhakar Ragde
**Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1998, v:28, n:2, pp:197-215 [Journal] - Omer Berkman, Baruch Schieber, Uzi Vishkin
**Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1993, v:14, n:3, pp:344-370 [Journal] - Omer Berkman, Uzi Vishkin
**Finding Level-Ancestors in Trees.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1994, v:48, n:2, pp:214-230 [Journal] - Omer Berkman, Yossi Matias
**Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1995, v:5, n:, pp:223-230 [Journal] - Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
**Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:3, pp:449-465 [Journal] - Omer Berkman, Michal Parnas, Jiri Sgall
**Efficient Dynamic Traitor Tracing.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:6, pp:1802-1828 [Journal] - Omer Berkman, Uzi Vishkin
**Recursive Star-Tree Parallel Data Structure.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1993, v:22, n:2, pp:221-242 [Journal] - Omer Berkman, Nathan Intrator
**Robust Inference in Bayesian Networks with Application to Gene Expression Temporal Data.**[Citation Graph (0, 0)][DBLP] MCS, 2007, pp:479-489 [Conf] **The Unbearable Lightness of PIN Cracking.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |