Dr. Arnold Filtser
Algorithmic Theory, Metric Spaces, and geometric data summarization
CV
Dr. Filtser is a faculty member in the Department of Computer Science at Bar-Ilan University. He completed his PhD at Ben-Gurion University of the Negev (& Weizmann institute, having two advisors) and conducted postdoctoral research at Columbia University as part of Simons collaboration on algorithms and geometry. His papers have been published in leading theoretical computer science conferences (STOC, FOCS, SODA), and in 2016, he won the Best Student Paper Award at PODC. He leads the department's theory seminar.
Research
Algorithmic Theory, Metric Spaces, and geometric data summarization
Dr. Arnold Filtser’s work stands at the center of theoretical computer science, at the intersection of algorithms, geometry, and graph theory. A central theme in his research is the summarization of geometric data: finding simpler ways to represent large graphs, networks, and distance-based data while preserving the information that matters most. For example, instead of working with a huge and complicated network directly, one may try to build a smaller or cleaner version that still captures the important distances, routes, and connections. This kind of simplification can lead to faster algorithms, better approximations, and a deeper understanding of the structure hidden inside complex data.
Primary Research Areas:
Low-Distortion Metric Embeddings: Mapping data from complex spaces to simpler ones while maintaining the distance between points.
Stochastic Decompositions: Methods for breaking down massive datasets into smaller, manageable sub-structures.
Spanners & Light Networks: Constructing efficient networks that connect points with short paths using minimal connections.
Approximation Algorithms and Computational Geometry: Finding fast, near-optimal solutions to complex geometric problems.
Research Nature:
Theoretical: Filtser’s research is in theoretical computer science, where results are stated as precise theorems with provable guarantees. His work studies algorithms, graphs, distances, and geometric data, asking how complex networks can be simplified while preserving their essential structure. These ideas help build the foundations for faster algorithms and better approximation methods, with impact on network design, routing, clustering, and large-scale data analysis.
Career Path:
Graduates of the lab develop into independent thinkers equipped to rigorously analyze and solve diverse computational challenges. In a rapidly evolving technological landscape, this foundational analytical mindset is highly valued and ensures lifelong professional relevance.
Last Updated Date : 29/07/2026