Treffer 1 - 20
von 3.875.146
A Fast and Practical Sector-Based BFT Consensus With Sublinear Communication Complexity
Xu, H. ; Zhang, C. ; Liu, X. ; et al.
IEEE Transactions on Networking IEEE Trans. Netw. Networking, IEEE Transactions on. 34:1820-1837 2026
Envy-Free Cake-Cutting for Four Agents.
Hollender, Alexandros ; Rubinstein, Aviad
Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-54. 54p.
The communication complexity of distributed estimation
Gopalan, Parikshit ; Meka, Raghu ; Raghavendra, Prasad ; et al.
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
Wu, Xudong ; Yang, Guangxu ; Yao, Penghui
Pseudodeterministic Communication Complexity
Göös, Mika ; Harms, Nathaniel ; Riazanov, Artur ; et al.
New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
Chen, Lijie ; Hu, Yang ; Ren, Hanlin
Quantum and Classical Communication Complexity of Permutation-Invariant Functions
Guan, Z. ; Huang, Y. ; Yao, P. ; et al.
IEEE Transactions on Information Theory IEEE Trans. Inform. Theory Information Theory, IEEE Transactions on. 71(4):2782-2799 Apr, 2025
Magic and communication complexity
Girish, Uma ; May, Alex ; Parham, Natalie ; et al.
A Hierarchy for Constant Communication Complexity
Ambainis, Andris ; Klauck, Hartmut ; Lim, Debbie
NP-Hardness and ETH-Based Inapproximability of Communication Complexity via Relaxed Interlacing
Gaspers, Serge ; He, Tao Zixu ; Mackenzie, Simon
Crackle: A Fast Sector-based BFT Consensus with Sublinear Communication Complexity
Xu, Hao ; Liu, Xiulong ; Zhang, Chenyu ; et al.
IEEE INFOCOM 2024 - IEEE Conference on Computer Communications Computer Communications, IEEE INFOCOM 2024 - IEEE Conference on. :1-10 May, 2024
Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
Datta, Swarnalipa ; Ghosh, Arijit ; Kayal, Chandrima ; et al.
The Communication Complexity of Approximating Matrix Rank
Sherstov, Alexander A. ; Storozhenko, Andrey A.
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2024 IEEE 65th Annual Symposium on. :433-462 Oct, 2024
The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
Qiu, Frederick V. ; Weinberg, S. Matthew ; Zhang, Qianfan
Space-Bounded Communication Complexity of Unitaries
Li, Longcheng ; Sun, Xiaoming ; Zhang, Jialin ; et al.
Semi-Robust Communication Complexity of Maximum Matching
Huete, Gabriel Cipriani ; Diddapur, Adithya ; Dvořák, Pavel ; et al.
Communication Complexity is NP-hard
Hirahara, Shuichi ; Ilango, Rahul ; Loff, Bruno
Minimizing the Arithmetic and Communication Complexity of Jacobi's Method for Eigenvalues and Singular Values
Demmel, James ; Luo, Hengrui ; Schneider, Ryan ; et al.
Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
Hasegawa, Atsuya ; Gall, François Le ; Modanese, Augusto