14
|
Omer Berkman and Shlomith D Zuta.
The Impact of Audit Committee Size and Composition on Negative Events in the Life of a Company: The Case of Israel, in 26th European Financial Management Association (EFMA) conference, 2017.
|
13
|
Assaf Ben-David, Omer Berkman, Yossi Matias, Sarvar Patel, Cem Paya and Moti Yung.
Contextual OTP: Mitigating Emerging Man-in-the-Middle Attacks with Wireless Hardware Tokens, in Feng Bao, Pierangela Samarati and Jianying Zhou (eds.), Applied Cryptography and Network Security—10th International Conference, ACNS 2012, Singapore, June 26-29, 2012. Proceedings, Lecture Notes in Computer Science, volume 7341, pages 30–47, Springer, 2012.
|
12
|
Omer Berkman, Benny Pinkas and Moti Yung.
Firm Grip Handshakes: A Tool for Bidirectional Vouching, in Josef Pieprzyk, Ahmad-Reza Sadeghi and Mark Manulis (eds.), Cryptology and Network Security, 11th International Conference, CANS 2012, Darmstadt, Germany, December 12-14, 2012. Proceedings, volume 7712, pages 142–157, Springer, 2012.
|
11
|
Omer Berkman and Odelia Moshe Ostrovsky.
The Unbearable Lightness of PIN Cracking, in Sven Dietrich and Rachna Dhamija (eds.), Financial Cryptography and Data Security, 11th International Conference, FC 2007, and 1st International Workshop on Usable Security, USEC 2007, Scarborough, Trinidad and Tobago, February 12-16, 2007. Revised Selected Papers, Lecture Notes in Computer Science, volume 4886, pages 224–238, Springer, 2007.
|
10
|
Tomer Shlomi, Omer Berkman and Eytan Ruppin.
Constraint-Based Modelling of Perturbed Organisms: A ROOM for Improvement, in 12th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2004.
|
9
|
Omer Berkman, Michal Parnas and Jirí Sgall.
Efficient dynamic traitor tracing, in David B. Shmoys (eds.), Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA, pages 586–595, ACM/SIAM, 2000.
|
8
|
Omer Berkman, Phillip B. Gibbons and Yossi Matias.
On the Power of Randomization for the Common PRAM, in Third Israel Symposium on Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings, pages 229–240, IEEE Computer Society, 1995.
|
7
|
Omer Berkman and Yossi Matias.
Fast parallel algorithms for minimum and related problems with small integer inputs, in Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pages 203–207, IEEE Computer Society, 1995.
|
6
|
Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos and Kunsoo Park.
The Subtree Max Gap Problem with Application to Parallel String Covering, in Daniel Dominic Sleator (eds.), Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA, pages 501–510, ACM/SIAM, 1994.
|
5
|
Omer Berkman, Yossi Matias and Prabhakar Ragde.
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs, in Frank K. H. A. Dehne, Jörg-Rɒdiger Sack, Nicola Santoro and Sue Whitesides (eds.), Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings, Lecture Notes in Computer Science, volume 709, pages 175–187, Springer, 1993.
|
4
|
Omer Berkman, Yossi Matias and Uzi Vishkin.
Randomized Range-Maxima inNearly-Constant Parallel Time, in Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki and Masafumi Yamashita (eds.), Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, Lecture Notes in Computer Science, volume 650, pages 135–144, Springer, 1992.
|
3
|
Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella and Uzi Vishkin.
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract), in 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pages 871–881, IEEE Computer Society, 1990.
|
2
|
Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber and Uzi Vishkin.
Highly Parallelizable Problems (Extended Abstract), in David S. Johnson (eds.), Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washigton, USA, pages 309–319, ACM, 1989.
|
1
|
Omer Berkman and Uzi Vishkin.
Recursive *-Tree Parallel Data-Structure (Extended Abstract), in 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October—1 November 1989, pages 196–202, IEEE Computer Society, 1989.
|