Pavel Kolev
Computer Networks and Communications · 2020
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 10 citations into it
- Management Science and Operations Research — 7 citations into it
Whom Pavel Kolev trusts
Their strongest outbound trust, strongest first, inferred from their citations.
- Sergei Vassilvitskii (in Computer Networks and Communications)
- Thodoris Lykouris (in Computer Networks and Communications)
Papers from Pavel Kolev's perspective
Ordered by how strongly the researchers Pavel Kolev trusts endorse each paper. Same corpus, a different order for every researcher.
- The Case for Learned Index Structures (SIGMOD Conference)
- Competitive caching with machine learned advice (International Conference on Machine Learning)
- Improving Online Algorithms via ML Predictions (Neural Information Processing Systems)
- Competitive Analysis with a Sample and the Secretary Problem
- Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs (Symposium on the Theory of Computing)
- Robust Algorithms for the Secretary Problem
- Certifying and Removing Disparate Impact
- Learning Fair Representations
- The sample complexity of revenue maximization (Symposium on the Theory of Computing)
- Fairness in Learning: Classic and Contextual Bandits
Their papers
- Secretary and Online Matching Problems with Machine Learned Advice (2020) — 163 citations