@inproceedings{fearnley_et_al:LIPIcs.STACS.2021.29,
Address = {Dagstuhl, Germany},
Annote = {Keywords: query complexity, Tarski fixed points, total function problem},
Author = {Fearnley, John and Savani, Rahul},
BookTitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
Editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
File = {A Faster Algorithm for Finding Tarski Fixed Points - LIPIcs-STACS-2021-29 - w.pdf},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
Pages = {29:1--29:16},
Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{A Faster Algorithm for Finding Tarski Fixed Points}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13674},
Volume = {187},
Year = {2021},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2021/13674},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.STACS.2021.29},
date-added = {2021-03-16 18:30:40 +0100},
date-modified = {2021-03-16 18:30:40 +0100},
urn = {urn:nbn:de:0030-drops-136741},
doi = {10.4230/LIPIcs.STACS.2021.29}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A