List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Adversarial bandits with knapsacks Journal of the ACM | 2024-06-06 | Paper |
| Online minimum matching with uniform metric and random arrivals Operations Research Letters | 2022-03-11 | Paper |
| Online stochastic matching: new algorithms and bounds Algorithmica | 2020-10-12 | Paper |
| Mix and match: Markov chains and mixing times for matching in rideshare (available as arXiv preprint) | 2020-06-30 | Paper |
| Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts Algorithmica | 2020-01-16 | Paper |
| Algorithms to approximate column-sparse packing problems ACM Transactions on Algorithms | 2019-12-02 | Paper |
| scientific article; zbMATH DE number 6850331 (Why is no real title available?) | 2018-03-15 | Paper |
| New algorithms, better bounds, and a novel model for online stochastic matching | 2018-03-02 | Paper |
Research outcomes over time
This page was built for person: Karthik Abinav Sankararaman