default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGilad Tsur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j6]Simon Korman, Daniel Reichman, Gilad Tsur, Shai Avidan:
Fast-Match: Fast Affine Template Matching. Int. J. Comput. Vis. 121(1): 111-125 (2017)- 2016
- [j5]Dana Ron
, Gilad Tsur:
The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. ACM Trans. Comput. Theory 8(4): 15:1-15:19 (2016) - 2014
- [j4]Itai Benjamini, Igor Shinkar, Gilad Tsur:
Acquaintance Time of a Graph. SIAM J. Discret. Math. 28(2): 767-785 (2014) - [j3]Dana Ron, Gilad Tsur:
Testing Properties of Sparse Images. ACM Trans. Algorithms 10(4): 17:1-17:52 (2014) - 2013
- [j2]Dana Ron, Gilad Tsur:
On Approximating the Number of Relevant Variables in a Function. ACM Trans. Comput. Theory 5(2): 7:1-7:19 (2013) - 2012
- [j1]Dana Ron, Gilad Tsur:
Testing computability by width-two OBDDs. Theor. Comput. Sci. 420: 64-79 (2012)
Conference and Workshop Papers
- 2016
- [c7]Elad Kravi, Ido Guy, Avihai Mejer, David Carmel, Yoelle Maarek, Dan Pelleg, Gilad Tsur:
One Query, Many Clicks: Analysis of Queries with Multiple Clicks by the Same User. CIKM 2016: 1423-1432 - [c6]Gilad Tsur, Yuval Pinter, Idan Szpektor, David Carmel:
Identifying Web Queries with Question Intent. WWW 2016: 783-793 - 2013
- [c5]Simon Korman, Daniel Reichman, Gilad Tsur, Shai Avidan:
FasT-Match: Fast Affine Template Matching. CVPR 2013: 2331-2338 - 2011
- [c4]Dana Ron, Gilad Tsur:
On Approximating the Number of Relevant Variables in a Function. APPROX-RANDOM 2011: 676-687 - 2010
- [c3]Dana Ron, Gilad Tsur:
Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. CIAC 2010: 131-142 - [c2]Gilad Tsur, Dana Ron:
Testing Properties of Sparse Images. FOCS 2010: 468-477 - 2009
- [c1]Dana Ron, Gilad Tsur:
Testing Computability by Width Two OBDDs. APPROX-RANDOM 2009: 686-699
Informal and Other Publications
- 2014
- [i5]Dana Ron, Gilad Tsur:
The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. CoRR abs/1404.5568 (2014) - 2013
- [i4]Itai Benjamini, Igor Shinkar, Gilad Tsur:
Acquaintance Time of a Graph. CoRR abs/1302.2787 (2013) - 2011
- [i3]Simon Korman, Daniel Reichman, Gilad Tsur:
Tight Approximation of Image Matching. CoRR abs/1111.1713 (2011) - [i2]Dana Ron, Gilad Tsur:
Testing Computability by Width-Two OBDDs. Electron. Colloquium Comput. Complex. TR11 (2011) - [i1]Dana Ron, Gilad Tsur:
On Approximating the Number of Relevant Variables in a Function. Electron. Colloquium Comput. Complex. TR11 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
