default search action
Victor I. Kolobov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Ethan Heilman, Victor I. Kolobov, Avihu M. Levy, Andrew Poelstra:
ColliderScript: Covenants in Bitcoin via 160-bit hash collisions. IACR Cryptol. ePrint Arch. 2024: 1802 (2024) - 2023
- [i7]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Information-Theoretic Distributed Point Functions. IACR Cryptol. ePrint Arch. 2023: 28 (2023) - 2022
- [j2]Victor I. Kolobov, Simeon Reich, Rafal Zalas
:
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems. Math. Program. 194(1): 1163-1183 (2022) - [c6]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Information-Theoretic Distributed Point Functions. ITC 2022: 17:1-17:14 - [c5]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Programmable Distributed Point Functions. CRYPTO (4) 2022: 121-151 - [c4]Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, Mary Wootters:
On the Download Rate of Homomorphic Secret Sharing. ITCS 2022: 71:1-71:22 - [i6]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Programmable Distributed Point Functions. IACR Cryptol. ePrint Arch. 2022: 1060 (2022) - 2021
- [c3]Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman:
Finding Subgraphs in Highly Dynamic Networks. SPAA 2021: 140-150 - [i5]Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, Mary Wootters:
On the Download Rate of Homomorphic Secret Sharing. CoRR abs/2111.10126 (2021) - [i4]Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, Mary Wootters:
On the Download Rate of Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 1532 (2021) - 2020
- [c2]Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz
Fast Deterministic Algorithms for Highly-Dynamic Networks. OPODIS 2020: 28:1-28:16 - [c1]Matthew M. Hong
On Computational Shortcuts for Information-Theoretic PIR. TCC (1) 2020: 504-534 - [i3]Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman:
Finding Subgraphs in Highly Dynamic Networks. CoRR abs/2009.08208 (2020) - [i2]Matthew M. Hong, Yuval Ishai, Victor I. Kolobov, Russell W. F. Lai:
On Computational Shortcuts for Information-Theoretic PIR. IACR Cryptol. ePrint Arch. 2020: 1429 (2020)
2010 – 2019
- 2019
- [i1]Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman:
Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. CoRR abs/1901.04008 (2019) - 2017
- [j1]Victor I. Kolobov, Simeon Reich, Rafal Zalas:
Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm. SIAM J. Optim. 27(3): 1431-1458 (2017)
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-12-12 20:59 CET 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: