@InProceedings{urrutia_et_al:LIPIcs.SEA.2024.28,
author = {Urrutia, Sebasti\'{a}n and dos Santos, Vinicius},
title = {{Finding the Minimum Cost Acceptable Element in a Sorted Matrix}},
booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)},
pages = {28:1--28:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-325-6},
ISSN = {1868-8969},
year = {2024},
volume = {301},
editor = {Liberti, Leo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.28},
URN = {urn:nbn:de:0030-drops-203939},
doi = {10.4230/LIPIcs.SEA.2024.28},
annote = {Keywords: Search, Sorted matrix, Oracle function, Algorithm complexity}
}