جست‌وجوی استاد و پژوهشگر

Danny Dolevمشاهده پروفایل

استاد

• Distributed Computing
• Fault-Tolerant Systems
• Algorithms
• +۴ مورد دیگر

Prof. Danny Dolev is a distinguished academic holding the Berthold Badler Chair in Computer Science at The Hebrew University of Jerusalem's Rachel and Selim Benin School of Computer Science and Engineering. He is an ACM Fellow and IEEE Fellow. His research focuses on distributed computing, fault-tolerant systems, algorithms, and secure protocols. He has held leadership roles, including Director of his school (1999–2002) and Chair of the Israeli National Committee for Information Technology (1994–1998). Education: B.Sc., The Hebrew University of Jerusalem, 1971 M.Sc., Weizmann Institute of Science, 1973 PhD., Weizmann Institute of Science, 1979 Research Interests: Danny Dolev's work spans distributed algorithms, Byzantine fault tolerance, consensus protocols, and hardware algorithms. His contributions include groundbreaking research on self-stabilizing systems, secure communication, and fault-tolerant clock synchronization. His HEX and Chronos protocols exemplify innovations in scalable synchronization and network security. Publications: His recent work emphasizes Byzantine agreement, asynchronous fault tolerance, and game-theoretic distributed systems. Key papers address optimal resilience in consensus algorithms and secure multi-party computation. Awards: ACM Fellow (2010) IEEE Fellow (2004) Grants & Leadership: Member of the Scientific Council, European Research Council (2010–2014) Chair of Israel's National Committee for Information Technology (1994–1998) Leadership roles at IBM Almaden Research Center (1987–1993) and Stanford University (1979–1981) Labs & Teams: His research group at Hebrew University focuses on distributed systems, with collaborations on projects like Steward (wide-area Byzantine replication) and Self-Stabilizing Circuits .

Ariel Poratمشاهده پروفایل

استاد

• Torts
• Contract Law
• Economic Analysis of Law
• +۳ مورد دیگر

Prof. Ariel Porat is the Alain Poher Professor of Law and current President of Tel Aviv University (2019-present). He holds the Alain Poher Chair in Private Law at the Buchmann Faculty of Law and has served as Dean (2002-2006) and Director of the Cegla Center for Interdisciplinary Research of the Law (1997-2002). He is a member of the Israel Academy of Sciences and Humanities and the American Law Institute, with visiting professorships at the University of Chicago (2003-2019), Stanford, Columbia, NYU, Berkeley, Virginia, and Toronto. LL.B. (magna cum laude), Tel Aviv University (1983) J.S.D., Tel Aviv University (1989) Post-Doctoral Studies, Yale Law School (1990) His research focuses on torts , contract law , and remedies , with recent contributions to personalized law and legal robotics . His work explores the intersection of law and economics , particularly in harm-benefit interactions , disgorgement damages , and private law restoration . His 15 most recent publications (2020-2012) examine topics spanning contractual disclosures , discriminatory government liability , free speech , and empirical legal studies . Themes include economic analysis , legal precision , and data-driven law . EMET Prize (2014) European Law and Economics Association Lifetime Award (2020) Zeltner Prize for Academic Excellence (2012) Chesin Prize (2010) Zusman Prize for Junior Faculty (1991) Prof. Porat has collaborated extensively with scholars like Omri Ben-Shahar, Robert Cooter, and Alex Stein. He founded the journal Theoretical Inquiries in Law and co-authored influential books on personalized legal systems and incentive design .

Oren Weimannمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Data Structures
• +۹ مورد دیگر

Oren Weimann is a Professor in the Department of Computer Science at the University of Haifa, Faculty of Natural Sciences. His research lies at the intersection of theoretical computer science, algorithm design, and data structures, with a strong focus on planar graphs, combinatorial pattern matching, and fine-grained complexity. He has published extensively in top-tier venues such as STOC, SODA, ICALP, PODC, and ESA. Education: Ph.D., Massachusetts Institute of Technology (MIT), 2005–2009. Advisor: Erik Demaine. Dissertation: "Accelerating Dynamic Programming" Postdoc, Weizmann Institute of Science, 2009–2011. Host: David Peleg M.Sc., University of Haifa, 2004–2005. Advisor: Gad Landau. Dissertation: "Using PQ trees for Comparative Genomics" B.A., Technion – Israel Institute of Technology, 1999–2002 Oren Weimann's research centers on the design and analysis of efficient algorithms, particularly for planar and structured graphs. His work explores fundamental problems such as shortest paths, distance oracles, fault tolerance, edit distance, and pattern matching. He investigates both upper and lower bounds, often pushing the limits of what is computationally feasible under fine-grained complexity assumptions. His contributions include optimal labeling schemes, compressed data structures, and breakthroughs in dynamic and distributed graph algorithms. His recent publications reveal a consistent trend in developing highly efficient algorithms for planar graphs, with a focus on distance computation, fault tolerance, and compression. Keywords across these works include planar graphs, dynamic programming, string matching, and conditional lower bounds, reflecting a deep integration of algorithmic techniques and complexity theory. He frequently collaborates with leading researchers such as Shay Mozes, Paweł Gawrychowski, and Philip Bille. Scientific Awards: Best Paper Award, CPM 2007 Best Paper Award, ICALP 2020 (mentioned in context of work) Oren Weimann has advised numerous PhD and Master’s students, including Yaseen Abd-Elhaleem, Nathan Wallheimer, Aviv Bar-natan, and Shon Feller, whose dissertations have led to publications in major conferences. He has also mentored several postdoctoral researchers such as Shay Golan, Itai Boneh, and Panagiotis Charalampopoulos. His work has been supported by competitive research grants, though specific grant titles are not listed in the text. He has served on the program committees of key conferences including SODA, ICALP, CPM, ESA, and SPIRE, demonstrating active leadership in the theoretical computer science community. He is associated with a vibrant research group focused on algorithms and data structures, likely involving collaboration with students and postdocs on projects related to graph algorithms, string processing, and complexity. While no formal lab name is mentioned, his collaborative output suggests a strong, productive research team at the University of Haifa.

Michael Elkinمشاهده پروفایل

استاد

• Theoretical Computer Science
• Discrete Mathematics
• Graph Algorithms
• +۸ مورد دیگر

Michael Elkin is a Professor in the Department of Computer Science at Ben-Gurion University of the Negev, Israel. His research focuses on Theoretical Computer Science, Discrete Mathematics, and Algorithms, with specializations in graph algorithms, distributed computing, and metric embeddings. He has held editorial roles, including Associate Editor of the Journal of Computer and System Sciences, and has contributed to numerous program committees for top conferences like FOCS and SODA. Elkin's research interests include low-distortion embeddings, streaming and dynamic graph algorithms, and approximation algorithms. His work bridges distributed and centralized algorithm design, with applications in network optimization and computational geometry. Recent trends in his publications emphasize efficient spanner constructions, symmetry-breaking in distributed systems, and algorithmic approaches to graph coloring and metric spaces. Elkin has advised multiple PhD and Master’s students, including Leonid Barenboim (winner of the 2015 Distributed Computing Doctoral Dissertation Award) and Shay Solomon. He has been awarded Best Paper and Best Student Paper awards at PODC conferences for groundbreaking contributions to distributed algorithms. Additionally, he leads a postdoctoral research group focusing on graph algorithms and metric embeddings, collaborating with Eden Chlamtac and Ofer Neiman. Teaching highlights include courses on Distributed Algorithms, Design of Algorithms, and Metric Graph Algorithms. His academic service includes organizing academic programs and mentoring early-career researchers in theoretical computer science.

• Ecology
• Community Ecology
• Biodiversity
• +۳ مورد دیگر

Dr. Michael Kalyuzhny is a Senior Lecturer and Principal Investigator at the Hebrew University of Jerusalem's Department of Ecology, Evolution and Behavior. His research focuses on understanding ecological community dynamics, species coexistence mechanisms, and the application of data science to ecological systems. He won the prestigious Alon Fellowship in 2024. Education: BSc in Biology, Hebrew University MSc and PhD in Ecology, Evolution & Behavior, Hebrew University Postdoctoral research at the University of Michigan and University of Texas at Austin Research Interests: Exploring how ecological communities maintain high biodiversity, spatial and temporal dynamics of species, and the integration of theoretical models with large-scale datasets. Current projects include studying conspecific negative density dependence in tropical forests and the impact of environmental heterogeneity on biodiversity. Awards: Alon Fellowship (2024) Advising & Grants: Supervising MSc student Yuval Neumann, investigating disturbance effects on plant community diversity. Active in securing grants for theoretical ecology and field experiments. Labs & Teams: Leads the Kalyuzhny Lab, which combines theoretical ecology with empirical studies to address fundamental questions in community assembly and biodiversity maintenance.

Shay Moranمشاهده پروفایل

دانشیار

• Machine Learning Theory
• Computational Learning Theory
• Statistical Learning Theory
• +۷ مورد دیگر

Shay Moran is an Associate Professor at the Faculty of Mathematics , Technion - Israel Institute of Technology, with affiliations to the Faculties of Computer Science and Data and Decision Sciences . They are also affiliated with Google Research in Tel Aviv . Shay's research interests center on mathematical problems inspired by learning theory and computer science , particularly in areas like machine learning theory, differential privacy, algorithmic stability, and online learning . Their work bridges abstract mathematics with practical algorithm design. Recent publications highlight trends in reductions between learning models, geometric interpretations of learning problems, and privacy-preserving algorithms . Key themes include sample compression, PAC learnability, boosting mechanisms, and adversarial robustness . Best Paper Runner-up , COLT 2021 Best Paper Award , COLT 2020 Final Award for Outstanding Paper in Machine Learning Shay has supervised numerous PhD and Master's students, including Vanessa Kosoy, Liza Nesterova, Hilla Schefler, Alexander Shlimovich, Tom Waknine , and Iska Tsubari . Former advisees include Idan Mehalel (PhD, co-advised with Yuval Filmus) and Zachary Chase (Postdoc) .

Dan Garberمشاهده پروفایل

دانشیار

• Machine Learning
• Continuous Optimization
• Large-Scale Data Analysis
• +۲ مورد دیگر

Dan Garber is an Associate Professor at the Faculty of Data and Decision Sciences at the Technion - Israel Institute of Technology. He joined the faculty in 2017 after completing his Ph.D. at the Technion (2015) and a year as a Research Assistant Professor at Toyota Technological Institute in Chicago (2016). His research bridges machine learning, continuous optimization, and algorithm design, focusing on developing efficient methods for high-dimensional optimization with applications in data science and machine learning. Education: B.Sc. in Computer Engineering (2010), Technion M.Sc. in Computer Science (2012), Technion Ph.D. in Computer Science (2015), Technion Garber leads the Technion Optimization Lab (TOL) , which specializes in foundational research on continuous optimization methodologies and their applications in engineering, medicine, and industry. His work emphasizes theoretical guarantees for scalable algorithms, including those used in large-scale data analysis and sequential decision-making systems. Funding & Awards: Israel Science Foundation grants (2018-2022, 2022-2026, ~$250,000 each) ERC Consolidator Grant (2025-2030, ~1.785M Euro) Best Student Paper Award at COLT Conference (2022) with Ben Kretzu Garber supervises graduate students in optimization and machine learning, including M.Sc. and Ph.D. candidates. His laboratory supports research projects and disseminates advancements through workshops, schools, and seminars. Contact: dangar@technion.ac.il | Office: Bloomfield 406

Alon Zaslaverمشاهده پروفایل

استاد

• Systems Biology
• Neurogenetics
• Neural Circuits
• +۵ مورد دیگر

Prof. Alon Zaslaver is a Professor in the Department of Genetics at the Hebrew University of Jerusalem's Institute of Life Sciences. He leads the Zaslab, an interdisciplinary Systems Biology lab combining molecular genetics, computational modeling, and neurobiology. His work focuses on understanding neural circuits and gene networks in C. elegans, particularly in learning/memory mechanisms and sensory processing. Research Interests: Computation in neural circuits with single-neuron resolution Plasticity in neural networks (aging, neurodegeneration) Epigenetic memory transmission across generations Evolutionary genomics of transcription networks Neuro-developmental disorders modeling Gut-brain axis signaling Awards & Grants: ERC Starting Grant 2013: 'Design Principles in Encoding Complex Noisy Environments' Farkas-Himsley 2016 Award for Young Researchers Lab Team: PhD students: Eddie Bokman (computational biology), Yuval Balshayi (physics-based modeling) MSc students: Neta Barlam (neurodevelopmental disorders), Omri Babay (memory mechanisms) Alumni: Dr. Rotem Ruach (data scientist at Prospera Technologies)

Renana Keydarمشاهده پروفایل

دانشیار

• Digital Humanities
• Computational Text Analysis
• Holocaust Studies
• +۵ مورد دیگر

Dr. Renana Keydar is an Associate Professor of Law and Digital Humanities at The Hebrew University of Jerusalem, where she serves as Academic Director of the Center for Digital Humanities (DH@HU) and heads the Alfred Landecker Lab for Computational Analysis of Holocaust Testimonies. She holds additional affiliations as a 2024-25 Fellow at Brandeis University's Institute for Advanced Israel Studies and is a core member of Edut 710, Israel's largest civil initiative documenting survivor testimonies of the October 7, 2023 attacks. Her academic credentials include a PhD in Comparative Literature from Stanford University (2015), and magna cum laude degrees in Law and Political Science from Tel Aviv University (2003). Prior to academia, she served as an advocate in Israel's State Attorney's Office - High Court of Justice Department. Keydar's pioneering research bridges computational methods with humanities scholarship, focusing on: Developing AI models for analyzing mass atrocity testimonies using NLP and machine learning Creating trauma-informed digital archives for Holocaust and contemporary crisis documentation Computational analysis of legal narratives in human rights law and international courts Ethical frameworks for applying AI to sensitive historical materials Her scholarly output demonstrates consistent focus on computational jurisprudence, with recent works examining algorithmic analysis of UN human rights recommendations, judicial attitudes toward sexual violence victims, and computational models for Holocaust testimony. Keydar has received the prestigious Alon Fellowship for outstanding young researchers and leads multiple major initiatives: Designing Edut 710's AI-powered testimony platform documenting 1,600+ accounts from October 7 attacks Developing 'distant listening' computational methods for Holocaust testimonies Directing the Future of the Past research group funded by Israel's Ministry of Science

• Coding Theory
• Complexity Theory
• Algorithms
• +۳ مورد دیگر

Noga Ron-Zewi is an Associate Professor in the Department of Computer Science at the University of Haifa, where she conducts research at the intersection of coding theory, complexity theory, and algorithms. She previously served as a faculty member at Ben-Gurion University and held a joint IAS-DIMACS postdoctoral fellowship at the Institute for Advanced Study (Princeton) and the Center for Discrete Mathematics and Theoretical Computer Science (Rutgers). Her research focuses on the theoretical foundations of computer science, particularly in the design and analysis of error-correcting codes and their applications to computation. She is currently leading an ERC-funded project that explores the deep connections between coding theory and computational complexity, aiming to develop new algorithmic techniques and theoretical frameworks. Noga Ron-Zewi earned her Ph.D. from the Department of Computer Science at the Technion – Israel Institute of Technology in 2014 under the supervision of Prof. Eli Ben-Sasson. She is actively recruiting graduate students and postdoctoral researchers to join her team at the University of Haifa, with funding available for both local and remote participation in her ERC project. She is currently leading the ERC Project on Error-correcting Codes and Computation, which supports graduate students and postdocs interested in this interdisciplinary area. Prospective researchers are encouraged to contact her directly for collaboration and funding opportunities. Her work is supported by the European Research Council (ERC), enabling cutting-edge research in theoretical computer science and fostering international collaborations.

Erez Petrankمشاهده پروفایل

استاد

• Concurrent Computing
• Programming Languages
• Memory Management
• +۵ مورد دیگر

Erez Petrank is a Professor at the Department of Computer Science , Technion - Israel Institute of Technology , where he holds the Andrew and Erna Viterbi Chair. His research focuses on concurrent computing , programming languages , and systems with an emphasis on memory management . Additional interests include parallelism , cryptography , data structures , approximation algorithms , and distributed computing . Research Trends Recent publications highlight his work on safe memory reclamation (ERA Theorem, VBR), lock-free data structures (queues, stacks, B+ Trees), and persistent memory algorithms (NVTraverse, Mirror). These works span concurrent computing , distributed systems , and memory efficiency in multi-threaded environments. Scientific Awards Distinguished Paper Award at Euro-Par 2015 Contact Information Email: erez@cs.technion.ac.il Office: Taub 528, Technion Phone: +972-73-378-4942

Oren Tsurمشاهده پروفایل

استادیار

• Computational Linguistics
• Natural Language Processing
• Social Network Analysis
• +۷ مورد دیگر

Oren Tsur is an Assistant Professor in the Department of Software & Information Systems Engineering (SISE) at Ben Gurion University of the Negev, where he heads the NLP and Social Dynamics Lab (NAS-LAB) and directs the Center for the Study of Digital Politics and Strategy (DPS@BGU). He joined the university in September 2017 and teaches core courses including Natural Language Processing, Social Network Analysis, and Introduction to NLP at both undergraduate and graduate levels. His research focuses on computational modeling of social dynamics through language and network analysis. Key interests include social contagion, language evolution, political network analysis, and sentiment analysis. He employs methodologies from exponential random graph models (ERGM), machine learning, and natural language processing to study how language shapes and is shaped by social interactions, particularly in political contexts and online communities. His publication trends reveal strong interdisciplinary work spanning computational linguistics, political science, and social network analysis. Recent research emphasizes hate speech detection in platforms like Parler, suicide risk identification in counseling services, and modeling semantic drift in emoji usage. His work consistently bridges technical NLP innovations with real-world social applications, particularly in political discourse and community dynamics. NSF Political Network Fellowship (2014, 2015, 2016) TIME Magazine's 50 Best Inventions of 2010 for sarcasm detection research Work featured in Science Magazine, BBC, The Atlantic, CNET, and Politico Best Paper award at HICSS 2020 Tsur actively mentors prospective students through his lab, emphasizing excellence in candidates through academic transcripts and research interest statements. His grants include multiple NSF Political Network Fellowships supporting computational social science research. He serves as Director of BGU's Cyber Politics and Policy Research Center and organizes major NLP workshops including the Natural Language Processing and Computational Social Science series at top conferences. His NAS-LAB focuses on data-driven modeling of social coordination and influence, with applications in sentiment analysis, dialogue systems, and digital forensics. The lab maintains strong industry connections through past collaborations with IBM Research (Watson Debater project), Yahoo! Research, and startup consulting.

• Combinatorics
• Theory of Algorithms
• Geometry
• +۵ مورد دیگر

Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at The Hebrew University of Jerusalem, where he has maintained a distinguished academic career spanning several decades. His research bridges multiple mathematical disciplines with theoretical computer science. Linial's primary research interests encompass Combinatorics, Theory of Algorithms, Geometry, Analysis, and Computational Molecular Biology . His work often explores the deep connections between discrete mathematics and computer science, particularly focusing on high-dimensional combinatorial structures, metric embeddings, and their algorithmic applications. His publication record demonstrates consistent contributions across decades, with recent work focusing on high-dimensional permutations, simplicial complexes, graph theory, and coding theory. Linial has developed significant theoretical frameworks for understanding complex combinatorial structures and their geometric representations. Among his notable achievements is being named an AMS Fellow and receiving the 2008 Conant Prize for the influential survey paper "Expander graphs and their applications" co-authored with S. Hoory and A. Wigderson. His research has shaped multiple areas of theoretical computer science and discrete mathematics. Linial has served on the editorial boards of prestigious journals including Israel Journal of Mathematics (where he was Chief Editor 2013-2017), Random Structures and Algorithms , and Combinatorica . He has supervised numerous students throughout his career and maintains active research collaborations worldwide.

Ely Poratمشاهده پروفایل

دانشیار

• Algorithms
• Data Structures
• Streaming Algorithms
• +۵ مورد دیگر

Ely Porat is an Associate Professor at the Department of Computer Science, Bar-Ilan University, where he has been since 2000. He holds visiting professorships at the University of Michigan and Tel Aviv University, and has worked at Google (Mountain View in 2007 and Tel Aviv in 2011). His academic contributions include redefining the BSc degree in Computer Science at Bar-Ilan University and significant involvement in teaching committees. Research Interests: Algorithms and Data Structures Streaming Algorithms Pattern Matching Coding Theory Compressed Sensing His work focuses on advancing efficient algorithms for data processing, with applications in information retrieval, signal processing, and bioinformatics. He has organized multiple conferences including Stringology (2009–2011), ICALP2011GT, and UM Coding. He has served on program committees for CPM, SPIRE, and ESA. Advising & Collaboration: Current advisees include Ariel Shiftan, Guy Feigenblat, and others. Former students include Ohad Lipsky and Klim Efremenko. He hosts short-term researchers from abroad and collaborates with institutions like Google and Weizmann Institute. Publications span FOCS , STOC , ICALP , and other top venues, emphasizing theoretical foundations and practical algorithmic solutions.

Amihood Amirمشاهده پروفایل

استاد

• Algorithms Design and Analysis
• Multidimensional Pattern Matching
• Knowledge Discovery Algorithms
• +۳ مورد دیگر

Amihood Amir is a Professor of Computer Science at the Department of Computer Science within the Faculty of Exact Sciences at Bar-Ilan University, Israel. His research focuses on algorithm design, pattern matching, knowledge discovery, real-time systems, and computational biology. He has served on program committees for conferences including STOC, CPM, WABI, and SPIRE, among others. Education: No explicit educational details provided in the text. His research interests emphasize advanced algorithmic techniques with applications in multidimensional pattern matching and computational biology. He has contributed to knowledge discovery algorithms and real-time system optimizations. Teaching responsibilities include courses such as Pattern Matching Algorithms (CS 663), Algorithms II (89-332), Data Structures (89-120), and Analysis of Algorithms (89-974-01). He has also presented invited addresses at conferences and maintained active participation in academic committees. No specific grants or lab affiliations are detailed in the provided texts.