Deterministic Online Algorithms
Deterministic Online Algorithms is a class of online algorithms that make irreversible decisions in a sequential manner without knowledge of future inputs and operate under a fixed, predictable strategy without incorporating randomness.
134
Publications
5.3K
Citations
291
Authors
143
Institutions
Publications per year
2017–2026
30
Parents
134
Space-efficient online computation of quantile summaries
Michael B. Greenwald, Sanjeev Khanna · 2001 · 456 citations
New Ressults on Server Problems
Marek Chrobák, H. Karloof, Tom Payne et al. · SIAM Journal on Discrete Mathematics · 1991 · 211 citations
Space-efficient online computation of quantile summaries
Michael B. Greenwald, Sanjeev Khanna · ACM SIGMOD Record · 2001 · 162 citations
Competitive randomized algorithms for non-uniform problems
Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch et al. · Symposium on Discrete Algorithms · 1990 · 159 citations
1–5 of 134
291
11
h-index
7
h-index
6
h-index
5
h-index
5
h-index
1–5 of 291
143
Chinese University of Hong Kong
Hong Kong, Hong Kong
10 h-index
28 publications
1K citations

Tel Aviv University
Tel Aviv, Israel
8 h-index
11 publications
453 citations
Technion – Israel Institute of Technology
Haifa, Israel
7 h-index
11 publications
450 citations

University of Wrocław
Wroclaw, Poland
6 h-index
12 publications
210 citations
University of California, Riverside
Riverside, United States
6 h-index
9 publications
394 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
6 publications
182 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
6 publications
272 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
4 h-index
5 publications
209 citations
1–8 of 143
TALG · 15 publications · 616 citations
13
h-index
Repository · 6 publications · 138 citations
6
h-index
Conference · 6 publications · 298 citations
6
h-index
5 publications · 336 citations
5
h-index
3 publications · 144 citations
3
h-index
1–5