Published in: LIPIcs, Volume 256, 4th Symposium on Foundations of Responsible Computing (FORC 2023)
Cynthia Dwork, Omer Reingold, and Guy N. Rothblum. From the Real Towards the Ideal: Risk Prediction in a Better World. In 4th Symposium on Foundations of Responsible Computing (FORC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 256, pp. 1:1-1:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{dwork_et_al:LIPIcs.FORC.2023.1, author = {Dwork, Cynthia and Reingold, Omer and Rothblum, Guy N.}, title = {{From the Real Towards the Ideal: Risk Prediction in a Better World}}, booktitle = {4th Symposium on Foundations of Responsible Computing (FORC 2023)}, pages = {1:1--1:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-272-3}, ISSN = {1868-8969}, year = {2023}, volume = {256}, editor = {Talwar, Kunal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2023.1}, URN = {urn:nbn:de:0030-drops-179224}, doi = {10.4230/LIPIcs.FORC.2023.1}, annote = {Keywords: Algorithmic Fairness, Affirmative Action, Learning, Predictions, Multicalibration, Outcome Indistinguishability} }
Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Zhun Deng, Cynthia Dwork, and Linjun Zhang. HappyMap : A Generalized Multicalibration Method. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 41:1-41:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{deng_et_al:LIPIcs.ITCS.2023.41, author = {Deng, Zhun and Dwork, Cynthia and Zhang, Linjun}, title = {{HappyMap : A Generalized Multicalibration Method}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {41:1--41:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.41}, URN = {urn:nbn:de:0030-drops-175449}, doi = {10.4230/LIPIcs.ITCS.2023.41}, annote = {Keywords: algorithmic fairness, target-independent learning, transfer learning} }
Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Michael P. Kim and Juan C. Perdomo. Making Decisions Under Outcome Performativity. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 79:1-79:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{kim_et_al:LIPIcs.ITCS.2023.79, author = {Kim, Michael P. and Perdomo, Juan C.}, title = {{Making Decisions Under Outcome Performativity}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {79:1--79:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.79}, URN = {urn:nbn:de:0030-drops-175824}, doi = {10.4230/LIPIcs.ITCS.2023.79}, annote = {Keywords: performative prediction, outcome indistinguishability} }
Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Gal Amram, Avi Hayoun, Lior Mizrahi, and Gera Weiss. Polynomial-Time Verification and Testing of Implementations of the Snapshot Data Structure. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{amram_et_al:LIPIcs.DISC.2022.5, author = {Amram, Gal and Hayoun, Avi and Mizrahi, Lior and Weiss, Gera}, title = {{Polynomial-Time Verification and Testing of Implementations of the Snapshot Data Structure}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {5:1--5:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.5}, URN = {urn:nbn:de:0030-drops-171964}, doi = {10.4230/LIPIcs.DISC.2022.5}, annote = {Keywords: Snapshot, Linearizability, Verification, Formal Methods} }
Published in: LIPIcs, Volume 218, 3rd Symposium on Foundations of Responsible Computing (FORC 2022)
Elbert Du and Cynthia Dwork. Improved Generalization Guarantees in Restricted Data Models. In 3rd Symposium on Foundations of Responsible Computing (FORC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 218, pp. 6:1-6:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{du_et_al:LIPIcs.FORC.2022.6, author = {Du, Elbert and Dwork, Cynthia}, title = {{Improved Generalization Guarantees in Restricted Data Models}}, booktitle = {3rd Symposium on Foundations of Responsible Computing (FORC 2022)}, pages = {6:1--6:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-226-6}, ISSN = {1868-8969}, year = {2022}, volume = {218}, editor = {Celis, L. Elisa}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2022.6}, URN = {urn:nbn:de:0030-drops-165299}, doi = {10.4230/LIPIcs.FORC.2022.6}, annote = {Keywords: Differential Privacy, Adaptive Data Analysis, Transfer Theorem} }
Published in: LIPIcs, Volume 156, 1st Symposium on Foundations of Responsible Computing (FORC 2020)
Christina Ilvento. Metric Learning for Individual Fairness. In 1st Symposium on Foundations of Responsible Computing (FORC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 156, pp. 2:1-2:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{ilvento:LIPIcs.FORC.2020.2, author = {Ilvento, Christina}, title = {{Metric Learning for Individual Fairness}}, booktitle = {1st Symposium on Foundations of Responsible Computing (FORC 2020)}, pages = {2:1--2:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-142-9}, ISSN = {1868-8969}, year = {2020}, volume = {156}, editor = {Roth, Aaron}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2020.2}, URN = {urn:nbn:de:0030-drops-120183}, doi = {10.4230/LIPIcs.FORC.2020.2}, annote = {Keywords: metric learning, individual fairness, fair machine learning} }
Published in: LIPIcs, Volume 156, 1st Symposium on Foundations of Responsible Computing (FORC 2020)
Cynthia Dwork, Christina Ilvento, and Meena Jagadeesan. Individual Fairness in Pipelines. In 1st Symposium on Foundations of Responsible Computing (FORC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 156, pp. 7:1-7:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dwork_et_al:LIPIcs.FORC.2020.7, author = {Dwork, Cynthia and Ilvento, Christina and Jagadeesan, Meena}, title = {{Individual Fairness in Pipelines}}, booktitle = {1st Symposium on Foundations of Responsible Computing (FORC 2020)}, pages = {7:1--7:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-142-9}, ISSN = {1868-8969}, year = {2020}, volume = {156}, editor = {Roth, Aaron}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2020.7}, URN = {urn:nbn:de:0030-drops-120235}, doi = {10.4230/LIPIcs.FORC.2020.7}, annote = {Keywords: algorithmic fairness, fairness under composition, pipelines} }
Published in: LIPIcs, Volume 156, 1st Symposium on Foundations of Responsible Computing (FORC 2020)
Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, and Pragya Sur. Abstracting Fairness: Oracles, Metrics, and Interpretability. In 1st Symposium on Foundations of Responsible Computing (FORC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 156, pp. 8:1-8:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dwork_et_al:LIPIcs.FORC.2020.8, author = {Dwork, Cynthia and Ilvento, Christina and Rothblum, Guy N. and Sur, Pragya}, title = {{Abstracting Fairness: Oracles, Metrics, and Interpretability}}, booktitle = {1st Symposium on Foundations of Responsible Computing (FORC 2020)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-142-9}, ISSN = {1868-8969}, year = {2020}, volume = {156}, editor = {Roth, Aaron}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2020.8}, URN = {urn:nbn:de:0030-drops-120247}, doi = {10.4230/LIPIcs.FORC.2020.8}, annote = {Keywords: Algorithmic fairness, fairness definitions, causality-based fairness, interpretability, individual fairness, metric fairness} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Dmitry Chistikov, Andrzej S. Murawski, and David Purser. Asymmetric Distances for Approximate Differential Privacy. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chistikov_et_al:LIPIcs.CONCUR.2019.10, author = {Chistikov, Dmitry and Murawski, Andrzej S. and Purser, David}, title = {{Asymmetric Distances for Approximate Differential Privacy}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {10:1--10:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.10}, URN = {urn:nbn:de:0030-drops-109121}, doi = {10.4230/LIPIcs.CONCUR.2019.10}, annote = {Keywords: Bisimilarity distances, Differential privacy, Labelled Markov chains} }
Published in: LIPIcs, Volume 137, 34th Computational Complexity Conference (CCC 2019)
Susanna F. de Rezende, Jakob Nordström, Or Meir, and Robert Robere. Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. In 34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 137, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{derezende_et_al:LIPIcs.CCC.2019.18, author = {de Rezende, Susanna F. and Nordstr\"{o}m, Jakob and Meir, Or and Robere, Robert}, title = {{Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling}}, booktitle = {34th Computational Complexity Conference (CCC 2019)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-116-0}, ISSN = {1868-8969}, year = {2019}, volume = {137}, editor = {Shpilka, Amir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.18}, URN = {urn:nbn:de:0030-drops-108403}, doi = {10.4230/LIPIcs.CCC.2019.18}, annote = {Keywords: proof complexity, Nullstellensatz, pebble games, trade-offs, size, degree} }
Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
Cynthia Dwork and Christina Ilvento. Fairness Under Composition. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 33:1-33:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{dwork_et_al:LIPIcs.ITCS.2019.33, author = {Dwork, Cynthia and Ilvento, Christina}, title = {{Fairness Under Composition}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {33:1--33:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.33}, URN = {urn:nbn:de:0030-drops-101269}, doi = {10.4230/LIPIcs.ITCS.2019.33}, annote = {Keywords: algorithmic fairness, fairness, fairness under composition} }
Published in: LIPIcs, Volume 44, 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)
Edward Eaton and Fang Song. Making Existential-unforgeable Signatures Strongly Unforgeable in the Quantum Random-oracle Model. In 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 44, pp. 147-162, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{eaton_et_al:LIPIcs.TQC.2015.147, author = {Eaton, Edward and Song, Fang}, title = {{Making Existential-unforgeable Signatures Strongly Unforgeable in the Quantum Random-oracle Model}}, booktitle = {10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)}, pages = {147--162}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-96-5}, ISSN = {1868-8969}, year = {2015}, volume = {44}, editor = {Beigi, Salman and K\"{o}nig, Robert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2015.147}, URN = {urn:nbn:de:0030-drops-55540}, doi = {10.4230/LIPIcs.TQC.2015.147}, annote = {Keywords: digital signatures, strongly unforgeable, quantum random-oracle, lattices} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Shiva Prasad Kasiviswanathan and Mark Rudelson. Spectral Norm of Random Kernel Matrices with Applications to Privacy. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 898-914, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kasiviswanathan_et_al:LIPIcs.APPROX-RANDOM.2015.898, author = {Kasiviswanathan, Shiva Prasad and Rudelson, Mark}, title = {{Spectral Norm of Random Kernel Matrices with Applications to Privacy}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {898--914}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.898}, URN = {urn:nbn:de:0030-drops-53435}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.898}, annote = {Keywords: Random Kernel Matrices, Spectral Norm, Subguassian Distribution, Data Privacy, Reconstruction Attacks} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Jirí Matoušek and Aleksandar Nikolov. Combinatorial Discrepancy for Boxes via the gamma_2 Norm. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{matousek_et_al:LIPIcs.SOCG.2015.1, author = {Matou\v{s}ek, Jir{\'\i} and Nikolov, Aleksandar}, title = {{Combinatorial Discrepancy for Boxes via the gamma\underline2 Norm}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {1--15}, 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.1}, URN = {urn:nbn:de:0030-drops-51091}, doi = {10.4230/LIPIcs.SOCG.2015.1}, annote = {Keywords: discrepancy theory, range counting, factorization norms} }
Published in: LIPIcs, Volume 33, 30th Conference on Computational Complexity (CCC 2015)
Cedric Yen-Yu Lin and Han-Hsuan Lin. Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester. In 30th Conference on Computational Complexity (CCC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 33, pp. 537-566, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{lin_et_al:LIPIcs.CCC.2015.537, author = {Lin, Cedric Yen-Yu and Lin, Han-Hsuan}, title = {{Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester}}, booktitle = {30th Conference on Computational Complexity (CCC 2015)}, pages = {537--566}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-81-1}, ISSN = {1868-8969}, year = {2015}, volume = {33}, editor = {Zuckerman, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.537}, URN = {urn:nbn:de:0030-drops-50635}, doi = {10.4230/LIPIcs.CCC.2015.537}, annote = {Keywords: Quantum Algorithms, Query Complexity, Elitzur-Vaidman Bomb Tester, Adversary Method, Maximum Bipartite Matching} }
Feedback for Dagstuhl Publishing