7 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.CC2015★ 7 cited
Impossibility Theorems and the Universal Algebraic Toolkit
Mario Szegedy, Yixin Xu
We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal a…
quant-ph2013★ 2 cited
The Garden Hose Complexity for the Equality Function
Well Y. Chiu, Mario Szegedy, Chengu Wang +1
The garden hose complexity is a new communication complexity introduced by H. Buhrman, S. Fehr, C. Schaffner and F. Speelman [BFSS13] to analyze position-based cryptography protoco…