Searching for authors named "Omer Berkman" – sorted by Relevance.
-
Regulatory on/off minimization of metabolic flux changes after genetic perturbations
- doi:10.1073/pnas.0406346102 This information is current as of December 2006. High-resolution figures, a citation map, links to PubMed and Google Scholar, etc., can be found at: www.pnas.org/cgi/content/full/102/21/7695 Supplementary material can be found at: www.pnas.org/cgi/content/full/0406346102/
- Cited by 10 (4 self) – Add To MetaCart
-
Efficient Dynamic Traitor Tracing
- –1828 EFFICIENT DYNAMIC TRAITOR TRACING ∗ OMER BERKMAN † , MICHAL PARNAS † , AND JI ˇ RÍ SGALL‡ Abstract
- Cited by 17 (0 self) – Add To MetaCart
-
Randomized Range-Maxima In Nearly-Constant Parallel Time
- RANDOMIZED RANGE-MAXIMA IN NEARLY-CONSTANT PARALLEL TIME 1 Omer Berkman 2 Yossi Matias 3 Uzi
- Cited by 2 (0 self) – Add To MetaCart
-
Constraint-Based Modelling Of Perturbed Organisms: A ROOM for improvement
- Shlomi 1 , Omer Berkman 1, 2 and Eytan Ruppin 1 School of Computer Science, Tel-Aviv University, Tel
- Cited by 1 (0 self) – Add To MetaCart
-
Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- OPTIMAL DOUBLY LOGARITHMIC PARALLEL ALGORITHMS BASED ON FINDING ALL NEAREST SMALLER VALUES Omer
- Cited by 34 (6 self) – Add To MetaCart
-
Highly Parallelizable Problems (Extended Abstract)
- HIGHLY PARALLELIZABLE PROBLEMS (Extended Abstract) Omer Berkman 1,4 Dany Breslauer 1,2 Zvi
- Cited by 2 (0 self) – Add To MetaCart
-
The unbearable lightness of PIN cracking
- The unbearable lightness of PIN cracking Omer Berkman 1 and Odelia Moshe Ostrovsky 2,3⋆ 1
- Cited by 2 (0 self) – Add To MetaCart
-
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima Over Small Domains
- ibuted Computing, pages 179--189, 1984. [16] F.E. Fich, P.L. Ragde, and A. Wigderson. Simulations among concurrent-write PRAMs. Algorithmica, 3:43--51, 1988. [17] H.N. Gabow, J.L. Bentley, and R.E. Tarjan. Scaling and related techniques for geometry problems. In Proc. 16th ACM Symp. on Theory of Co
- Cited by 2 (0 self) – Add To MetaCart
-
A Fast Parallel Algorithm For Finding The Convex Hull Of A Sorted Point Set
- Company A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET OMER BERKMAN Dept
- Cited by 3 (0 self) – Add To MetaCart

