EDBT 2026 Demo / reviewers in the wild / expert
Gustav Hast
dblp:65/6792
· DBLP profile ↗
5ranked-venue papers
5as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-authorSecurity and privacy · 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.
| Network and information security
2 papers |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
2 papers |
Approximation and online algorithms · 31% Algorithmic game theory and mechanism design · 31% Mathematical optimization · 31% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › one-way functions
hard-core predicates |
0.1 | 2 | 2004 | Nearly One-Sided Tests and the Goldreich?Levin Predicate · J. Cryptol. 2004 Nearly One-Sided Tests and the Goldreich-Levin Predicate · EUROCRYPT 2003 |
Approximation and online algorithms
approximation algorithms |
0.1 | 1 | 2005 | Approximating - Outperforming a Random Assignment with Almost a Linear Factor · ICALP 2005 |
Mathematical optimization › combinatorial optimization
assignment problem |
0.1 | 1 | 2005 | Approximating - Outperforming a Random Assignment with Almost a Linear Factor · ICALP 2005 |
Algorithmic game theory and mechanism design › fair division
random assignment |
0.1 | 1 | 2005 | Approximating - Outperforming a Random Assignment with Almost a Linear Factor · ICALP 2005 |
Cryptographic primitives and cryptanalysis
pseudorandomness |
0.0 | 1 | 2004 | Nearly One-Sided Tests and the Goldreich?Levin Predicate · J. Cryptol. 2004 |
Cryptographic primitives and cryptanalysis
cryptographic assumptions |
0.0 | 1 | 2003 | Nearly One-Sided Tests and the Goldreich-Levin Predicate · EUROCRYPT 2003 |
Cryptographic primitives and cryptanalysis
one-way functions |
0.0 | 1 | 2003 | Nearly One-Sided Tests and the Goldreich-Levin Predicate · EUROCRYPT 2003 |
Computational complexity › cryptographic complexity
one-way functions |
0.0 | 1 | 2004 | Nearly One-Sided Tests and the Goldreich?Levin Predicate · J. Cryptol. 2004 |
Methods — techniques the papers use, named apart from their topics
reduction · 0.1approximation · 0.1one-sided tests · 0.0hypothesis testing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Beating a Random Assignment
Gustav Hast |
APPROX-RANDOM | 1 |
| 2005 | Approximating - Outperforming a Random Assignment with Almost a Linear Factor
Gustav Hast |
ICALP | 1 |
| 2004 | Approximating Max kCSP Using Random Restrictions
Gustav Hast |
APPROX-RANDOM | 1 |
| 2004 | Nearly One-Sided Tests and the Goldreich?Levin Predicate
Gustav Hast |
J. Cryptol. | 1 |
| 2003 | Nearly One-Sided Tests and the Goldreich-Levin Predicate
Gustav Hast |
EUROCRYPT | 1 |