Demo Data from EDBT 2026 / reviewers in the wild / expert
Kashyap Babu Rao Kolipaka
dblp:80/9697
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author
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 |
Combinatorics and discrete mathematics · 75% Algorithms and data structures · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Combinatorics and discrete mathematics › probabilistic method › lovász local lemma
algorithmic lovász local lemma |
0.1 | 1 | 2011 | Moser and tardos meet Lovász · STOC 2011 |
Combinatorics and discrete mathematics › probabilistic method
lovász local lemma |
0.1 | 1 | 2011 | Moser and tardos meet Lovász · STOC 2011 |
Combinatorics and discrete mathematics
probabilistic method |
0.1 | 1 | 2011 | Moser and tardos meet Lovász · STOC 2011 |
Algorithms and data structures
randomized algorithms |
0.1 | 1 | 2011 | Moser and tardos meet Lovász · STOC 2011 |
Methods — techniques the papers use, named apart from their topics
moser-tardos algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | A Sharper Local Lemma with Improved Applications
Kashyap Babu Rao Kolipaka, Mario Szegedy |
APPROX-RANDOM | 1 |
| 2011 | Moser and tardos meet LovászabstractBeck's early work [3] gave an efficient version of the Lovász Local Lemma(LLL) with significant compromise in the parameters. Following several improvements [1,7,4,13], Moser [8], and Moser and Tardos [9] obtained asymptotically optimal results in terms of the maximal degree. Kashyap Babu Rao Kolipaka, Mario Szegedy |
STOC | 1 |