bild
School of
Electrical Engineering
and Computer Science
Warning: You are viewing outdated content. The current TCS webpage is here.

Bibliography of Theoretical Computer Science, KTH
2010

[1] Musard Balliu and Isabella Mastroeni. A weakest precondition approach to robustness. Transactions on Computational Science, 10:261-297, 2010. [ bib | .pdf ]
[2] Therese Bohlin, Bengt Jonsson, and Siavash Soleimanifard. Inferring compact models of communication protocol entities. In Tiziana Margaria and Bernhard Steffen, editors, Leveraging Applications of Formal Methods, Verification, and Validation, volume 6415 of Lecture Notes in Computer Science, pages 658-672. Springer, 2010. [ bib | .pdf ]
[3] Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, and Ola Svensson. Approximating linear threshold predicates. In Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, APPROX/RANDOM'10, pages 110-123, Berlin, Heidelberg, 2010. Springer-Verlag. [ bib | .pdf ]
[4] Mads Dam, Bart Jacobs, Andreas Lundblad, and Frank Piessens. Provably correct inline monitoring for multithreaded java-like programs. Journal of Computer Security, 18(1):37-59, 2010. [ bib | .pdf ]
[5] Mads Dam and Andreas Lundblad. A proof carrying code framework for inlined reference monitors in java bytecode. CoRR, abs/1012.2995, 2010. [ bib ]
[6] Anwitaman Datta, Sonja Buchegger, Le-Hung Vu, Krzysztof Rzadca, and Thorsten Strufe. Handbook of Social Network Technologies and Applications, chapter Decentralized Online Social Networks. Springer, 2010. [ bib | .pdf ]
[7] Emma Enström and Viggo Kann. Computer lab work on theory. In ITiCSE, pages 93-97, 2010. [ bib | .pdf ]
[8] Emma Enström, Gunnar Kreitz, Fredrik Niemelä, and Viggo Kann. Testdriven utbildning - strukturerad formativ examination. In NU, 2010. [ bib | .pdf ]
[9] Venkatesan Guruswami, Johan Håstad, and Swastik Kopparty. On the list-decodability of random linear codes. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 409-416, New York, NY, USA, 2010. ACM. [ bib | .pdf ]
[10] Johan Håstad, Rafael Pass, Douglas Wikström, and Krzysztof Pietrzak. An efficient parallel repetition theorem. In TCC, pages 1-18, 2010. [ bib | .pdf ]
[11] M. Huisman and D. Gurov. CVPP: A tool set for compositonal verification of control-flow safety properties. In Formal Verification of Object-Oriented Software (FoVeOOS '10), volume 6528 of LNCS, pages 107-121. Springer, 2010. [ bib | .pdf ]
[12] Kristján Valur Jónsson and Mads F. Dam. Towards flexible and secure distributed aggregation. In AIMS, pages 159-162, 2010. [ bib ]
[13] V. Kann. Kan kvalitet på ett elitcollege föras över till svenska förhållanden? In Proc. NU2010, Stockholms Universitet, Stockholm, 2010. [ bib | .pdf ]
[14] V. Kann. Kths morfologiska och lexikografiska verktyg och resurser. LexicoNordica, 17:99-117, 2010. [ bib | .pdf ]
[15] Gunnar Kreitz, Mads Dam, and Douglas Wikström. Practical private information aggregation in large networks. In NordSec, 2010. [ bib | .pdf ]
[16] Gunnar Kreitz and Fredrik Niemelä. Spotify - large scale, low latency, p2p music-on-demand streaming. In Peer-to-Peer Computing, pages 1-10, 2010. [ bib | .pdf ]
[17] Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, and Fetahi Wuhib. The accuracy of tree-based counting in dynamic networks. CoRR, abs/1004.4559, 2010. [ bib ]
[18] Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, and Fetahi Zebenigus Wuhib. Brief announcement: the accuracy of tree-based counting in dynamic networks. In PODC, pages 291-292, 2010. [ bib ]
[19] Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, and Nelson A. Uhan. Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters, 2010. [ bib | .html ]
[20] Karl Meinke. Cge: A sequential learning algorithm for mealy automata. In ICGI, pages 148-162, 2010. [ bib | http ]
[21] Karl Meinke and Fei Niu. A learning-based approach to unit testing of numerical software. In Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems, ICTSS'10, pages 221-235, 2010. [ bib | .pdf ]
[22] Karl Palmskog, Alberto Gonzalez Prieto, Catalin Meirosu, Rolf Stadler, and Mads Dam. Scalable metadata-directed search in a network of information. In Proceedings of Future Network & Mobile Summit, June 2010. [ bib | .pdf ]
[23] Thomas Paul, Sonja Buchegger, and Thorsten Strufe. Decentralizing social networking services. In International Tyrrhenian Workshop on Digital Communications, pages 1-10, 2010. Invited Paper. [ bib | .pdf ]
[24] Bartosz Przydatek and Douglas Wikström. Group message authentication. In SCN, pages 399-417, 2010. [ bib ]
[25] M. Rosell and V. Kann. Global evaluation of random indexing through swedish word clustering compared to the people's dictionary of synonyms. In Proc. SLTC 2010, Linköpings universitet, 2010. [ bib | .pdf ]
[26] Krzysztof Rzadca, Anwitaman Datta, and Sonja Buchegger. Replica placement in p2p storage: Complexity and game theoretic analyses. Distributed Computing Systems, International Conference on, 0:599-609, 2010. [ bib | DOI | .pdf ]
[27] S. Soleimanifard, D. Gurov, and M. Huisman. Procedure-modular verification of control flow safety properties. In Workshop on Formal Techniques for Java Programs (FTfJP '10), 2010. Accessible via the web. [ bib | http | .pdf ]
[28] Ola Svensson. Conditional hardness of precedence constrained scheduling on identical machines. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pages 745-754, 2010. [ bib | .pdf ]
[29] Björn Terelius and Douglas Wikström. Proofs of restricted shuffles. In AFRICACRYPT, pages 100-113, 2010. [ bib ]

This file was generated by bibtex2html 1.96.

Published by: Stephan Gocht <gocht@kth.se>
Updated 2011-04-16