Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. - Dana Ron; Gilad Tsur (CIAC, 2010)

Tight Approximation of Image Matching - Simon Korman; Daniel Reichman 001; Gilad Tsur (CoRR, 2011)

On Approximating the Number of Relevant Variables in a Function. - Dana Ron; Gilad Tsur (Electron. Colloquium Comput. Complex., 2011)

Testing computability by width-two OBDDs. - Dana Ron; Gilad Tsur (Theor. Comput. Sci., 2012)

Acquaintance Time of a Graph. - Itai Benjamini; Igor Shinkar; Gilad Tsur (SIAM J. Discret. Math., 2014)

Testing Properties of Sparse Images. - Dana Ron; Gilad Tsur (ACM Trans. Algorithms, 2014)

One Query, Many Clicks: Analysis of Queries with Multiple Clicks by the Same User. - Elad Kravi; Ido Guy; Avihai Mejer; David Carmel; Yoelle Maarek; Dan Pelleg; Gilad Tsur (CIKM, 2016)

Identifying Web Queries with Question Intent. - Gilad Tsur; Yuval Pinter; Idan Szpektor; David Carmel (WWW, 2016)

The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. - Dana Ron; Gilad Tsur (ACM Trans. Comput. Theory, 2016)

Fast-Match: Fast Affine Template Matching. - Simon Korman; Daniel Reichman 001; Gilad Tsur; Shai Avidan (Int. J. Comput. Vis., 2017)