bild
School of
Computer Science
and Communication
KTH / CSC / TCS / Publications / 2011

Bibliography of Theoretical Computer Science, KTH
2011/

[1] T. Alpcan and S. Buchegger. Security games for vehicular networks. Mobile Computing, IEEE Transactions on, 10(2):280 -290, feb. 2011. [ bib | DOI | .pdf ]
[2] Per Austrin and Johan Håstad. Randomly supported independence and resistance. SIAM J. Comput., 40(1):1-27, 2011. [ bib | .pdf ]
[3] M. Balliu, M. Dam, and G. Le Guernic. Epistemic temporal logic for information flow security. In Programming Languages and Analysis for Security (PLAS 2011 ), 2011. [ bib | .pdf ]
[4] Eli Ben-Sasson and Jakob Nordström. Understanding space in proof complexity: Separations and trade-offs via substitutions. In Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS '11), pages 401-416, January 2011. Full-length version available at http://eccc.hpi-web.de/report/2010/125/. [ bib ]
[5] Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, and Ning Xie. On the semantics of local characterizations for linear-invariant properties. Submitted. Preliminary version available at http://www.csc.kth.se/~jakobn/research/, 2011. [ bib ]
[6] Oleksandr Bodriagov and Sonja Buchegger. Encryption for peer-to-peer social networks. In SocialCom/PASSAT, pages 1302-1309, 2011. [ bib ]
[7] E. Enstrom, G. Kreitz, F. Niemela, P. Soderman, and V. Kann. Five years with kattis #x2014; using an automated assessment system in teaching. In Frontiers in Education Conference (FIE), 2011, pages T3J-1 -T3J-6, oct. 2011. [ bib | DOI ]
[8] Mikael Goldmann and Gunnar Kreitz. Measurements on the spotify peer-assisted music-on-demand streaming system. In IEEE P2P 2011, pages 1-8, 2011. [ bib | .pdf ]
[9] Benjamin Greschbach. Location privacy: User-centric threat analyis. In Seventh European Conference on Computer Network Defense, EC2ND 2011, September 6-7, 2011, Gothenburg, Sweden. IEEE, 2011. Student Session Abstract. [ bib | .pdf ]
[10] Venkatesan Guruswami, Johan Håstad, and Swastik Kopparty. On the list-decodability of random linear codes. IEEE Transactions on Information Theory, 57(2):718-725, 2011. [ bib | .pdf ]
[11] Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, and Moses Charikar. Beating the random ordering is hard: Every ordering csp is approximation resistant. Electronic Colloquium on Computational Complexity (ECCC), 18:27, 2011. [ bib | .pdf ]
[12] Johan Håstad. Satisfying degree-d equations of gf(2)n. In APPROX 2011, volume 6845 of Lecture Notes in Computer Science, pages 242-253, 2011. [ bib | .pdf ]
[13] K. Jansen, L. Praedel, U. Schwarz, and O. Svensson. Faster approximation algorithms for scheduling with fixed jobs. In Alex Potanin and Taso Viglas, editors, Computing: The Australasian Theory Symposium (CATS 2011), volume 119 of CRPIT, pages 3-10, Perth, Australia, 2011. ACS. [ bib | .pdf ]
[14] Gunnar Kreitz. Timing is everything - the importance of history detection. In European Symposium on Research in Computer Security (ESORICS) 2011, pages 117-132, 2011. [ bib | .pdf ]
[15] Gunnar Kreitz. A zero-one law for secure multi-party computation with ternary outputs. In TCC, 2011. [ bib | .pdf ]
[16] Karl Meinke and Fei Niu. Learning-based testing for reactive systems using term rewriting technology. In Proceedings of the 22nd IFIP International Conference on Testing Software and Systems, volume 7019 of LNCS, pages 97-114, Berlin, Heidelberg, 2011. Springer. [ bib | .pdf ]
[17] Karl Meinke and Muddassar Sindhu. Incremental learning-based testing for reactive systems. In TAP 2011, volume 6706 of Lecture Notes in Computer Science, pages 134-151, 2011. [ bib | .pdf ]
[18] Niels Möller and Torbjörn Granlund. Improved division by invariant integers. IEEE Transactions on Computers, February 2011. [ bib ]
[19] Tobias Mömke. Structural properties of hard metric TSP inputs. In Proceedings of the 37th international conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), volume 6543 of Lecture Notes in Computer Science, pages 394-405, 2011. [ bib | .pdf ]
[20] Jakob Nordström. New wine into old wineskins: A survey of some pebbling classics with supplemental results. Manuscript in preparation. To appear in Foundations and Trends in Theoretical Computer Science, 2011. [ bib | http ]
[21] Jakob Nordström. On the relative strength of pebbling and resolution. ACM Transactions on Computational Logic, 2011. To appear. [ bib ]
[22] Jakob Nordström. Pebble games, proof complexity and time-space trade-offs. Logical Methods in Computer Science, 2011. To appear. [ bib | http ]
[23] Jakob Nordström and Alexander Razborov. On minimal unsatisfiability and time-space trade-offs for k-DNF resolution. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP '11), July 2011. To appear. [ bib ]
[24] Rafael Pass, Wei-Lung Dustin Tseng, and Douglas Wikström. On the composition of public-coin zero-knowledge protocols. SIAM J. Comput., 40(6):1529-1553, 2011. [ bib ]
[25] Klaus Rechert and Benjamin Greschbach. Location privacy in relation to trusted peers. In Catherine Meadows and Carmen Fernández Gago, editors, Security and Trust Management - 7th International Workshop, STM 2011, Copenhagen, Denmark, June 27-28, 2011, Revised Selected Papers, volume 7170 of Lecture Notes in Computer Science, pages 106-121. Springer Berlin / Heidelberg, 2011. [ bib | DOI | .pdf ]
[26] Klaus Rechert, Konrad Meier, Benjamin Greschbach, Dennis Wehrle, and Dirk von Suchodoletz. Assessing location privacy in mobile communication networks. In Xuejia Lai, Jianying Zhou, and Hui Li, editors, Information Security, 14th International Conference, ISC 2011, Xi'an, China, October 26-29, 2011. Proceedings, volume 7001 of Lecture Notes in Computer Science, pages 309-324. Springer Berlin / Heidelberg, 2011. [ bib | DOI | .pdf ]
[27] Ina Schaefer, Dilian Gurov, and Siavash Soleimanifard. Compositional algorithmic verification of software product lines. In International Symposium on Formal Methods for Components and Objects (FMCO 2010), volume 6957 of Lecture Notes in Computer Science, pages 184-203, 2011. [ bib | .pdf ]
[28] Muddassar Sindhu. Incremental learning and testing of reactive systems, 2011. QC 20110822. [ bib | .pdf ]
[29] Siavash Soleimanifard, Dilian Gurov, and Marieke Huisman. Promover: Modular verification of temporal safety properties. In International Conference on Software Engineering and Formal Methods (SEFM 2011), volume 7041 of Lecture Notes in Computer Science, pages 366-381, 2011. [ bib | .pdf ]
[30] Ola Svensson. Santa claus schedules jobs on unrelated machines. In Proceedings of the 43nd ACM Symposium on Theory of Computing (STOC), 2011. [ bib | .pdf ]

This file was generated by bibtex2html 1.96.

Published by: Siavash Soleimanifard <siavashs@csc.kth.se>
Updated 2013-01-08