Yannik Stein

Orcid: 0000-0002-2062-7594

According to our database1, Yannik Stein authored at least 18 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Unbiased Offline Evaluation for Learning to Rank with Business Rules.
CoRR, 2023

Contextual Position Bias Estimation Using a Single Stochastic Logging Policy.
Proceedings of the Workshop on Learning and Evaluating Recommendations with Impressions co-located with the 17th ACM Conference on Recommender Systems (RecSys 2023), 2023

2022
Low-variance estimation in the Plackett-Luce model via quasi-Monte Carlo sampling.
CoRR, 2022

Modeling Position Bias Ranking for Streaming Media Services.
Proceedings of the Companion of The Web Conference 2022, Virtual Event / Lyon, France, April 25, 2022

Fair Effect Attribution in Parallel Online Experiments.
Proceedings of the Companion of The Web Conference 2022, Virtual Event / Lyon, France, April 25, 2022

2021
Ranker-agnostic Contextual Position Bias Estimation.
CoRR, 2021

2020
Routing in polygonal domains.
Comput. Geom., 2020

Learning to Rank in the Position Based Model with Bandit Feedback.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2018
Improved time-space trade-offs for computing Voronoi diagrams.
J. Comput. Geom., 2018

Computational Aspects of the Colorful Carathéodory Theorem.
Discret. Comput. Geom., 2018

Time-space trade-offs for triangulations and Voronoi diagrams.
Comput. Geom., 2018

2017
Routing in Polygons with Holes.
CoRR, 2017

The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
The Colorful Carathéodory Problem and its Descendants (Das Colorful Carathéodory Problem und seine Anwendungen)
PhD thesis, 2016

2015
Approximating the Simplicial Depth.
CoRR, 2015

Approximate k-flat Nearest Neighbor Search.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Algorithms for Tolerant Tverberg Partitions.
Int. J. Comput. Geom. Appl., 2014

2013
Algorithms for Tolerated Tverberg Partitions.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013


  Loading...