Omer Berkman
Omer Berkman
The Academic College of Tel Aviv Yaffo
Verified email at mta.ac.il
Title
Cited by
Cited by
Year
Regulatory on/off minimization of metabolic flux changes after genetic perturbations
T Shlomi, O Berkman, E Ruppin
Proceedings of the national academy of sciences 102 (21), 7695-7700, 2005
5182005
Recursive star-tree parallel data structure
O Berkman, U Vishkin
SIAM Journal on Computing 22 (2), 221-242, 1993
2201993
Highly parallelizable problems
O Berkman, D Breslauer, Z Galil, B Schieber, U Vishkin
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
1511989
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values
O Berkman, B Schieber, U Vishkin
Journal of Algorithms 14 (3), 344-370, 1993
1251993
Finding level-ancestors in trees
O Berkman, U Vishkin
Journal of computer and System Sciences 48 (2), 214-230, 1994
1191994
Recursive*-tree parallel data-structure
O Berkman, U Vishkin
30th Annual Symposium on Foundations of Computer Science, 196-202, 1989
741989
Efficient dynamic traitor tracing
O Berkman, M Parnas, J Sgall
SIAM Journal on Computing 30 (6), 1802-1828, 2001
642001
The unbearable lightness of PIN cracking
O Berkman, OM Ostrovsky
International Conference on Financial Cryptography and Data Security, 224-238, 2007
412007
The subtree max gap problem with application to parallel string covering
O Berkman, CS Iliopoulos, K Park
Information and Computation 123 (1), 127-137, 1995
311995
On parallel integer merging
O Berkman, U Vishkin
Information and Computation 106 (2), 266-285, 1993
241993
User authentication method
MMM Yung, O Berkman
US Patent 8,838,973, 2014
222014
The subtree max gap problem with application to parallel string covering
AM Ben-Amram, O Berkman, CS Iliopoulos, K Park
Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994
211994
A fast parallel algorithm for finding the convex hull of a sorted point set
O Berkman, B Schieber, U Vishkin
International Journal of Computational Geometry & Applications 6 (02), 231-241, 1996
191996
Some triply-logarithmic parallel algorithms
O Berkman, J JáJá, S Krishnamurthy, R Thurimella, U Vishkin
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
191990
All cycles are edge-magic
O Berkman, M Parnas, Y Roditty
ARS COMBINATORIA-WATERLOO THEN WINNIPEG- 59, 145-152, 2001
172001
Some doubly logarithmic parallel algorithms based on finding all nearest smaller values
O Berkman, B Schieber, U Vishkin
Technical Report UMIACS-TR-88-79, 1988
111988
Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains
O Berkman, Y Matias, P Ragde
Journal of Algorithms 28 (2), 197-215, 1998
101998
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
O Berkman, Y Matias, P Ragde
Workshop on Algorithms and Data Structures, 175-187, 1993
81993
Randomized range-maxima in nearly-constant parallel time
O Berkman, Y Matias, U Vishkin
computational complexity 2 (4), 350-373, 1992
81992
Constraint-based modelling of perturbed organisms: A room for improvement
T Shlomi, O Berkman, E Ruppin
University of Tel-Aviv, 2004
62004
The system can't perform the operation now. Try again later.
Articles 1–20