default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry Sotnikov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Asaf Cassel, Haipeng Luo, Aviv Rosenberg, Dmitry Sotnikov:
Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback. ICML 2024- [i3]Asaf B. Cassel, Haipeng Luo, Aviv Rosenberg, Dmitry Sotnikov:
Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback. CoRR abs/2405.07637 (2024) - 2023
- [c13]Tal Lancewicki, Aviv Rosenberg, Dmitry Sotnikov:
Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback. ICML 2023: 18482-18534 - [i2]Tal Lancewicki, Aviv Rosenberg, Dmitry Sotnikov:
Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback. CoRR abs/2305.07911 (2023)
2010 – 2019
- 2016
- [c12]Danny Harnik, Ety Khaitzin, Dmitry Sotnikov:
When Less is More - Using Restricted Repetition Search in Fast Compressors. DCC 2016: 601 - [c11]Danny Harnik, Ety Khaitzin, Dmitry Sotnikov:
Estimating Unseen Deduplication - from Theory to Practice. FAST 2016: 277-290 - [c10]Amir Epstein, Elliot K. Kolodner, Dmitry Sotnikov:
Network Aware Reliability Analysis for Distributed Storage Systems. SRDS 2016: 249-258 - 2015
- [c9]Raúl Gracia Tinedo, Danny Harnik, Dalit Naor, Dmitry Sotnikov, Sivan Toledo, Aviad Zuck:
SDGen: Mimicking Datasets for Content Generation in Storage Benchmarks. FAST 2015: 317-330 - 2014
- [c8]Danny Harnik, Ety Khaitzin, Dmitry Sotnikov, Shai Taharlev:
A Fast Implementation of Deflate. DCC 2014: 223-232 - [c7]George Goldberg, Danny Harnik, Dmitry Sotnikov:
The case for sampling on very large file systems. MSST 2014: 1-11 - [c6]Aviad Zuck, Sivan Toledo, Dmitry Sotnikov, Danny Harnik:
Compression and SSDs: Where and How? INFLOW 2014 - [c5]Ilias Iliadis
, Dmitry Sotnikov, Paula Ta-Shma, Vinodh Venkatesan:
Reliability of Geo-replicated Cloud Storage Systems. PRDC 2014: 169-179 - 2013
- [j2]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-pairs shortest paths in O(n2) time with high probability. J. ACM 60(4): 26:1-26:25 (2013) - [c4]Danny Harnik, Ronen I. Kat, Oded Margalit, Dmitry Sotnikov, Avishay Traeger:
To Zip or not to Zip: effective resource usage for real-time compression. FAST 2013: 229-242 - 2012
- [c3]Danny Harnik, Oded Margalit, Dalit Naor, Dmitry Sotnikov, Gil Vernik:
Estimation of deduplication ratios in large data sets. MSST 2012: 1-11 - 2011
- [j1]Doron Chen, Ealan Henis, Ronen I. Kat, Dmitry Sotnikov, Cinzia Cappiello, Alexandre Mello Ferreira, Barbara Pernici, Monica Vitali, Tao Jiang, Jia Liu, Alexander Kipp:
Usage centric green performance indicators. SIGMETRICS Perform. Evaluation Rev. 39(3): 92-96 (2011) - [i1]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-Pairs Shortest Paths in O(n2) time with high probability. CoRR abs/1105.3770 (2011) - 2010
- [c2]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-Pairs Shortest Paths in O(n2) Time with High Probability. FOCS 2010: 663-672
2000 – 2009
- 2003
- [c1]Yuri G. Karpov, Dmitry Sotnikov:
Interval Approach to Parallel Timed Systems Verification. PaCT 2003: 100-116
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-09-04 01:20 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:
