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

Evan Abboud

dblp:439/8495 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 first-author · 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
Mathematical optimization · 67% Combinatorics and discrete mathematics · 33%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
combinatorial optimization
1.012026
Tight Algorithm and Hardness for Submodular Linear Ordering · ICALP 2026
Combinatorics and discrete mathematics › partial orders
linear orders
1.012026
Tight Algorithm and Hardness for Submodular Linear Ordering · ICALP 2026
Mathematical optimization
submodular optimization
1.012026
Tight Algorithm and Hardness for Submodular Linear Ordering · ICALP 2026

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

sampling without replacement · 1.0concentration inequalities · 1.0
YearPublicationVenuePosition
2026 Tight Algorithm and Hardness for Submodular Linear Ordering
abstract
Concentration inequalities quantify the deviation of a random variable from a fixed value. In spite of numerous applications, such as opinion surveys or ecological counting procedures , few concentration results are known for the setting of sampling without replacement from a finite population. Until now, the best general concentration inequality has been a Hoeffding inequality due to ?. In this paper, we first improve on the fundamental result of ?, and further extend it to obtain a Bernstein concentration bound for sampling without replacement. We then derive an empirical version of our bound that does not require the variance to be known to the user.
Evan Abboud, Roy Schwartz 0002
ICALP1