≡ X En

בית הספר למדעי המחשב

המכללה האקדמית תל-אביב

ד

ד"ר עמר ברקמן

הצגה: רשמי, שנתי, לינארי.

מאמרים בעתונות מדעית

18 O. Berkman and S.D. Zuta. Does Effort Pay Off? Evidence From Internal Audit in Israel, באוסף S.P. Ferris, K. John and A.K. Makhija (עורכים), Empirical Research in Banking and Corporate Finance (Advances in Financial Economics), כרך 21, עמודים 101-118, Emerald Publishing Limited, Leeds, 2022.
17 Omer Berkman and Shlomith D Zuta. The Impact of Audit Committee Expertise on Auditor Resources: The Case of Israel, Review of Quantitative Finance and Accounting, עמודים 1–25, Springer, 2019.
16 Omer Berkman and Shlomith D Zuta. Reconsidering the Mandate of the Audit Committee: Evidence from Corporate Governance in Israel, International Corporate Governance and Regulation (Advances in Financial Economics Series), כרך 20, עמודים 187–207, Emerald Publishing Limited, 2018.
15 Tomer Shlomi, Omer Berkman and Eytan Ruppin. Regulatory On/Off Minimization of Metabolic Flux Changes After Genetic Perturbations, Proceedings of the National Academy of Sciences, כרך 102, מספר 21, עמודים 7695–7700, National Academy of Sciences, 2005.
14 Amir M. Ben-Amram, Omer Berkman and Holger Petersen. Element distinctness on one-tape Turing machines: a complete solution, Acta Informatica, כרך 40, מספר 2, עמודים 81–94, 2003.
13 Omer Berkman, Michal Parnas and Yehuda Roditty. All Cycles are Edge-Magic, Ars Comb., כרך 59, עמודים 145–151, 2001.
12 Omer Berkman, Michal Parnas and Jirí Sgall. Efficient Dynamic Traitor Tracing, SIAM J. Comput., כרך 30, מספר 6, עמודים 1802–1828, 2000.
11 Omer Berkman, Yossi Matias and Prabhakar Ragde. Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains, J. Algorithms, כרך 28, מספר 2, עמודים 197–215, 1998.
10 Omer Berkman, Baruch Schieber and Uzi Vishkin. A fast parallel algorithm for finding the convex hull of a sorted point set, Int. J. Comput. Geom. Appl., כרך 6, מספר 2, עמודים 231–242, 1996.
9 Omer Berkman, Costas S. Iliopoulos and Kunsoo Park. The Subtree Max Gap Problem with Application to Parallel String Covering, Inf. Comput., כרך 123, מספר 1, עמודים 127–137, 1995.
8 Omer Berkman and Yossi Matias. Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs, Parallel Process. Lett., כרך 5, עמודים 223–230, 1995.
7 Omer Berkman and Uzi Vishkin. Almost Fully-parallel Parentheses Matching, Discret. Appl. Math., כרך 57, מספר 1, עמודים 11–28, 1995.
6 Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella and Uzi Vishkin. Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima, SIAM J. Comput., כרך 23, מספר 3, עמודים 449–465, 1994.
5 Omer Berkman and Uzi Vishkin. Finding Level-Ancestors in Trees, J. Comput. Syst. Sci., כרך 48, מספר 2, עמודים 214–230, 1994.
4 Omer Berkman, Baruch Schieber and Uzi Vishkin. Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values, J. Algorithms, כרך 14, מספר 3, עמודים 344–370, 1993.
3 Omer Berkman and Uzi Vishkin. On Parallel Integer Merging, Inf. Comput., כרך 106, מספר 2, עמודים 266–285, 1993.
2 Omer Berkman and Uzi Vishkin. Recursive Star-Tree Parallel Data Structure, SIAM J. Comput., כרך 22, מספר 2, עמודים 221–242, 1993.
1 Omer Berkman, Yossi Matias and Uzi Vishkin. Randomized Range-Maxima in Nearly-Constant Parallel Time, Comput. Complex., כרך 2, עמודים 350–373, 1992.

מאמרים בכנסים

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, באוסף 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, באוסף Feng Bao, Pierangela Samarati and Jianying Zhou (עורכים), Applied Cryptography and Network Security—10th International Conference, ACNS 2012, Singapore, June 26-29, 2012. Proceedings, Lecture Notes in Computer Science, כרך 7341, עמודים 30–47, Springer, 2012.
12 Omer Berkman, Benny Pinkas and Moti Yung. Firm Grip Handshakes: A Tool for Bidirectional Vouching, באוסף Josef Pieprzyk, Ahmad-Reza Sadeghi and Mark Manulis (עורכים), Cryptology and Network Security, 11th International Conference, CANS 2012, Darmstadt, Germany, December 12-14, 2012. Proceedings, כרך 7712, עמודים 142–157, Springer, 2012.
11 Omer Berkman and Odelia Moshe Ostrovsky. The Unbearable Lightness of PIN Cracking, באוסף Sven Dietrich and Rachna Dhamija (עורכים), 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, כרך 4886, עמודים 224–238, Springer, 2007.
10 Tomer Shlomi, Omer Berkman and Eytan Ruppin. Constraint-Based Modelling of Perturbed Organisms: A ROOM for Improvement, באוסף 12th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2004.
9 Omer Berkman, Michal Parnas and Jirí Sgall. Efficient dynamic traitor tracing, באוסף David B. Shmoys (עורכים), Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA, עמודים 586–595, ACM/SIAM, 2000.
8 Omer Berkman, Phillip B. Gibbons and Yossi Matias. On the Power of Randomization for the Common PRAM, באוסף Third Israel Symposium on Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings, עמודים 229–240, IEEE Computer Society, 1995.
7 Omer Berkman and Yossi Matias. Fast parallel algorithms for minimum and related problems with small integer inputs, באוסף Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, עמודים 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, באוסף Daniel Dominic Sleator (עורכים), Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA, עמודים 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, באוסף Frank K. H. A. Dehne, Jörg-Rɒdiger Sack, Nicola Santoro and Sue Whitesides (עורכים), Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings, Lecture Notes in Computer Science, כרך 709, עמודים 175–187, Springer, 1993.
4 Omer Berkman, Yossi Matias and Uzi Vishkin. Randomized Range-Maxima inNearly-Constant Parallel Time, באוסף Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki and Masafumi Yamashita (עורכים), Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, Lecture Notes in Computer Science, כרך 650, עמודים 135–144, Springer, 1992.
3 Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella and Uzi Vishkin. Some Triply-Logarithmic Parallel Algorithms (Extended Abstract), באוסף 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, עמודים 871–881, IEEE Computer Society, 1990.
2 Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber and Uzi Vishkin. Highly Parallelizable Problems (Extended Abstract), באוסף David S. Johnson (עורכים), Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washigton, USA, עמודים 309–319, ACM, 1989.
1 Omer Berkman and Uzi Vishkin. Recursive *-Tree Parallel Data-Structure (Extended Abstract), באוסף 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October—1 November 1989, עמודים 196–202, IEEE Computer Society, 1989.
`