Institut für Judaistik

Team

Dr. Eythan Levy

Adjunct Researcher

E-Mail
eytan.levy@unibe.ch
Büro
Muesmattstrasse 45, Büro D115
Postadresse
Institut für Judaistik, Länggasstrasse 51, 3012 Bern

Curriculum Vitae
Since Jan. 2024 Senior Research Assistant (Oberassistent) in Digital Archaeology at the University of Zurich (Institute of Archaeology)
Jan. - Dec. 2024 SNSF SPARK grant for the project "Paleographic Networks" (University of Bern)
Jan. 2022 - Dec. 2023 Postdoctoral Researcher, Institute of Jewish Studies, University of Bern (Sinergia Project "Stampf Seals from the Southern Levant")
Since Oct. 2021 PhD candidate at Tel Aviv University,
Topic: “Chronology of the Iron Age in the Levant: A Computational Approach”,
Supervisors: Profs Israel Finkelstein, Eli Piasetzky and Alexander Fantalkin
2018-2020 Teaching Assistant at Tel Aviv University (Department of Electrical Engineering)
  2015

M.A. in Archaeology,
Université Libre de Bruxelles,
Thesis: “Centuries of Darkness revisité : la chronologie ultra-basse de Peter James à l'épreuve de l'archéologie”,
Supervisor: Prof. Laurent Bavay
  2015 “Certificat d'Aptitude Pédagogique Approprié à l'Enseignement Supérieur” (Teaching Certificate for Higher Education),
Université Libre de Bruxelles
  2012

M.A. in Ancient Oriental Languages,
Université Libre de Bruxelles,
Thesis: “Les textes égyptiens du Levant au Nouvel Empire”,
Supervisor: Prof. Michèle Broze
2009-2017 Lecturer in computer science at Ecole supérieure d'Informatique, Brussels
  2009 B.A. in Ancient Oriental Languages,
Université Libre de Bruxelles
2009

Ph.D. in Computer Science,
Université Libre de Bruxelles,
Thesis: “Approximation algorithms for covering problems in dense graphs”,
Super: Prof. Jean Cardinal
  2003

“Diplôme d'Etudes Approfondies” (French M.A.) in Algorithms,
Ecole Polytechnique (Paris),
Thesis: “Analyse et conception d'un algorithme de cycle hamiltonien pour graphes aléatoires de type G(n,p)”,
Supervisor: Prof. Christian Lavault
  2002-2009 Teaching assistant at Université Libre de Bruxelles (Computer Science Department)
  2002

“Licence” (4-year Belgian degree) in Computer Science,
Université Libre de Bruxelles,
Thesis: “Distributed algorithms for finding Hamilton cycles in faulty random geometric graphs”,
Supervisors: Profs. Yves Roggeman and Guy Louchard

Research Interests

  • Archaeology of Egypt and the Levant (Late Bronze & Iron Age)
  • Northwest Semitic epigraphy & sigillography
  • Computer applications in archaeology

Publications

  1. M. J. Adams, I. Finkelstein and E. Levy, in press. “The Four-Chambered Gate at Megiddo”, to appear in Palestine Exploration Quarterly.
  2. E. Levy, G. Geeraerts and F. Pluquet, in press. “ChronoLog: a Tool for Computer-assisted Chronological Modelling.” Proceedings of the 48th International Conference on Computer Applications and Quantitative Methods in Archaeology (CAA 2021).
  3. E. Levy, 2023: “Hebrew Seals: Updated Corpus and Typology.” Near Eastern Archaeology 86.4, pp. 302-310.
  4. E. Levy, 2023: “A Note on an Early Alphabetic Jar Inscription from Lachish.” Israel Exploration Journal 73, pp. 184-188.
  5. E. Levy, 2023: “Quantitative Thoughts on Provenanced Hebrew Seals.” In P. Wyssmann, S. Münger und N. Rahn (eds), Festschrift Silvia Schroer (Orbis Biblicus et Orientalis 303). Leuven: Peeters, pp. 305-316.
  6. E. Levy, 2023: “A computational model for absolute chronology in archaeology”. In G. Stiebel, I. Koch, A. Ecker, A. Gorzalczcany, Y. Tepper, A. Shadman and S. Dan-Goor (eds), In Centro III: Time. Proceedings of the third annual “In Centro” conference. Tel Aviv, pp. 17*–33*.
  7. E. Levy, S. Faigenbaum-Golovin, E. Piasetzky and I. Finkelstein, 2022: “Seeing the Invisible – Ostraca Hunting via Multispectral Imaging.” Semitica et Classica 15, pp. 179-188 . 
  8. E. Levy, I. Finkelstein, M.A.S. Martin and E. Piasetzky, 2022: “The Date of Appearance of Philistine Pottery at Megiddo: A Computational Approach.” Bulletin of the American Schools of Overseas Research 387, pp. 1-30.
  9. E. Levy, E. Piasetzky, A. Fantalkin and I. Finkelstein, 2022: “From Chronological Networks to Bayesian Models: ChronoLog as a Front‐end to OxCal.” Radiocarbon 64, pp. 101-134.
  10. E. Levy, E. Piasetzky and A. Fantalkin, 2021: “Archaeological Cross-dating: A Formalized Scheme.” Archaeological and Anthropological Sciences 13, pp. 1-30.
  11. E. Levy, G. Geeraerts, F. Pluquet, E. Piasetzky and A. Fantalkin, 2021: “Chronological Networks in Archaeology: a Formalised Scheme.” Journal of Archaeological Science 127, pp. 1-27.
  12. S. Faigenbaum-Golovin, I. Finkelstein, E. Levy, N. Na’aman and E. Piasetzky, 2020: “Arad Ostracon 24 Side A.” Semitica 62, pp. 43-68.
  13. E. Levy, E. Piasetzky and I. Finkelstein, 2020: “Strata, Scarabs and Synchronisms: A Framework for Synchronizing Strata and Artifacts.” Journal of Computer Applications in Archaeology 3, pp. 1–17.
  14. I. Finkelstein, M. J. Adams, E. Hall and E. Levy, 2019: “The Iron Age Gates of Megiddo: New Evidence and Updated Interpretations.” Tel Aviv 46, pp. 167-191.
  15. E. Levy, 2018: “A Fresh Look at the Mekal Stele.” Egypt and the Levant 28, pp. 357-378.
  16. G. Geeraerts, E. Levy and F. Pluquet, 2017: “Models and Algorithms for Chronology”, in S. Schewe, T. Schneider and J. Wijsen (eds.), Proceedings of The 24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Dagstuhl, pp. 13:1-13:18.
  17. E. Levy, 2017: “A Note on the Geographical Distribution of New Kingdom Egyptian Inscriptions from the Levant.” Journal of Ancient Egyptian Interconnections 14, pp. 14-21
  18. E. Levy and F. Pluquet, 2017: “Computer Experiments on the Khirbet Qeiyafa Ostracon.” Digital Scholarship in the Humanities 32, pp. 816–836.
  19. E. Levy, 2016: “The Mekal stele.” In Daphna Ben-Tor (ed.), Pharaoh in Canaan, The untold story, Jerusalem, pp. 110-111.
  20. E. Levy, 2014: “A Fresh Look at the Baal-Zaphon Stele.” Journal of Egyptian Archaeology 100, pp. 293-309.
  21. J. Cardinal and E. Levy, 2008: “Connected Vertex Covers in Dense Graphs.” Proceedings of The 11th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008), Springer-Verlag, Lecture Notes in Computer Science Vol. 5171, Berlin, pp. 35-48. Journal version in Theoretical Computer Science 411 (2010), pp. 2581-2590.
  22. J. Cardinal, S. Langerman and E. Levy, 2006: “Improved Approximation Ratios for Edge Dominating Set in Dense Graphs.” Proceedings of The Fourth Workshop on Approximation and Online Algorithms (WAOA 2006), Springer-Verlag, Lecture Notes in Computer Science Vol. 4368, Berlin, pp. 108-120. Journal version in Theoretical Computer Science 410 (2009), pp. 949-957.
  23. J. Cardinal, M. Labbé, S. Langerman, E. Levy and H. Mélot, 2005: “A Tight Analysis of the Maximal Matching Heuristic.” Proceedings of The Eleventh International Computing and Combinatorics Conference (COCOON 2005), Springer-Verlag, Lecture Notes in Computer Science Vol. 3595, Berlin, pp. 701-709.
  24. E. Levy, G. Louchard and J. Petit, 2004: “A Distributed Algorithm to Find Hamiltonian Cycles in G(n,p) Random Graphs.” Proceedings of the First Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2004), Springer-Verlag, Lecture Notes in Computer Science Vol. 3405, Berlin, pp. 63-74.