ד"ר עמר ברקמן

ד"ר עמר ברקמן

מדעי המחשב תואר ראשון

    בשנת 1991 קיבל את הדוקטורט שלו מאוניברסיטת תל־אביב. בשנים 1993-1991 היה מרצה בכיר ב-King's College London, בשנים 1995-1993 עבד בחברת מחקר אלגוריתמים, ובשנת 1995 הצטרף למכללה האקדמית תל־אביב-יפו.

    בשנים 2012-2010 היה חוקר אורח בגוגל, ומשנת 2022 הוא שוב חוקר אורח בגוגל. מחקריו של ד"ר עמר ברקמן עוסקים בעיקר בנושאי אלגוריתמים, Corporate Governance ו-Security and Cryptography.

    Security and cryptography

    קורסים תיאורטיים וקורסי security and cryptography

    The impact of audit committee expertise on auditor resources: the case of Israel, Review of Quantitative Finance and Accounting, 55:579–603, 2020 (with 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, 2018 (with Shlomith D. Zuta).
    Regulatory on/off minimization of metabolic flux changes after genetic perturbations, Proceedings of the National Academy of Sciences (PNAS), 102: 7695-7700, 2005 (with Tomer Shlomi and Eytan Ruppin).
    Efficient dynamic traitor tracing, SIAM Journal on Computing 30, 6:1802-1828, 2001(with Michal Parnas and Jiri Sgall).
    Element distinctness on one-tape Turing machines, Acta Informatica 40, 2:81-94, 2003 (with Amir M. Ben-Amram and Holger Petersen).
    All cycles are edge magic, Ars Combinatoria, 59:145-151, 2001(with Michal Parnas and Yehuda Roditty).
    Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs, J. Algorithms 23:197-215, 1998 (with Yossi Matias and Prabhakar Ragde).
    A Fast parallel algorithm for finding the convex hull of a sorted point set, International Computational Geometry and Applications, 6:231-241, 1996 (with B. Schieber and U. Vishkin).
    The subtree max gap problem with application to parallel string covering, Information and Computation 123:1, 127-137, 1995 (with Costas S. Iliopoulos and Kunsoo Park).
    Fast parallel algorithms for minimum and related problems with small integer inputs, Parallel Processing Letters 5, 2:223-230, 1995 (with Yossi Matias).
    Almost fully parallel parentheses matching, Discrete Applied Mathematics, 57:11-28, 1995 (with Uzi Vishkin).
    Top-bottom routing around a rectangle is as easy as computing prefix minima, SIAM J. Computing 23:449-465, 1994 (with Joseph JaJa, Sridhar Krishnamurthy, Ramakrishna Thurimella and Uzi Vishkin).
    Randomized range-maxima in nearly constant parallel time, J. Computational Complexity 2:350-373, 1992 (with Yossi Matias and Uzi Vishkin).
    Finding level-ancestors in trees, J. Computer and System Sciences, 48:214-230, 1994 (with Uzi Vishkin).
    Recursive star-tree parallel data structure, SIAM J. Computing, 22:221-242, 1993 (with Uzi Vishkin).
    On parallel integer merging, Information and Computation 106:266-285, 1993 (with Uzi Vishkin).
    Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. J. Algorithms 14:344 - 370 (1993) (with Baruch Schieber and Uzi Vishkin).

    The Impact of Audit Committee Size and Composition on Negative Events in the Life of a Company: The Case of Israel, in the 26th European Financial Management Association (EFMA) conference, 2017 (with Shlomith Zuta).

    Bidirectional Vouching for Trusted Handshakes: How to Keep your Server on a Leash, in Proc. 11th International Conference on Cryptology and Network Security (CANS 2012), 2012 (with Benny Pinkas and Moti Yung).

    Mitigating Emerging Man-in-the-Middle Attacks with Wireless Hardware Tokens, in Proc. 10th International Conference on Applied Cryptography and Network Security (ACNS '12), 2012 (with Assaf Ben-David, Yossi Matias, Sarvar Patel, Cem Paya and Moti Yung).

    The unbearable lightness of PIN cracking, in Proc. 11th International Conference on Financial Cryptography and Data Security (FC), 2007 (with Odelia Moshe Ostrovsky).

    Constraint based modeling of perturbed organisms: A ROOM for improvement, 12th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2004 (with Tomer Shlomi and Eytan Ruppin).

    Efficient dynamic traitor tracing, in ACM-SIAM Symposium on Discrete Algorithms, 2000 (with Michal Parnas and Jiri Sgall).

    On the power of randomization for the Common PRAM, in Proc. 3rd Israel Symp, On Theory of Computing and Systems, 1995 (with Yossi Matias and Philip B. Gibbons).

    Fast parallel algorithms for minimum and related problems with small integer inputs IPPS, 1995 (with Yossi Matias).

    The subtree max gap problem with application to parallel string covering, in Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, 1994 (with Amir M. Ben-Amram, Costas S. Iliopoulos and Kunsoo Park).

    Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs, in Proc. 3rd Workshop on Algorithms and Data Structures, Springer LNCS 709, 1993 (with Yossi Matias and Prabhakar Ragde).

    Randomized range-maxima in nearly constant parallel time, in Proc. 3rd International Symposium on Algorithms & Computation, 1992 (with Yossi Matias and Uzi Vishkin).

    Some triply logarithmic parallel algorithms, in Proc. 31st IEEE Symp. on Foundation of Computer Science, pp. 871-881, 1990 (with Joseph JaJa Sridhar Krishnamurthy, Ramakrishna Thurimella and Uzi Vishkin).

    Recursive *-tree parallel data structure, in Proc. 30th IEEE Symp on Foundation of Computer Science, pp. 196-202, 1989 (with Uzi Vishkin).

    Highly parallelizable problems, in Proc. 21st ACM Symp. on Theory of Computing, pp. 309-319, 1989 (with Dany Breslauer, Zvi Galil, Baruch Schieber and Uzi Vishkin).