default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuval Efron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c10]Yuval Efron, Shyamal Patel, Cliff Stein:
A Simple Algorithm for Dynamic Carpooling with Recourse. SOSA 2025: 196-201- [i15]Yuval Efron, Ertem Nusret Tas:
Dynamically Available Common Subset. IACR Cryptol. ePrint Arch. 2025: 16 (2025) - 2024
- [i14]Daniel Collins, Yuval Efron, Jovan Komatovic:
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement. CoRR abs/2410.12121 (2024) - [i13]Yuval Efron, Shyamal Patel, Clifford Stein:
A Simple Algorithm for Dynamic Carpooling with Recourse. CoRR abs/2411.07553 (2024) - [i12]Daniel Collins, Yuval Efron, Jovan Komatovic:
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement. IACR Cryptol. ePrint Arch. 2024: 1601 (2024) - [i11]Joseph Bonneau, Benedikt Bünz, Miranda Christ, Yuval Efron:
Good things come to those who wait: Dishonest-Majority Coin-Flipping Requires Delay Functions. IACR Cryptol. ePrint Arch. 2024: 1711 (2024) - [i10]Joseph Bonneau, Benedikt Bünz, Miranda Christ, Yuval Efron:
How Much Public Randomness Do Modern Consensus Protocols Need? IACR Cryptol. ePrint Arch. 2024: 1794 (2024) - 2023
- [i9]John Bostanci
, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian, Henry Yuen:
Unitary Complexity and the Uhlmann Transformation Problem. CoRR abs/2306.13073 (2023) - 2022
- [c9]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut Query Algorithms with Star Contraction. FOCS 2022: 507-518 - [c8]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. FOCS 2022: 1174-1185 - [i8]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut query algorithms with star contraction. CoRR abs/2201.05674 (2022) - [i7]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. CoRR abs/2208.02526 (2022) - 2021
- [c7]Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed weighted min-cut in nearly-optimal time. STOC 2021: 1144-1153 - 2020
- [j1]Lev Yohananov, Yuval Efron, Eitan Yaakobi:
Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs. IEEE Trans. Inf. Theory 66(7): 4089-4103 (2020) - [c6]Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. OPODIS 2020: 30:1-30:17 - [c5]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Brief Announcement: Classification of Distributed Binary Labeling Problems. PODC 2020: 349-351 - [c4]Yuval Efron, Ofer Grossman, Seri Khoury:
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. PODC 2020: 511-520 - [c3]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of Distributed Binary Labeling Problems. DISC 2020: 17:1-17:17 - [i6]Yuval Efron, Ofer Grossman, Seri Khoury:
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. CoRR abs/2003.07427 (2020) - [i5]Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed Weighted Min-Cut in Nearly-Optimal Time. CoRR abs/2004.09129 (2020) - [i4]Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. CoRR abs/2011.05066 (2020)
2010 – 2019
- 2019
- [c2]Lev Yohananov, Yuval Efron, Eitan Yaakobi:
Double and Triple Node-Erasure-Correcting Codes over Graphs. ISIT 2019: 1582-1586 - [c1]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. PODC 2019: 238-247 - [i3]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. CoRR abs/1905.10284 (2019) - [i2]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of distributed binary labeling problems. CoRR abs/1911.13294 (2019) - 2018
- [i1]Lev Yohananov, Yuval Efron, Eitan Yaakobi:
Double and Triple Node-Erasure-Correcting Codes over Graphs. CoRR abs/1812.00485 (2018)
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 2025-03-11 20:02 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:
