Published in: LIPIcs, Volume 301, 22nd International Symposium on Experimental Algorithms (SEA 2024)
Deborah Hendrych, Mathieu Besançon, and Sebastian Pokutta. Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods. In 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 16:1-16:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hendrych_et_al:LIPIcs.SEA.2024.16, author = {Hendrych, Deborah and Besan\c{c}on, Mathieu and Pokutta, Sebastian}, title = {{Solving the Optimal Experiment Design Problem with Mixed-Integer Convex Methods}}, booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)}, pages = {16:1--16:22}, 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.16}, URN = {urn:nbn:de:0030-drops-203810}, doi = {10.4230/LIPIcs.SEA.2024.16}, annote = {Keywords: Mixed-Integer Non-Linear Optimization, Optimal Experiment Design, Frank-Wolfe, Boscia} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Oliver Roche-Newton. An Improved Bound for the Size of the Set A/A+A. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 69:1-69:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{rochenewton:LIPIcs.SoCG.2018.69, author = {Roche-Newton, Oliver}, title = {{An Improved Bound for the Size of the Set A/A+A}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {69:1--69:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.69}, URN = {urn:nbn:de:0030-drops-87820}, doi = {10.4230/LIPIcs.SoCG.2018.69}, annote = {Keywords: sum-product estimates, expanders, incidence theorems, discrete geometry} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Oliver Roche-Newton. A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 74-80, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{rochenewton:LIPIcs.SOCG.2015.74, author = {Roche-Newton, Oliver}, title = {{A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {74--80}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.74}, URN = {urn:nbn:de:0030-drops-51200}, doi = {10.4230/LIPIcs.SOCG.2015.74}, annote = {Keywords: Szemer\'{e}di-Trotter Theorem, pinned distances, sum-product estimates} }