pdfformat: 

@InProceedings{barak:LIPIcs:2015:5662, author = {Boaz Barak}, title = {{Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk)}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {77}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897972}, ISSN = {18688969}, year = {2015}, volume = {45}, editor = {Prahladh Harsha and G. Ramalingam}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5662}, URN = {urn:nbn:de:0030drops56626}, doi = {10.4230/LIPIcs.FSTTCS.2015.7}, annote = {Keywords: Convex programming, Bayesian probability, Averagecase complexity, Planted clique} }
Keywords:  Convex programming, Bayesian probability, Averagecase complexity, Planted clique  
Seminar:  35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)  
Issue date:  2015  
Date of publication:  2015 