HTML Export for FORC 2023

Copy to Clipboard Download

<h2>LIPIcs, Volume 256, FORC 2023</h2>
<ul>
<li>
    <span class="authors">Kunal Talwar</span>
    <span class="title">LIPIcs, Volume 256, FORC 2023, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023">10.4230/LIPIcs.FORC.2023</a>
</li>
<li>
    <span class="authors">Kunal Talwar</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.0">10.4230/LIPIcs.FORC.2023.0</a>
</li>
<li>
    <span class="authors">Cynthia Dwork, Omer Reingold, and Guy N. Rothblum</span>
    <span class="title">From the Real Towards the Ideal: Risk Prediction in a Better World</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.1">10.4230/LIPIcs.FORC.2023.1</a>
</li>
<li>
    <span class="authors">Bar Karov and Moni Naor</span>
    <span class="title">New Algorithms and Applications for Risk-Limiting Audits</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.2">10.4230/LIPIcs.FORC.2023.2</a>
</li>
<li>
    <span class="authors">Inbal Livni Navon, Charlotte Peale, Omer Reingold, and Judy Hanwen Shen</span>
    <span class="title">Bidding Strategies for Proportional Representation in Advertisement Campaigns</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.3">10.4230/LIPIcs.FORC.2023.3</a>
</li>
<li>
    <span class="authors">Milan Mossé</span>
    <span class="title">Multiplicative Metric Fairness Under Composition</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.4">10.4230/LIPIcs.FORC.2023.4</a>
</li>
<li>
    <span class="authors">Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, and Keziah Naggita</span>
    <span class="title">Setting Fair Incentives to Maximize Improvement</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.5">10.4230/LIPIcs.FORC.2023.5</a>
</li>
<li>
    <span class="authors">Hedyeh Beyhaghi, Modibo K. Camara, Jason Hartline, Aleck Johnsen, and Sheng Long</span>
    <span class="title">Screening with Disadvantaged Agents</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.6">10.4230/LIPIcs.FORC.2023.6</a>
</li>
<li>
    <span class="authors">Jiale Chen, Jason Hartline, and Onno Zoeter</span>
    <span class="title">Fair Grading Algorithms for Randomized Exams</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.7">10.4230/LIPIcs.FORC.2023.7</a>
</li>
<li>
    <span class="authors">Arpita Biswas, Yiduo Ke, Samir Khuller, and Quanquan C. Liu</span>
    <span class="title">An Algorithmic Approach to Address Course Enrollment Challenges</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.8">10.4230/LIPIcs.FORC.2023.8</a>
</li>
<li>
    <span class="authors">Katrin Casel, Tobias Friedrich, Martin Schirneck, and Simon Wietheger</span>
    <span class="title">Fair Correlation Clustering in Forests</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.9">10.4230/LIPIcs.FORC.2023.9</a>
</li>
<li>
    <span class="authors">Pranjal Awasthi, Christopher Jung, and Jamie Morgenstern</span>
    <span class="title">Distributionally Robust Data Join</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.10">10.4230/LIPIcs.FORC.2023.10</a>
</li>
<li>
    <span class="authors">Yoav Ben Dov, Liron David, Moni Naor, and Elad Tzalik</span>
    <span class="title">Resistance to Timing Attacks for Sampling and Privacy Preserving Schemes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FORC.2023.11">10.4230/LIPIcs.FORC.2023.11</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode