Logarithmic Space Complexity is a computational complexity class that characterizes decision problems solvable by a deterministic Turing machine using a workspace bounded by a logarithmic function of the input size, distinguishing it from broader space complexity classes by its stringent resource constraints.
276
Publications
17.1K
Citations
557
Authors
293
Institutions
Publications per year
2017–2026
36
Variants
Logspace
Publications
276
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
1–5 of 276
Authors
557
- VG
5
h-index
- SC
5
h-index
- GM
4
h-index
- CZ
4
h-index
- AL
4
h-index
1–5 of 557
Institutions
293
University of Toronto
Toronto, Canada
10 h-index
19 publications
2.5K citations
Centre National de la Recherche Scientifique
Paris, France
8 h-index
13 publications
426 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
7 h-index
8 publications
312 citations
University of California, Los Angeles
Los Angeles, United States
6 h-index
10 publications
349 citations
Stanford University
Stanford, United States
5 h-index
7 publications
2.6K citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
5 publications
1.4K citations
New York University
New York, United States
5 h-index
6 publications
478 citations
Tsinghua University
Beijing, China
5 h-index
9 publications
222 citations
1–8 of 293
Venues
- SIAM Journal on Computing
15 publications · 1.1K citations
12
h-index
- arXiv (Cornell University)
Repository · 13 publications · 907 citations
11
h-index
- Information Processing Letters
12 publications · 464 citations
11
h-index
- Theory of Computing Systems
10 publications · 563 citations
10
h-index
- Information and Computation
8 publications · 171 citations
7
h-index
1–5