Online Algorithms
Online Algorithms is an algorithmic paradigm in which a problem instance is solved incrementally by making irrevocable decisions in real-time under the constraint that future input data are unknown, distinguishing it from offline algorithms that have complete information a priori.
2.9K
Publications
162.8K
Citations
5.8K
Authors
1.4K
Institutions
Publications per year
2017–2026
1.1K
2.9K
Online Passive-Aggressive Algorithms
Koby Crammer, Ofer Dekel, Joseph Keshet et al. · 2006 · 1.5K citations
1–5 of 2.9K
5.8K
26
h-index
24
h-index
23
h-index
16
h-index
16
h-index
1–5 of 5.8K
1.4K
Google (United States)
Mountain View, United States
38 h-index
109 publications
17.7K citations
Technion – Israel Institute of Technology
Haifa, Israel
37 h-index
106 publications
5.9K citations
Microsoft (United States)
Redmond, United States
33 h-index
85 publications
7.8K citations
Nanyang Technological University
Singapore, Singapore
33 h-index
115 publications
16.3K citations
Carnegie Mellon University
Pittsburgh, United States
33 h-index
146 publications
9.1K citations
Massachusetts Institute of Technology
Cambridge, United States
32 h-index
92 publications
5K citations
University of California, Berkeley
Berkeley, United States
32 h-index
94 publications
15.7K citations
Hebrew University of Jerusalem
Jerusalem, Israel
27 h-index
54 publications
13K citations
1–8 of 1.4K
Repository · 281 publications · 9.9K citations
49
h-index
39 publications · 3.4K citations
28
h-index
44 publications · 3K citations
28
h-index
37 publications · 2.1K citations
25
h-index
27 publications · 1.4K citations
24
h-index
1–5