Haifa Theory Seminar

The Haifa Theory Seminar is a seminar (accompanied by light lunch) held at the  Department of Computer Science at the University of Haifa in which speakers from the University of Haifa and other universities in Israel and abroad present recent results in theoretical computer science. Faculty, postdocs, graduate and undergraduate students interested in theory of computing are all invited.

Meeting time: Tuesdays 12:00-13:00 PM (Lunch starts on 11:45 AM) 

Location: University of Haifa city campus, Hanamal 65 St.,  Amir Building, Seminar Room 413

Schedule appears below (click on the event for title and abstract),  link to Google Calander.

If you would like to join the seminar's mailing list or give a talk at the seminar, please contact Michal Dory.

Schedule - Winter 2025/2026

• 28.10 - Justin Oh (University of Haifa) - Extractors for Samplable Distributions from the Two-Source Extractor Recipe

• 4.11 - Idan Mehalel (Hebrew University) - A Tight Lower Bound for Non-stochatic Multi-armed Bandits with Expert Advice

• 11.11 - Daniel Prigan (Reichman University)

• 18.11 - Tomer Even (Technion)

• 25.11 - Roni Con (Technion)

• 2.12 - Ronen Shaltiel (University of Haifa)

• 6.1 - Omrit Filtser (Open University)

• 20.1 - Mor Weiss (Bar-Ilan University)

Previous Talks:

Spring 2025

• 18.3 - Tal Roth (Tel Aviv University) - The Impact of Input Correlation on the Communication Complexity of Disjointness and Intersection

• 25.3 - Manor Mendel (Open University) - Deterministic Approximators for the Average Distance in Subsets of Regular Graphs

• 1.4 - Yaseen Abd-Elhaleem (University of Haifa) - Distributed Maximum Flow in Planar Graphs

• 22.4 - Nathan Wallheimer (Weizmann) - Recognizing Sumsets is NP-Complete

• 6.5 - Noor Athamnah (Technion) - Rate-1 Zero-Knowledge Proofs from One-Way Functions

• 13.5 - Talya Eden (Bar-Ilan University) - Approximately counting and sampling Hamiltonian motifs in sublinear-time

• 20.5 - Jonathan Mosheiff (Ben-Gurion University) - A Local Theory of Codes

• 27.5 - Or Zamir (Tel Aviv University) - Optimality of Frequency Moment Estimation

• 3.6 - Tal Herman (Weizmann) -  Interactive Proofs for Distribution Properties

• 10.6 - Dana Moshkovitz (UT Austin) - Coding Theory in Almost-Linear Time and Sub-Linear Space

• 1.7 - Arnold Filtser (Bar-Ilan University) - How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs

Winter 2024/2025

• 10.12 - Moran Feldman (University of Haifa) - Constrained Submodular Maximization via New Bounds for DR-Submodular Functions

• 17.12 - Omri Ben-Eliezer (Technion) - Approximate counting of permutation patterns

• 24.12 - Amit Levi (University of Haifa) - Testing vs Estimation for Index-Invariant Properties in the Huge Object Model

• 31.12 - Asaf Petruschka (Weizmann) - Color Fault-Tolerant Spanners

• 14.1 - Shiri Ron (Weizmann) - Revisiting Combinatorial Auctions: Navigating a Hierarchy of "Truthfulness" Notions

• 21.1 - Shay Solomon (Tel Aviv University) - Vizing's Theorem in Near-Linear Time

Spring 2024

• 5.3 - David Wajc (Technion) - Online Edge Coloring

• 12.3 - Or Meir (University of Haifa) - Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition 

• 30.4 - Tomer Adar (Technion) - Refining the adaptivity notion in the Huge Object model 

• 7.5 - Ronen Shaltiel (University of Haifa) - Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions 

• 21.5 - S. Venkitesh (University of Haifa) - On List Decoding Random Polynomial Codes with Optimal List Size

• 28.5 - Amir Abboud (Weizmann) - Hardness of Approximation in P via Short Cycle Removal

• 4.6 - Uriya First (University of Haifa) - Sheaves on Posets and Locally Testable Codes

• 3.7 - Samah Ghazawi (University of Haifa) - Optimal bounds for the number of quartics in 2D strings

• 9.7 - Yahel Manor (University of Haifa) - Lifting theorem for information complexity

• 16.7 - Ilan Newman (University of Haifa)