Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
Claire Lazar Reich and Suhas Vijaykumar. A Possibility in Algorithmic Fairness: Can Calibration and Equal Error Rates Be Reconciled?. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 4:1-4:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lazarreich_et_al:LIPIcs.FORC.2021.4, author = {Lazar Reich, Claire and Vijaykumar, Suhas}, title = {{A Possibility in Algorithmic Fairness: Can Calibration and Equal Error Rates Be Reconciled?}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {4:1--4:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.4}, URN = {urn:nbn:de:0030-drops-138727}, doi = {10.4230/LIPIcs.FORC.2021.4}, annote = {Keywords: fair prediction, impossibility results, screening decisions, classification, calibration, equalized odds, optimal transport, risk scores} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Michael Ben-Or and Lior Eldar. A Quasi-Random Approach to Matrix Spectral Analysis. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 6:1-6:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{benor_et_al:LIPIcs.ITCS.2018.6, author = {Ben-Or, Michael and Eldar, Lior}, title = {{A Quasi-Random Approach to Matrix Spectral Analysis}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {6:1--6:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.6}, URN = {urn:nbn:de:0030-drops-83288}, doi = {10.4230/LIPIcs.ITCS.2018.6}, annote = {Keywords: linear algebra, eigenvalues, eigenvectors, low-discrepancy sequence} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Tom Gur, Govind Ramnarayan, and Ron D. Rothblum. Relaxed Locally Correctable Codes. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 27:1-27:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gur_et_al:LIPIcs.ITCS.2018.27, author = {Gur, Tom and Ramnarayan, Govind and Rothblum, Ron D.}, title = {{Relaxed Locally Correctable Codes}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {27:1--27:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.27}, URN = {urn:nbn:de:0030-drops-83154}, doi = {10.4230/LIPIcs.ITCS.2018.27}, annote = {Keywords: Keywords and phrases Coding Theory, Locally Correctable Codes, Probabilistically Checkable Proofs} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Anna Ben-Hamou and Yuval Peres. Cutoff for a Stratified Random Walk on the Hypercube. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 29:1-29:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{benhamou_et_al:LIPIcs.APPROX-RANDOM.2017.29, author = {Ben-Hamou, Anna and Peres, Yuval}, title = {{Cutoff for a Stratified Random Walk on the Hypercube}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {29:1--29:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.29}, URN = {urn:nbn:de:0030-drops-75787}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.29}, annote = {Keywords: Mixing times, cutoff, hypercube} }
Feedback for Dagstuhl Publishing