justhsu
/
justin-site
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Add LPAR.

This commit is contained in:
Justin Hsu 2017-03-01 11:42:32 -05:00
parent 992c6114dc
commit 986c1bc161
3 changed files with 98 additions and 141 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
bibs/header.bib
View File

@ -311,9 +311,10 @@
% ----
@STRING{stoc = "{ACM} {SIGACT} {S}ymposium on {T}heory of {C}omputing (STOC)"}
@STRING{stoc87 = stoc # ", New York, New York"}
@STRING{stoc82 = stoc # ", San Francisco, California"}
@STRING{stoc87 = stoc # ", New York, New York"}
@STRING{stoc89 = stoc # ", Seattle, Washington"}
@STRING{stoc91 = stoc # ", New Orleans, Louisiana"}
@STRING{stoc97 = stoc # ", El Paso, Texas"}
@STRING{stoc99 = stoc # ", Atlanta, Georgia"}
@STRING{stoc02 = stoc # ", Montr{\'e}al, Qu{\'e}bec"}
@ -335,6 +336,7 @@
@STRING{focs = "{IEEE} {S}ymposium on {F}oundations of {C}omputer {S}cience (FOCS)"}
@STRING{focs79 = focs # ", San Juan, Puerto Rico"}
@STRING{focs82 = focs # ", Chicago, Illinois"}
@STRING{focs89 = focs # ", Triangle Park, North Carolina"}
@STRING{focs97 = focs # ", Miami Beach, Florida"}
@STRING{focs05 = focs # ", Pittsburgh, Pennsylvania"}
@STRING{focs07 = focs # ", Providence, Rhode Island"}
@ -360,6 +362,7 @@
@STRING{soda14 = soda # ", Portland, Oregon"}
@STRING{soda15 = soda # ", San Diego, California"}
@STRING{soda16 = soda # ", Arlington, Virginia"}
@STRING{soda17 = soda # ", Barcelona, Spain"}
% ----
@STRING{tcc = "{IACR} {T}heory of {C}ryptography {C}onference (TCC)"}
@ -383,11 +386,13 @@
@STRING{nips13 = nips # ", Lake Tahoe, California" }
@STRING{nips14 = nips # ", Montr{\'e}al, Qu{\'e}bec" }
@STRING{nips15 = nips # ", Montr{\'e}al, Qu{\'e}bec" }
@STRING{nips16 = nips # ", Barcelona, Spain" }
% ----
@STRING{icml = "{I}nternational {C}onference on {M}achine {L}earning (ICML)" }
@STRING{icml03 = icml # ", Washington, DC" }
@STRING{icml14 = icml # ", Beijing, China" }
@STRING{icml15 = icml # ", Lille, France" }
@STRING{icml16 = icml # ", New York, NY" }
% ----
@ -413,6 +418,7 @@
@STRING{vldb = "{I}nternational {C}onference on {V}ery {L}arge {D}ata
{B}ases (VLDB)"}
@STRING{vldb12 = vldb # ", Istanbul, Turkey"}
@STRING{vldb17 = vldb # ", Munich, Germany"}
% ----
@STRING{icc = "{IEEE} {I}nternational {C}onference on {C}ommunications
@ -685,6 +691,7 @@ STRING{fse08 = fse # ", Atlanta, Georgia" }
@STRING{lfcompsci13 = lfcompsci # ", San Diego, California" }
% ---
@STRING{lpar15 = lpar # ", Suva, Fiji" }
@STRING{lpar17 = lpar # ", Maun, Botswana" }
% ---
@STRING{logfcs13 = logfcs # ", San Diego, California" }
% ---
@ -692,7 +699,9 @@ STRING{fse08 = fse # ", Atlanta, Georgia" }
@STRING{mfps89 = mfps # ", New Orleans, Louisiana" }
@STRING{mfps95 = mfps # ", New Orleans, Louisiana" }
@STRING{mfps01 = mfps # ", Aarhus, Denmark" }
@STRING{mfps11 = mfps # ", Pittsburgh, Pennsylvania" }
@STRING{mfps14 = mfps # ", Ithaca, New York" }
@STRING{mfps15 = mfps # ", Nijmegen, The Netherlands" }
@STRING{mfps16 = mfps # ", Pittsburgh, Pennsylvania" }
% ---
@STRING{osdi96 = osdi # ", Seattle, Washington" }

222
bibs/myrefs.bib
View File

@ -1,16 +1,4 @@
%%%%%%%%%%%%%%%%%%%%%%%%%%%% UNPUBLISHED %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@unpublished{BEGHS17,
title = {Proving uniformity and independence by self-composition and coupling},
author = {Barthe, Gilles and
Espitau, Thomas and
Gr{\'e}goire, Benjamin and
Hsu, Justin and
Strub, {P}ierre-{Y}ves},
year = 2017,
jh = yes,
url = {https://arxiv.org/abs/1701.06477},
}
@unpublished{BEGHS16,
title = {Relational expectation properties by probabilistic coupling},
author = {Barthe, Gilles and
@ -80,6 +68,19 @@
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%% CONFERENCES %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@inproceedings{BEGHS17,
title = {Proving uniformity and independence by self-composition and coupling},
author = {Barthe, Gilles and
Espitau, Thomas and
Gr{\'e}goire, Benjamin and
Hsu, Justin and
Strub, {P}ierre-{Y}ves},
booktitle = lpar17,
year = 2017,
jh = yes,
url = {https://arxiv.org/abs/1701.06477},
}
@inproceedings{BGHS16,
title = {Coupling proofs are probabilistic product programs},
author = {Barthe, Gilles and
@ -518,7 +519,6 @@ inproceedings{HHRRW14,
year = {2016},
volume = {3},
number = {1},
address = {New York, NY, USA},
url = {http://siglog.hosting.acm.org/wp-content/uploads/2016/01/siglog_news_7.pdf},
jh = yes,
plclub = yes,
@ -874,7 +874,7 @@ inproceedings{HHRRW14,
@inproceedings{RR14,
title = {Asymptotically truthful equilibrium selection in large congestion games},
author = {Rogers, Ryan M and Roth, Aaron},
author = {Rogers, Ryan and Roth, Aaron},
booktitle = ec14,
pages = {771--782},
year = {2014},
@ -962,7 +962,7 @@ inproceedings{HHRRW14,
author = {Dwork, Cynthia and Rothblum, Guy N. and Vadhan, Salil},
year = {2010},
keywords = {Algorithms, {CS}, {DP}, Learning Theory},
pages = {51-–60},
pages = {51--60},
}
@inproceedings{FPT04,
@ -1229,7 +1229,6 @@ inproceedings{HHRRW14,
pages = {793--826},
year = {2011},
url = {http://arxiv.org/abs/0803.0924},
publisher = {SIAM}
}
@inproceedings{UV11,
@ -1422,7 +1421,6 @@ inproceedings{HHRRW14,
pages = {371--380},
year = {2009},
url = {http://research.microsoft.com/pubs/80239/dl09.pdf},
organization = {ACM}
}
@article{LW94,
@ -1559,7 +1557,6 @@ inproceedings{HHRRW14,
number = {4},
pages = {1494--1520},
year = {2013},
publisher = {SIAM},
url = {http://epubs.siam.org/doi/abs/10.1137/110857714}
}
@ -1608,7 +1605,7 @@ url = {http://goto.ucsd.edu/~nvazou/refinement_types_for_haskell.pdf}
title = {Algorithmic game theory},
author = {Nisan, Noam and Roughgarden, Tim and Tardos, Eva and Vazirani, Vijay V},
year = {2007},
publisher = {Cambridge University Press}
publisher = cup
}
@article{BBHM08,
@ -1619,7 +1616,7 @@ url = {http://goto.ucsd.edu/~nvazou/refinement_types_for_haskell.pdf}
number = {8},
pages = {1245--1270},
year = {2008},
publisher = {Elsevier},
publisher = elsevier,
url = {http://www.cs.cmu.edu/~ninamf/papers/ml_md_bbhm.pdf}
}
@ -1663,7 +1660,6 @@ url = {http://goto.ucsd.edu/~nvazou/refinement_types_for_haskell.pdf}
Author = {Ramsey, Norman and Pfeffer, Avi},
Booktitle = popl02,
Pages = {154--165},
Publisher = {ACM},
Title = {Stochastic lambda calculus and monads of probability distributions},
Year = {2002},
url = {http://www.cs.tufts.edu/~nr/pubs/pmonad.pdf}
@ -1841,7 +1837,6 @@ url = {http://research.microsoft.com/pubs/208236/asplos077-bornholtA.pdf
booktitle = sas04,
pages = {100--115},
publisher = springer,
address = {Heidelberg},
series = lncs,
volume = {3148},
year = {2004},
@ -1849,7 +1844,6 @@ url = {http://research.microsoft.com/pubs/208236/asplos077-bornholtA.pdf
}
@inproceedings{BartheGZ09,
Address = {New York},
Author = {Barthe, Gilles and
Gr{\'e}goire, Benjamin and
Zanella{-}B{\'e}guelin, Santiago},
@ -2017,7 +2011,6 @@ year = {2014}
booktitle = fm08,
pages = {35--51},
publisher = springer,
address = {Heidelberg},
series = lncs,
volume = {5014},
year = {2008},
@ -2026,7 +2019,6 @@ year = {2014}
@inproceedings{TerauchiA05,
Address = {Heidelberg},
Author = {Terauchi, Tachio and Aiken, Alex},
Booktitle = sas05,
Pages = {352--367},
@ -2234,18 +2226,17 @@ year = {2014}
}
@article{Tschantz201161,
title = {Formal Verification of Differential Privacy for Interactive Systems
(Extended Abstract)},
title = {Formal Verification of Differential Privacy for Interactive Systems},
author = {Tschantz, Michael Carl and
Kaynar, Dilsun and
Datta, Anupam},
journal = entcs,
volume = "276",
number = "0",
booktitle = mfps11,
series = entcs,
volume = 276,
pages = {61--79},
year = "2011",
issn = "1571--0661",
url = {http://arxiv.org/pdf/1101.2819v1}
year = 2011,
url = {http://arxiv.org/pdf/1101.2819v1},
publisher = elsevier
}
@article{GHKSW06,
@ -2547,7 +2538,7 @@ year = {2014}
@article{Cousout96,
title = {Abstract interpretation},
author = {Cousot, Patrick},
journal = {ACM Computing Surveys (CSUR)},
journal = {{ACM} Computing Surveys},
volume = {28},
number = {2},
pages = {324--328},
@ -2582,8 +2573,7 @@ year = {2014}
title = {Convex Optimization},
year = {2004},
isbn = {0521833787},
publisher = {Cambridge University Press},
address = {New York, NY, USA},
publisher = cup,
}
@book{concentration-book,
@ -2681,7 +2671,6 @@ year = {2014}
booktitle = popl97,
year = "1997",
pages = "106--119",
publisher = {ACM}
}
@inproceedings{BartheGHZ11,
@ -2707,7 +2696,6 @@ verification conditions},
booktitle = popl01,
pages = {193--205},
year = {2001},
publisher = {ACM}
}
@inproceedings{BartheDGKSS13,
@ -2750,7 +2738,7 @@ verification conditions},
Author = {Cook, S.},
Journal = siamjc,
Number = {1},
Pages = {70-90},
Pages = {70--90},
Title = {Soundness and Completeness of an Axiom System for Program Verification},
Volume = {7},
Year = {1978}
@ -2759,7 +2747,6 @@ verification conditions},
@inproceedings{Clarkson:2008,
Author = {Clarkson, M.R. and Schneider, F.B.},
Booktitle = csf08,
Publisher = {IEEE},
Title = {Hyperproperties},
Year = {2008}
}
@ -2781,7 +2768,6 @@ verification conditions},
booktitle = stoc07,
pages = {345--353},
year = {2007},
organization = {ACM}
}
@article{DGP09,
@ -2792,7 +2778,6 @@ verification conditions},
number = {1},
pages = {195--259},
year = {2009},
publisher = {SIAM}
}
@inproceedings{CS02,
@ -2833,7 +2818,6 @@ verification conditions},
booktitle = soda11,
pages = {734--747},
year = {2011},
organization = {SIAM}
}
@inproceedings{BH11,
@ -2842,7 +2826,6 @@ verification conditions},
booktitle = soda11,
pages = {720--733},
year = {2011},
organization = {SIAM}
}
@book{Rou05,
@ -2901,8 +2884,7 @@ series = lncs,
title = {Abstracting and Verifying Strategy-Proofness for Auction Mechanisms},
publisher = springer,
author = {Tadjouddine, Emmanuel M. and Guerin, Frank and Vasconcelos, Wamberto},
pages = {197-214},
language = {English}
pages = {197--214},
}
@ -3028,7 +3010,6 @@ language = {English}
}
@inproceedings{Bellare:2006,
address = {Heidelberg},
author = {Bellare, Mihir and Rogaway, Phillip},
booktitle = eucrypt06,
pages = {409--426},
@ -3254,7 +3235,6 @@ year = {2011}
year = {2008},
isbn = {978-1-59593-860-2},
pages = {193--205},
address = {New York, NY, USA},
}
@inproceedings{AACP11,
@ -3295,7 +3275,6 @@ year = {2011}
number = {1},
pages = {3},
year = {2007},
publisher = {ACM}
}
@article{ESA04,
@ -3448,7 +3427,6 @@ year = {2011}
pages = {489--501},
year = {2015},
url = {http://www.ae-info.org/attach/User/Hermanns_Holger/Publications/FH-POPL15.pdf},
organization = {ACM}
}
@inproceedings{Kozen06,
@ -3497,7 +3475,7 @@ year = {2011}
title = {Optimal transport: old and new},
author = {Villani, C{\'e}dric},
year = {2008},
publisher = {Springer Science}
publisher = springer
}
@techreport{DengD11,
@ -3515,7 +3493,7 @@ year = {2011}
title = {Relational separation logic},
journal = tcs,
volume = 375,
number = {1-3},
number = {1--3},
year = 2007,
pages = {308--334},
url = {http://www.cs.ox.ac.uk/people/hongseok.yang/paper/data.pdf}
@ -3550,9 +3528,8 @@ year = {2011}
booktitle=wine11,
pages={122--133},
year={2011},
publisher={Springer},
publisher=springer,
url={http://users.eecs.northwestern.edu/~hartline/papers/auctions-WINE-11.pdf},
address={Singapore}
}
@inproceedings{CR14,
@ -3569,8 +3546,8 @@ year = {2011}
@inproceedings{blum2005near,
author = {Blum, Avrim and Hartline, Jason D},
booktitle = soda05,
pages = {1156-1163},
publisher = {SIAM},
pages = {1156--1163},
publisher = siam,
title = {Near-optimal online auctions},
url={http://users.eecs.northwestern.edu/~hartline/papers/online-auctions-SODA-05.pdf},
year = 2005
@ -3592,7 +3569,6 @@ year = {2011}
author = {Blum, Avrim and Kumar, Vijay and Rudra, Atri and Wu, Felix},
title = "Online Learning in Online Auctions",
booktitle = soda03,
publisher = {ACM},
url = {http://www.cs.cmu.edu/~avrim/Papers/onlineauction.pdf},
year = 2003,
}
@ -3611,7 +3587,6 @@ year = {2011}
@inproceedings{hartline2009simple,
author = {Hartline, Jason D and Roughgarden, Tim},
booktitle = ec09,
publisher = {ACM},
title = {Simple versus optimal mechanisms},
year = 2009,
url = {http://www.sigecom.org/exchanges/volume_8/1/hartline.pdf},
@ -3649,9 +3624,6 @@ year = 2015
booktitle = ec15,
year = {2015},
pages = {377--394},
numpages = {18},
acmid = {2764510},
publisher = {ACM},
url = {http://people.csail.mit.edu/smweinberg/ec15subadditive.pdf},
}
@ -3661,7 +3633,7 @@ year = 2015
booktitle=wine14,
pages={338--353},
year={2014},
publisher={Springer},
publisher=springer,
url={http://arxiv.org/abs/1407.7937}
}
@ -3693,7 +3665,6 @@ title = {An $n$-to-$1$ Bidder Reduction for Multi-item Auctions and its Applicat
booktitle = soda14,
chapter = {8},
year={2015},
publisher = {ACM},
pages = {92--109},
url = {http://arxiv.org/abs/1406.3278}
}
@ -3706,9 +3677,6 @@ url = {http://arxiv.org/abs/1406.3278}
year = {2015},
isbn = {978-1-4503-3410-5},
pages = {45--60},
numpages = {16},
acmid = {2764475},
publisher = {ACM},
keywords = {auction, revenue, sample complexity},
url = {http://arxiv.org/abs/1407.2479},
}
@ -3729,9 +3697,6 @@ url = {http://arxiv.org/abs/1406.3278}
booktitle = ec07,
year = {2007},
pages = {243--251},
numpages = {9},
acmid = {1250946},
publisher = {ACM},
url = {http://arxiv.org/abs/0808.1671},
}
@ -3756,8 +3721,6 @@ author = "Faruk Gul and Ennio Stacchetti"
volume={10},
number={3},
pages={853--865},
keywords={Substitutability; matching; combinatorial auctions; matroids},
abstract={We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result implies that not every substitutable valuation function can be \"decomposed\" into a combination of unit-demand valuations.},
url={https://econtheory.org/ojs/index.php/te/article/viewFile/20150853/13867/412}
}
@ -3769,10 +3732,9 @@ volume={1084},
series=lncs,
title={Convexity and {S}teinitz's exchange property},
url={http://dx.doi.org/10.1007/3-540-61310-2_20},
publisher={Springer Berlin Heidelberg},
publisher=springer,
author={Murota, Kazuo},
pages={260--274},
language={English}
}
@article{MS99,
@ -3785,7 +3747,6 @@ pages = {95--105},
year = {1999},
URL = {http://dx.doi.org/10.1287/moor.24.1.95},
eprint = {http://dx.doi.org/10.1287/moor.24.1.95},
abstract = { The concept of M-convex function, introduced by Murota (1996), is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress and Wenzel (1990). In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete optimization problems. }
}
@article{FY03,
@ -3798,7 +3759,6 @@ pages = {463--469},
year = {2003},
URL = {http://dx.doi.org/10.1287/moor.28.3.463.16393},
eprint = {http://dx.doi.org/10.1287/moor.28.3.463.16393},
abstract = { In their 1982 article, Kelso and Crawford proposed a gross substitutes condition for the existence of core (and equilibrium) in a two-sided matching model. Since then, this condition has often been used in the literature on matching models and equilibrium models in the presence of indivisibilities. In this paper we prove that a reservation value (or utility) function satisfies the gross substitutes condition if and only if it is an M♮-concave function defined on the unit-hypercube, which is a discrete concave function recently introduced by Murota and Shioura (1999). }
}
@article{MT10,
@ -3811,11 +3771,6 @@ year = "2010",
issn = "0304-4068",
url = "http://www.sciencedirect.com/science/article/pii/S0304406809000627",
author = "Debasis Mishra and Dolf Talman",
keywords = "Assignment model",
keywords = "Walrasian equilibrium",
keywords = "Iterative auctions",
keywords = "Overdemanded set",
keywords = "Underdemanded set "
}
@ -3823,7 +3778,7 @@ keywords = "Underdemanded set "
title={Understanding Machine Learning: From Theory to Algorithms},
author={Shalev-Shwartz, Shai and Ben-David, Shai},
year=2014,
publisher={Cambridge University Press}
publisher=cup
}
@article{BLN13,
@ -3884,7 +3839,6 @@ keywords = "Underdemanded set "
pages={545--561},
year={1996},
url={http://www.keisu.t.u-tokyo.ac.jp/research/techrep/data/2003/METR03-42.pdf},
publisher={SIAM}
}
@article{ST15,
@ -3912,7 +3866,6 @@ keywords = "Underdemanded set "
booktitle=ec07,
pages={736--745},
year={2007},
organization={SIAM},
url={http://eprints.soton.ac.uk/263443/1/finsup.pdf}
}
@ -3943,7 +3896,6 @@ keywords = "Underdemanded set "
pages = {67--71},
numpages = {5},
acmid = {509920},
publisher = {ACM},
url={http://dl.acm.org/citation.cfm?id=509920}
}
@ -3966,7 +3918,6 @@ keywords = "Underdemanded set "
booktitle=ec09,
pages={71--78},
year={2009},
organization={ACM},
url={http://research.microsoft.com/en-us/um/people/nikdev/pubs/adwords.pdf}
}
@ -4010,7 +3961,7 @@ Hartline, Jason D and Talwar, Kunal},
pages={264--280},
year={1971},
url={http://www.springer.com/cda/content/document/cda_downloaddocument/9783642411359-c1.pdf?SGWID=0-0-45-1431218-p175483535},
publisher={SIAM}
publisher=siam
}
@ -4018,7 +3969,7 @@ Hartline, Jason D and Talwar, Kunal},
author = "Anthony, Martin and Bartlett, Peter L",
title = {Neural Network Learning: Theoretical Foundations},
year = {1999},
publisher = {Cambridge University Press},
publisher = cup,
}
@inproceedings{DNRR15,
@ -4027,10 +3978,9 @@ isbn={978-3-662-48799-0},
booktitle=ascrypt15,
title={Pure Differential Privacy for Rectangle Queries via Private Partitions},
url={http://dx.doi.org/10.1007/978-3-662-48800-3_30},
publisher={Springer Berlin Heidelberg},
publisher=springer,
author={Dwork, Cynthia and Naor, Moni and Reingold, Omer and Rothblum, Guy N},
pages={735--751},
language={English}
}
@inproceedings{BartheO13,
@ -4039,10 +3989,10 @@ language={English}
title = {Beyond Differential Privacy: Composition Theorems and Relational Logic
for $f$-divergences between Probabilistic Programs},
booktitle = icalp13,
series = {Lecture Notes in Computer Science},
series = lncs,
volume = {7966},
pages = {49--60},
publisher = {Springer},
publisher = springer,
year = {2013},
url = {http://certicrypt.gforge.inria.fr/2013.ICALP.pdf}
}
@ -4076,11 +4026,9 @@ language={English}
URL = {https://hal.inria.fr/hal-00879140},
BOOKTITLE = {IFIP International Conference on Formal Techniques for Distributed
Objects, Components and Systems (FORTE), Berlin, Germany},
ADDRESS = {Berlin, Germany},
ORGANIZATION = {{IFIP}},
EDITOR = {Erika Abraham and Catuscia Palamidessi},
PUBLISHER = {{Springer}},
SERIES = {Lecture Notes in Computer Science},
PUBLISHER = springer,
SERIES = lncs,
VOLUME = {8461},
PAGES = {199--215},
YEAR = {2014},
@ -4136,25 +4084,27 @@ url = {https://www.cs.colorado.edu/~srirams/papers/sas14-expectations.pdf}
publisher=springer
}
@unpublished{lyu2016understanding,
title={Understanding the Sparse Vector Technique for Differential
Privacy},
@inproceedings{lyu2016understanding,
title={Understanding the Sparse Vector Technique for Differential Privacy},
author={Lyu, Min and Su, Dong and Li, Ninghui},
journal={arXiv preprint arXiv:1603.01699},
booktitle=vldb17,
volume=10,
number=6,
pages={637--648},
url={http://arxiv.org/abs/1603.01699},
year={2016}
year={2017},
}
@unpublished{DBLP:journals/corr/OhV13,
@inproceedings{DBLP:journals/corr/OhV13,
author = {
Peter Kairouz and
Sewoong Oh and
Pramod Viswanath},
title = {The Composition Theorem for Differential Privacy},
journal = {CoRR},
volume = {abs/1311.0776},
booktitle = icml15,
volume = {https://arxiv.org/abs/1311.0776},
year = {2015},
url = {http://arxiv.org/abs/1311.0776},
publisher = jmlr
}
@article{dwork2015reusable,
@ -4202,15 +4152,12 @@ archivePrefix = "arXiv",
year = 2016,
}
@unpublished{BunSU16,
author = {{Bun}, M. and {Steinke}, T. and {Ullman}, J.},
title = {Make Up Your Mind: The Price of Online Queries in Differential Privacy},
journal = {ArXiv e-prints},
archivePrefix = "arXiv",
eprint = {1604.04618},
primaryClass = "cs.CR",
keywords = {Computer Science - Cryptography and Security, Computer Science - Data Structures and Algorithms, Computer Science - Learning},
year = 2016,
@inproceedings{BunSU16,
author = {Bun, Mark and Steinke, Thomas and Ullman, Jonathan},
title = {Make Up Your Mind: The Price of Online Queries in Differential Privacy},
booktitle = soda17,
year = 2017,
url = {https://arxiv.org/abs/1604.04618}
}
@inproceedings{moser2009constructive,
@ -4237,23 +4184,11 @@ archivePrefix = "arXiv",
year={1991},
}
@article{barthe2013probabilistic,
title={Probabilistic relational reasoning for differential privacy},
author={Barthe, Gilles and K{\"o}pf, Boris and Olmedo, Federico and
Zanella-B{\'e}guelin, Santiago},
journal=toplas,
volume={35},
number={3},
pages={9},
year={2013},
url={http://software.imdea.org/~bkoepf/papers/toplas13.pdf}
}
@article{rogers2016privacy,
title={Privacy Odometers and Filters: Pay-as-you-Go Composition},
author={Rogers, Ryan and Roth, Aaron and Ullman, Jonathan and Vadhan,
Salil},
journal={arXiv preprint arXiv:1605.08294},
@inproceedings{rogers2016privacy,
title={Privacy odometers and filters: Pay-as-you-go composition},
author={Rogers, Ryan and Vadhan, Salil and Roth, Aaron and Ullman, Jonathan},
booktitle=nips16,
pages={1921--1929},
year={2016},
url={http://arxiv.org/abs/1605.08294}
}
@ -4277,12 +4212,15 @@ archivePrefix = "arXiv",
year={2012},
}
@article{zhang2016autopriv,
title={AutoPriv: Automating Differential Privacy Proofs},
author={Zhang, Danfeng and Kifer, Daniel},
journal={arXiv preprint arXiv:1607.08228},
year={2016}
}
@inproceedings{zhang2016autopriv,
author = {Zhang, Danfeng and Kifer, Daniel},
title = {{LightDP}: Towards Automating Differential Privacy Proofs},
booktitle = popl17,
year = {2017},
pages = {888--901},
url = {https://arxiv.org/abs/1607.08228},
}
@article{JerrumS89,
author = {Mark Jerrum and
@ -4317,3 +4255,15 @@ archivePrefix = "arXiv",
bibsource = {dblp computer science bibliography,
http://dblp.org}
}
@inproceedings{Sato16,
title = {Approximate Relational {H}oare Logic for Continuous Random Samplings},
author = {Tetsuya Sato},
booktitle = mfps16,
pages = {277--298},
year = 2016,
volume = 325,
url = {https://arxiv.org/abs/1603.01445},
series = entcs,
publisher = elsevier
}

6
content/news.md
View File

@ -1,3 +1,5 @@
+ **03/2017** Our paper **Proving uniformity and independence by
self-composition and coupling** will appear at **LPAR 2017**!
+ **01/2017** Our preprint **Proving uniformity and independence by
self-composition and coupling** is now available.
+ **01/2017** Slides now available for **Coupling proofs are probabilistic
@ -18,7 +20,3 @@
appear at **POPL 2017**!
+ **09/2016** Our paper **Computer-aided verification in mechanism design** will
appear at **WINE 2016**!
+ **07/2016** Our paper **Advanced probabilistic couplings for differential
privacy** will appear at **CCS 2016**!
+ **07/2016** Our paper **Differentially private Bayesian programming** will
appear at **CCS 2016**!