Tradeoff Theorems
Tradeoff Theorems is a theoretical construct in structural complexity that characterizes the inherent limitations and quantitative relationships between competing computational resources, such as time, space, and circuit size, thereby establishing rigorous lower bounds on the efficiency of algorithms and computational models.
22
Publications
15K
Citations
49
Authors
37
Institutions
Publications per year
2017–2026
7
Parents
22
Perspectives on the CAP Theorem
Seth Gilbert, Nancy Lynch · Computer · 2012 · 246 citations · Full text
Cooperative Regenerating Codes
Kenneth W. Shum, Yuchong Hu · IEEE Transactions on Information Theory · 2013 · 132 citations
Christos H. Papadimitriou, Jeffrey D. Ullman · SIAM Journal on Computing · 1987 · 98 citations
1–5 of 22
49
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 49
37
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
62 citations
Texas A&M University
College Station, United States
2 h-index
4 publications
207 citations

Université Paris 1 Panthéon-Sorbonne
Paris, France
1 h-index
1 publications
28 citations
Centre de Recerca Matemàtica
Barcelona, Spain
1 h-index
1 publications
28 citations

Télécom Paris
Palaiseau, France
1 h-index
2 publications
84 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
2 publications
264 citations
Duke University
Durham, United States
1 h-index
1 publications
13 citations
Laboratoire Traitement et Communication de l’Information
Palaiseau, France
1 h-index
2 publications
84 citations
1–8 of 37
JET · 2 publications · 39 citations
2
h-index
2 publications · 221 citations
2
h-index
1 publications · 42 citations
1
h-index
JSS · 1 publications · 18 citations
1
h-index
1 publications · 98 citations
1
h-index
1–5