Logarithmic Space
Logarithmic Space is the complexity class consisting of decision problems solvable by a deterministic Turing machine using a workspace bounded by a logarithmic function of the input size.
145
Publications
8.9K
Citations
271
Authors
155
Institutions
Publications per year
2017–2026
20
Variants
Logspace
Parents
145
The space complexity of approximating the frequency moments
Noga Alon, Yossi Matias, Márió Szegedy · 1996 · 847 citations
Undirected connectivity in log-space
Omer Reingold · Journal of the ACM · 2008 · 511 citations
Mariano P. Consens, Alberto O. Mendelzon · 1990 · 346 citations · Full text
1–5 of 145
271
6
h-index
5
h-index
3
h-index
3
h-index
3
h-index
1–5 of 271
155

Serbian Academy of Sciences and Arts
Belgrade, Serbia
6 h-index
6 publications
272 citations

University of Toronto
Toronto, Canada
6 h-index
9 publications
1.2K citations
University of Pavol Jozef Šafárik
Košice, Slovakia
4 h-index
4 publications
106 citations
AT&T (United States)
Bedminster, United States
4 h-index
6 publications
3.7K citations

McGill University
Montreal, Canada
4 h-index
4 publications
105 citations

Weizmann Institute of Science
Rehovot, Israel
4 h-index
5 publications
621 citations

Jiangsu Normal University
Xuzhou, China
3 h-index
3 publications
79 citations
Yale University
New Haven, United States
3 h-index
7 publications
433 citations
1–8 of 155
Repository · 9 publications · 126 citations
9
h-index
9 publications · 289 citations
9
h-index
6 publications · 364 citations
6
h-index
6 publications · 106 citations
5
h-index
4 publications · 171 citations
4
h-index
1–5