Deterministic Space Complexity
Deterministic Space Complexity is the measure of the minimum amount of memory space required by a deterministic Turing machine to solve a computational problem as a function of the input size.
23
Publications
912
Citations
54
Authors
44
Institutions
Publications per year
2017–2026
1
Parents
23
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano · ACM Transactions on Algorithms · 2009 · 111 citations
Faster deterministic sorting and searching in linear space
Arne Andersson · 2002 · 108 citations
Universal games of incomplete information
John H. Reif · 1979 · 77 citations · Full text
Estimating the sortedness of a data stream
Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer et al. · 2007 · 63 citations
1–5 of 23
54
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 54
44
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
71 citations
The University of Texas at Austin
Austin, United States
2 h-index
3 publications
109 citations

Tokyo University of Agriculture and Technology
Tokyo, Japan
1 h-index
1 publications
18 citations

University of Rome Tor Vergata
Rome, Italy
1 h-index
2 publications
222 citations

Paderborn University
Paderborn, Germany
1 h-index
1 publications
18 citations
University of Pavol Jozef Šafárik
Košice, Slovakia
1 h-index
1 publications
47 citations
Courant Institute of Mathematical Sciences
New York, United States
1 h-index
1 publications
41 citations

Nagoya Institute of Technology
Nagoya, Japan
1 h-index
3 publications
171 citations
1–8 of 44
3 publications · 75 citations
3
h-index
2 publications · 61 citations
2
h-index
JACM · 1 publications · 41 citations
1
h-index
1 publications · 16 citations
1
h-index
TKDE · 1 publications · 66 citations
1
h-index
1–5