Space Complexity Analysis is a theoretical evaluation method that characterizes the asymptotic growth of the amount of memory required by a Skip List in relation to the number of elements, distinguishing it from time-based performance analyses by focusing exclusively on storage consumption.
238
Publications
11.1K
Citations
601
Authors
334
Institutions
Publications per year
2017–2026
52
Parents
Publications
238
The space complexity of approximating the frequency moments
Noga Alon, Yossi Matias, Márió Szegedy · 1996 · 847 citations
Small universal Turing machines
Yurii Rogozhin · Theoretical Computer Science · 1996 · 217 citations · Full text
1–5 of 238
Authors
601
- NA
3
h-index
- MH
3
h-index
- CN
3
h-index
- RC
2
h-index
- KZ
2
h-index
1–5 of 601
Institutions
334
Centre National de la Recherche Scientifique
Paris, France
5 h-index
8 publications
327 citations
University of Florida
Gainesville, United States
5 h-index
7 publications
274 citations
University of Waterloo
Waterloo, Canada
5 h-index
10 publications
344 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
6 publications
428 citations
University of Toronto
Toronto, Canada
4 h-index
4 publications
237 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
5 publications
242 citations
University of Edinburgh
Edinburgh, United Kingdom
3 h-index
5 publications
137 citations
University of Massachusetts Amherst
Amherst Center, United States
3 h-index
6 publications
192 citations
1–8 of 334
Venues
- arXiv (Cornell University)
Repository · 11 publications · 381 citations
11
h-index
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 5 publications · 170 citations
5
h-index
- IEEE Transactions on Computers
5 publications · 186 citations
5
h-index
- Journal of Computer and System Sciences
4 publications · 1.3K citations
4
h-index
- Theoretical Computer Science
4 publications · 421 citations
4
h-index
1–5