Warning: You are viewing outdated content. The current TCS webpage is here.

Bibliography of Theoretical Computer Science, KTH
2013/

[1]	Per Austrin, Siavosh Benabbas, and Konstantinos Georgiou. Better Balance by Being Biased: a 0.8776-Approximation for Max Bisection. To appear in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013. [ bib \| arXiv ]
[2]	Per Austrin, Johan Håstad, and Rafael Pass. On the power of many one-bit provers. To appear in Innovations in Theoretical Computer Science (ITCS), 2013. [ bib ]
[3]	Per Austrin and Subhash Khot. A Characterization of Approximation Resistance for Even k-Partite CSPs. To appear in Innovations in Theoretical Computer Science (ITCS), 2013. [ bib ]
[4]	Olle Bälter, Emma Enström, and Bernhard Klingenberg. The effect of short formative diagnostic web quizzes with minimal feedback. Computers & Education, 60(1):234 - 242, 2013. [ bib \| DOI \| http ]
[5]	Oleksandr Bodriagov and Sonja Buchegger. Encryption for peer-to-peer social networks. In Yaniv Altshuler, Yuval Elovici, Armin B. Cremers, Nadav Aharony, and Alex Pentland, editors, Security and Privacy in Social Networks, pages 47-65. Springer New York, 2013. [ bib \| DOI \| http ]
[6]	Michael Minock and Johan Mollevik. Context-dependent "near" and "far" in spatial databases via supervaluation. Journal of Data and Knowledge Engineering (DKE), 2013. Revised manuscript under review. [ bib ]

This file was generated by bibtex2html 1.96.