default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoshe Hershcovitch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Daniel Cohen
, Sarel Cohen, Dalit Naor, Daniel G. Waddington, Moshik Hershcovitch:
Dictionary Based Cache Line Compression. HotStorage 2024- [i8]Moshik Hershcovitch, Leshem Choshen, Andrew Wood, Ilias Enmouri, Peter Chin, Swaminathan Sundararaman, Danny Harnik:
Lossless and Near-Lossless Compression for Foundation Models. CoRR abs/2404.15198 (2024) - 2023
- [j4]Chen Dar, Moshik Hershcovitch, Adam Morrison:
RLS Side Channels: Investigating Leakage of Row-Level Security Protected Data Through Query Execution Time. Proc. ACM Manag. Data 1(1): 89:1-89:25 (2023) - [c17]Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney:
Fast Feature Selection with Fairness Constraints. AISTATS 2023: 7800-7823 - [c16]Daniel Cohen, Sarel Cohen, Dalit Naor, Daniel G. Waddington, Moshik Hershcovitch:
Cache Line Deltas Compression. SYSTOR 2023: 145 - [c15]Adi Kaufman, Moshik Hershcovitch, Adam Morrison:
Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure. USENIX ATC 2023: 719-733 - [i7]Adi Kafuman, Moshik Hershcovitch, Adam Morrison:
Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version). CoRR abs/2306.04602 (2023) - 2022
- [c14]Daniel G. Waddington, Moshik Hershcovitch, Swaminathan Sundararaman, Clem Dickey:
A case for using cache line deltas for high frequency VM snapshotting. SoCC 2022: 526-539 - [c13]Moshik Hershcovitch, Artem Khyzha, Daniel G. Waddington, Adam Morrison:
Elastic Indexes: Dynamic Space vs. Query Efficiency Tuning for In-Memory Database Indexing. EDBT 2022: 2:312-2:324 - [c12]Andrew Wood, Moshik Hershcovitch, Ilias Ennmouri, Weiyu Zong, Saurav Chennuri, Sarel Cohen, Swaminathan Sundararaman, Daniel G. Waddington, Sang (Peter) Chin:
Towards Fast Crash-Consistent Cluster Checkpointing. HPEC 2022: 1-8 - [c11]Ryan Yu, Andrew Wood, Sarel Cohen, Moshik Hershcovitch, Daniel G. Waddington, Peter Chin:
Biologically Plausible Complex-Valued Neural Networks and Model Optimization. AIAI (1) 2022: 369-382 - [c10]Oz Anani, Gal Lushi, Moshik Hershcovitch, Adam Morrison:
Evaluating compressed indexes in DBMS. SYSTOR 2022: 149 - [c9]Omri Arad, Yoav Ben Shimon, Ron Zadicario, Daniel G. Waddington, Moshik Hershcovitch, Adam Morrison:
System-level crash safe sorting on persistent memory. SYSTOR 2022: 151 - [i6]Andrew Wood, Moshik Hershcovitch, Daniel G. Waddington, Sarel Cohen, Peter Chin:
Non-Volatile Memory Accelerated Posterior Estimation. CoRR abs/2202.10522 (2022) - [i5]Andrew Wood, Moshik Hershcovitch, Daniel G. Waddington, Sarel Cohen, Meredith Wolf, Hongjun Suh, Weiyu Zong, Peter Chin:
Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis. CoRR abs/2202.11518 (2022) - [i4]Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney:
Fast Feature Selection with Fairness Constraints. CoRR abs/2202.13718 (2022) - 2021
- [c8]Sarel Cohen, Moshik Hershcovitch, Martin Taraz, Otto Kißig, Andrew Wood, Daniel G. Waddington, Peter Chin, Tobias Friedrich:
Drug Repurposing Using Link Prediction on Knowledge Graphs with Applications to Non-volatile Memory. COMPLEX NETWORKS 2021: 742-753 - [c7]Andrew Wood, Moshik Hershcovitch, Daniel G. Waddington, Sarel Cohen, Meredith Wolf, Hongjun Suh, Weiyu Zong, Peter Chin:
Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis. HPEC 2021: 1-7 - [c6]Daniel G. Waddington, Moshik Hershcovitch, Clem Dickey:
PyMM: Heterogeneous Memory Programming for Python Data Science. PLOS@SOSP 2021: 31-37 - [c5]David Ohana, Bruno Wassermann, Moshik Hershcovitch, Elliot K. Kolodner, Michal Malka, Eran Raichstein, Ronen Schaffer, Robert Shahla:
DeCorus-NSA: detection and correlation of unusual signals for network syslog analytics. SYSTOR 2021: 21:1 - [i3]Daniel G. Waddington, Clem Dickey, Moshik Hershcovitch, Sangeetha Seshadri:
An Architecture for Memory Centric Active Storage (MCAS). CoRR abs/2103.00007 (2021) - [i2]Daniel G. Waddington, Clem Dickey, Luna Xu, Moshik Hershcovitch, Sangeetha Seshadri:
A High-Performance Persistent Memory Key-Value Store with Near-Memory Compute. CoRR abs/2104.06225 (2021) - 2020
- [j3]Danny Harnik, Moshik Hershcovitch, Yosef Shatsky, Amir Epstein, Ronen I. Kat:
Sketching Volume Capacities in Deduplicated Storage. ACM Trans. Storage 15(4): 24:1-24:23 (2020)
2010 – 2019
- 2019
- [c4]Danny Harnik, Moshik Hershcovitch, Yosef Shatsky, Amir Epstein, Ronen I. Kat:
Sketching Volume Capacities in Deduplicated Storage. FAST 2019: 107-119 - [e1]Moshik Hershcovitch, Ashvin Goel, Adam Morrison:
Proceedings of the 12th ACM International Conference on Systems and Storage, SYSTOR 2019, Haifa, Israel, June 3-5, 2019. ACM 2019, ISBN 978-1-4503-6749-3 [contents] - 2018
- [c3]Moshik Hershcovitch, Revital Eres, Adam J. McPadden:
PM aware storage engine for MongoDB. SYSTOR 2018: 123 - 2015
- [j2]Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal indices for predecessor search. Inf. Comput. 240: 12-30 (2015) - 2013
- [j1]Moshe Hershcovitch, Haim Kaplan:
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. Algorithmica 65(2): 371-390 (2013) - [c2]Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search - (Extended Abstract). MFCS 2013: 278-289 - [i1]Sarel Cohen, Amos Fiat, Moshe Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search. CoRR abs/1306.3772 (2013)
2000 – 2009
- 2008
- [c1]Moshe Hershcovitch, Haim Kaplan:
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. SWAT 2008: 29-40
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-10-07 22:18 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:
