![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Michael Hirsch 0002
Person information
- affiliation: IBM-Diligent, Tel Aviv, Israel
Other persons with the same name
- Michael Hirsch — disambiguation page
- Michael Hirsch 0001 — Max Planck Institute for Intelligent Systems, Tübingen, Germany
- Michael Hirsch 0003
— Science and Technology Facilities Council, Swindon, UK (and 2 more)
- Michael Hirsch 0004
— Boston University, MA, USA (and 1 more)
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j5]Michael Hirsch, Shmuel T. Klein
, Dana Shapira
, Yair Toaff:
Dynamic determination of variable sizes of chunks in a deduplication system. Discret. Appl. Math. 274: 81-91 (2020)
2010 – 2019
- 2019
- [c6]Yehonatan Dude, Michael Hirsch, Yair Toaff:
A Fast SIMD-Based Chunking Algorithm. Stringology 2019: 84-91 - 2016
- [j4]Lior Aronovich, Ron Asher
, Danny Harnik, Michael Hirsch, Shmuel T. Klein
, Yair Toaff:
Similarity based deduplication with small data chunks. Discret. Appl. Math. 212: 10-22 (2016) - [j3]Michael Hirsch, Ariel Ish-Shalom, Shmuel T. Klein
:
Optimal partitioning of data chunks in deduplication systems. Discret. Appl. Math. 212: 104-114 (2016) - 2015
- [c5]Michael Hirsch, Shmuel Tomi Klein
, Dana Shapira, Yair Toaff:
Controlling the Chunk-Size in Deduplication Systems. Stringology 2015: 78-89 - 2014
- [j2]Michael Hirsch, Shmuel T. Klein
, Yair Toaff:
Improving deduplication techniques by accelerating remainder calculations. Discret. Appl. Math. 163: 307-315 (2014) - [j1]Michael Hirsch, Shmuel Tomi Klein
, Yair Toaff:
Layouts for improved hierarchical parallel computations. J. Discrete Algorithms 28: 23-30 (2014) - 2013
- [c4]Michael Hirsch, Ariel Ish-Shalom, Shmuel Tomi Klein
:
Optimal Partitioning of Data Chunks in Deduplication Systems. Stringology 2013: 128-141 - 2012
- [c3]Lior Aronovich, Ron Asher, Danny Harnik, Michael Hirsch, Shmuel Tomi Klein
, Yair Toaff:
Similarity Based Deduplication with Small Data Chunks. Stringology 2012: 3-17 - 2011
- [c2]Michael Hirsch, Shmuel Tomi Klein
, Yair Toaff:
Improving Deduplication Techniques by Accelerating Remainder Calculations. Stringology 2011: 173-183
2000 – 2009
- 2009
- [c1]Lior Aronovich, Ron Asher, Eitan Bachmat
, Haim Bitner, Michael Hirsch, Shmuel T. Klein
:
The design of a similarity based deduplication system. SYSTOR 2009: 6
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint