Yuval Efron

Orcid: 0000-0003-0882-9342

According to our database1, Yuval Efron authored at least 11 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Unitary Complexity and the Uhlmann Transformation Problem.
CoRR, 2023

2022
Nearly Optimal Communication and Query Complexity of Bipartite Matching.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Cut Query Algorithms with Star Contraction.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Distributed weighted min-cut in nearly-optimal time.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020
Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs.
IEEE Trans. Inf. Theory, 2020

Classification of Distributed Binary Labeling Problems.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Brief Announcement: Classification of Distributed Binary Labeling Problems.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed Distance Approximation.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

2019
Hardness of Distributed Optimization.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Double and Triple Node-Erasure-Correcting Codes over Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019


  Loading...