@inproceedings{95524e679d0c485a8a761568c32d4924,
title = "The Wrong Direction of Jensen{\textquoteright}s Inequality Is Algorithmically Right",
abstract = "Let A be an algorithm with expected running time eX, conditioned on the value of some random variable X. We construct an algorithm A′ with expected running time O(eE[X]), that fully executes A. In particular, an algorithm whose running time is a random variable T can be converted to one with expected running time O(eE[ln T]), which is never worse than O(E[T]).",
keywords = "Jensen{\textquoteright}s inequality, algorithms, complexity",
author = "Or Zamir",
note = "Publisher Copyright: {\textcopyright} Or Zamir.; 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023 ; Conference date: 10-07-2023 Through 14-07-2023",
year = "2023",
month = jul,
doi = "https://doi.org/10.4230/LIPIcs.ICALP.2023.107",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Kousha Etessami and Uriel Feige and Gabriele Puppis",
booktitle = "50th International Colloquium on Automata, Languages, and Programming, ICALP 2023",
}