Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Samuel King

dblp:287/4854 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity
fine-grained complexity		 1.012026
Online Orthogonal Vectors Revisited · SODA 2026
Computational complexity › fine-grained complexity
orthogonal vectors problem		 1.012026
Online Orthogonal Vectors Revisited · SODA 2026

Methods — techniques the papers use, named apart from their topics

upper and lower bounds · 1.0
YearPublicationVenuePosition
2026 Online Orthogonal Vectors Revisited
abstract
We prove new upper and lower bounds for the Online Orthogonal Vectors Problem (\(\text{OnlineOV}_{n,d}\)). In this problem, a preprocessing algorithm receives \(n\) vectors \(x_1, \ldots, x_n \in \{0,1\}^d\) and constructs a data structure of size \(S\). A query algorithm subsequently receives a query vector \(q \in \{0,1\}^d\) and in time \(T\) decides whether \(q\) is orthogonal to any of the input vectors \(x_i\).
Karthik Gajulapalli, Alexander Golovnev, Samuel King, Sidhant Saraogi
 SODA3