Demo Data from EDBT 2026 / reviewers in the wild / expert
Saeedreza Seddighin
dblp:346/8578
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—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 |
Algorithms and data structures · 50% Approximation and online algorithms · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Approximation and online algorithms
approximation algorithms |
0.6 | 1 | 2022 | Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier · SIAM J. Comput. 2022 |
Approximation and online algorithms › approximation algorithms › subquadratic approximation
linear-time approximation |
0.6 | 1 | 2022 | Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier · SIAM J. Comput. 2022 |
Algorithms and data structures › sequence algorithms › string algorithms
longest common subsequence |
0.6 | 1 | 2022 | Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier · SIAM J. Comput. 2022 |
Algorithms and data structures › sequence algorithms
string algorithms |
0.6 | 1 | 2022 | Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier · SIAM J. Comput. 2022 |
Methods — techniques the papers use, named apart from their topics
edit distance · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier
Mohammad Hajiaghayi, Masoud Seddighin, Saeedreza Seddighin, Xiaorui Sun |
SIAM J. Comput. | 3 |