Amanote Research
Register
Sign In
Amortized Communication Complexity
doi 10.1109/sfcs.1991.185374
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
T. Feder
E. Kushilevitz
M. Naor
Publisher
IEEE Comput. Soc. Press
Related search
On the Amortized Complexity of Zero-Knowledge Protocols
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Round Complexity of Common Randomness Generation: The Amortized Setting
An Amortized-Complexity Method to Compute the Riemann Zeta Function
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
Learning Complexity vs Communication Complexity
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
Randomised Individual Communication Complexity
Complexity Versus Conflict in Communication
The Communication Complexity of Optimization
On Rank vs. Communication Complexity
Combinatorica
Combinatorics
Computational Mathematics
Discrete Mathematics
Communication Complexity of Discrete Fair Division
