


default search action
Ariel Shiftan
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j6]Guy Feigenblat, Ely Porat, Ariel Shiftan:
A Grouping Approach for Succinct Dynamic Dictionary Matching. Algorithmica 77(1): 134-150 (2017) - [j5]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching. Algorithmica 77(1): 151 (2017) - [j4]Guy Feigenblat, Ely Porat, Ariel Shiftan:
d-k-min-wise independent family of hash functions. J. Comput. Syst. Sci. 84: 171-184 (2017) - 2016
- [j3]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747]. Inf. Comput. 251: 361 (2016) - [j2]Ariel Shiftan, Ely Porat:
Set Intersection and Sequence Matching with mismatch counting. Theor. Comput. Sci. 638: 3-10 (2016) - [c5]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Linear Time Succinct Indexable Dictionary Construction with Applications. DCC 2016: 13-22 - 2014
- [c4]Guy Feigenblat, Ely Porat, Ariel Shiftan:
An Improved Query Time for Succinct Dynamic Dictionary Matching. CPM 2014: 120-129 - 2012
- [c3]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Exponential Space Improvement for minwise Based Algorithms. FSTTCS 2012: 70-85 - 2011
- [j1]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Exponential time improvement for min-wise based algorithms. Inf. Comput. 209(4): 737-747 (2011) - [c2]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Exponential Time Improvement for min-wise Based Algorithms. SODA 2011: 57-66 - [i1]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Even Better Framework for min-wise Based Algorithms. CoRR abs/1102.3537 (2011)
2000 – 2009
- 2009
- [c1]Ariel Shiftan, Ely Porat:
Set Intersection and Sequence Matching. SPIRE 2009: 285-294

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 2025-01-09 13:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint