![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Artyom Sharov
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
- [j5]Artyom Sharov
, Ron M. Roth
:
On the Capacity of Generalized Ising Channels. IEEE Trans. Inf. Theory 63(4): 2338-2356 (2017) - 2015
- [j4]Artyom Sharov, Alexander Shraer, Arif Merchant
, Murray Stokely:
Take me to your leader! Online Optimization of Distributed Storage Configurations. Proc. VLDB Endow. 8(12): 1490-1501 (2015) - [j3]Artyom Sharov, Ron M. Roth:
New Bounds and Constructions for Granular Media Coding. IEEE Trans. Inf. Theory 61(8): 4227-4238 (2015) - 2014
- [j2]Artyom Sharov, Ron M. Roth:
Bounds and Constructions for Granular Media Coding. IEEE Trans. Inf. Theory 60(4): 2010-2027 (2014) - 2010
- [j1]Artyom Sharov, Ron M. Roth:
Two-dimensional constrained coding based on tiling. IEEE Trans. Inf. Theory 56(4): 1800-1807 (2010)
Conference and Workshop Papers
- 2015
- [c12]Artyom Sharov, Alexander Shraer, Arif Merchant
, Murray Stokely:
Automatic Reconfiguration of Distributed Storage. ICAC 2015: 133-134 - [c11]Artyom Sharov, Ron M. Roth:
On the capacity of generalized Ising channels. ISIT 2015: 2256-2260 - 2014
- [c10]Artyom Sharov, Ron M. Roth:
New upper bounds for grain-correcting and grain-detecting codes. ISIT 2014: 1121-1125 - [c9]Edward Bortnikov, Eshcar Hillel, Artyom Sharov:
Reconciling Transactional and Non-Transactional Operations in Distributed Key-Value Stores. SYSTOR 2014: 10:1-10:10 - 2013
- [c8]Artyom Sharov, Ron M. Roth:
Improved bounds and constructions for granular media coding. Allerton 2013: 637-644 - 2012
- [c7]Orna Agmon Ben-Yehuda, Assaf Schuster, Artyom Sharov, Mark Silberstein, Alexandru Iosup
:
ExPERT: Pareto-Efficient Task Replication on Grids and a Cloud. IPDPS 2012: 167-178 - [c6]Ido Tal, Artyom Sharov, Alexander Vardy
:
Constructing polar codes for non-binary alphabets and MACs. ISIT 2012: 2132-2136 - 2011
- [c5]Artyom Sharov, Ron M. Roth:
Bounds and constructions for granular media coding. ISIT 2011: 2343-2347 - 2010
- [c4]Artyom Sharov, Ron M. Roth:
Fixed-rate tiling encoders for 2-D constraints. ISIT 2010: 1208-1212 - 2009
- [c3]Mark Silberstein, Artyom Sharov, Dan Geiger, Assaf Schuster:
GridBot: execution of bags of tasks in multiple grids. SC 2009 - 2008
- [c2]Artyom Sharov, Ron M. Roth:
Two-dimensional constrained coding based on tiling. ISIT 2008: 1468-1472 - 2006
- [c1]Mark Silberstein, Gabriel Kliot, Artyom Sharov, Assaf Schuster, Miron Livny:
Materializing Highly Available Grids. HPDC 2006: 321-323
Coauthor Index
![](https://dblp.dagstuhl.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-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint