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
2009

[1] Irem Aktug, Mads Dam, and Dilian Gurov. Provably correct runtime monitoring. J. Log. Algebr. Program., 78(5):304-339, 2009. [ bib | .pdf ]
[2] Per Austrin and Johan Håstad. Randomly supported independence and resistance. In Proceedings of the 41st annual ACM symposium on Theory of computing, STOC '09, pages 483-492, New York, NY, USA, 2009. ACM. [ bib | .pdf ]
[3] Musard Balliu and Isabella Mastroeni. A weakest precondition approach to active attacks analysis. In PLAS, pages 59-71, 2009. [ bib | .pdf ]
[4] Eli Ben-Sasson and Jakob Nordström. A space hierarchy for k-dnf resolution. Electronic Colloquium on Computational Complexity (ECCC), 16:47, 2009. [ bib ]
[5] Eli Ben-Sasson and Jakob Nordström. Understanding space in resolution: Optimal lower bounds and exponential trade-offs. Electronic Colloquium on Computational Complexity (ECCC), 16:34, 2009. [ bib ]
[6] Mika Cohen, Mads Dam, Alessio Lomuscio, and Hongyang Qu. A data symmetry reduction technique for temporal-epistemic logic. In ATVA, pages 69-83, 2009. [ bib ]
[7] Mika Cohen, Mads Dam, Alessio Lomuscio, and Hongyang Qu. A symmetry reduction technique for model checking temporal-epistemic logic. In IJCAI, pages 721-726, 2009. [ bib ]
[8] Mika Cohen, Mads Dam, Alessio Lomuscio, and Francesco Russo. Abstraction in model checking multi-agent systems. In AAMAS (2), pages 945-952, 2009. [ bib ]
[9] H. Dalianis, M. Rimka, and V. Kann. Using Uplug and SiteSeeker to construct a cross language search engine for Scandinavian. In Proc. NODALIDA 2009, Odense, Denmark, 2009. [ bib | .pdf ]
[10] Mads Dam, Bart Jacobs, Andreas Lundblad, and Frank Piessens. Security monitor inlining for multithreaded Java. In Sophia Drossopoulou, editor, ECOOP 2009 - Object-Oriented Programming, 23rd European Conference, Genova, Italy, July 6-10, 2009, Proceedings,, pages 546-569. Springer-Verlag, July 2009. [ bib | http | .pdf ]
[11] D. Gurov and M. Huisman. Reducing behavioural to structural properties of programs with procedures. In Verification, Model Checking, and Abstract Interpretation (VMCAI '09), volume 5403 of LNCS, pages 136-150. Springer, 2009. [ bib | .pdf ]
[12] Johan Håstad. On the approximation resistance of a random predicate. Comput. Complex., 18:413-434, October 2009. [ bib | DOI | .pdf ]
[13] M. Huisman and D. Gurov. Composing modal properties of programs with procedures. In Formal Foundations of Embedded Software and Component-Based Software Architectures (FESCA '07), volume 203 of Electronic Notes in Theoretical Computer Science, pages 87-101. Elsevier Publishing, 2009. [ bib | .pdf ]
[14] V. Kann. Lärarbemanning för kvalitet, in swedish. In Proc. Kvalitetskonferensen 2009, Högskoleverket, Stockholm, Sweden", 2009. [ bib | .pdf ]
[15] Jakob Nordström. Narrow proofs may be spacious: Separating space and width in resolution. SIAM J. Comput., 39(1):59-121, 2009. [ bib | .pdf ]
[16] Jakob Nordström. A simplified way of proving trade-off results for resolution. Inf. Process. Lett., 109(18):1030-1035, 2009. [ bib | .pdf ]
[17] Rafael Pass, Wei-Lung Dustin Tseng, and Douglas Wikström. On the composition of public-coin zero-knowledge protocols. In CRYPTO, pages 160-176, 2009. [ bib ]
[18] M. Rosell, M. Hassel, and V. Kann. Global evaluation of random indexing through swedish word clustering compared to the people's dictionary of synonyms. In Proc. RANLP 2009, Borovets, Bulgaria, 2009. [ bib | .pdf ]
[19] Douglas Wikström. A commitment-consistent proof of a shuffle. In ACISP, pages 407-421, 2009. [ bib ]
[20] Fetahi Wuhib, Rolf Stadler, and Mads Dam. Gossiping for threshold detection. In Integrated Network Management, pages 259-266, 2009. [ bib ]

This file was generated by bibtex2html 1.96.

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