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 VLDB 2026 / reviewers in the wild / expert

Renan Gross

dblp:203/8574 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · unresolved

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

Theory of computation · 1

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 · 67% Information theory · 33%

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

TopicWeightPapersLastEvidence papers
Computational complexity
boolean function analysis		 0.412020
Concentration on the Boolean hypercube via pathwise stochastic analysis · STOC 2020
Information theory › probability theory › measure concentration
concentration inequalities		 0.412020
Concentration on the Boolean hypercube via pathwise stochastic analysis · STOC 2020
Computational complexity › boolean function theory
influence of boolean functions		 0.412020
Concentration on the Boolean hypercube via pathwise stochastic analysis · STOC 2020

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

pathwise stochastic analysis · 0.4martingale methods · 0.4
YearPublicationVenuePosition
2020 Concentration on the Boolean hypercube via pathwise stochastic analysis
abstract
We develop a new technique for proving concentration inequalities which relate between the variance and influences of Boolean functions.
Ronen Eldan, Renan Gross
 STOC2