TCS 50 most recent publications

We present the 50 most recent publications at Theoretical Computer Science. If you are interested in older publications, please use KTH DiVA (http://kth.diva-portal.org/) or KTHB (https://www.kth.se/kthb).

Link to the full list for TMH  in the KTH publication portal here and in the bottom of the list.

TCS publications

[1]
B. Bukh, V. Guruswami and J. Håstad, "An Improved Bound on the Fraction of Correctable Deletions," IEEE Transactions on Information Theory, vol. 63, no. 1, pp. 93-103, 2017.
[2]
E. Enström and V. Kann, "Iteratively Intervening with the “Most Difficult” Topics of an Algorithms and Complexity Course," ACM Transactions on Computing Education, vol. 17, no. 1, 2017.
[4]
C. Artho and P. C. Olveczky, "Formal Techniques for Safety-Critical Systems (FTSCS 2014) Preface," Science of Computer Programming, vol. 133, pp. 89-90, 2017.
[5]
M. Vinyals, "Space in Proof Complexity," Doctoral thesis Stockholm : KTH Royal Institute of Technology, TRITA-CSC-A, 2017:15, 2017.
[6]
G. Rodríguez-Cano, "Toward Privacy-Preserving Decentralised Systems," Licentiate thesis Stockholm : KTH Royal Institute of Technology, TRITA-CSC-A, 2017:12, 2017.
[7]
M. Lauria et al., "The complexity of proving that a graph is Ramsey," Combinatorica, vol. 37, no. 2, pp. 253-268, 2017.
[8]
V. Guruswami et al., "SUPER-POLYLOGARITHMIC HYPERGRAPH COLORING HARDNESS VIA LOW-DEGREE LONG CODES," SIAM journal on computing (Print), vol. 46, no. 1, pp. 132-159, 2017.
[9]
J. Alwen et al., "Cumulative Space in Black-White Pebbling and Resolution," in 8th Innovations in Theoretical Computer Science (ITCS) conference, Berkeley, January 9-11, 2017, 2017.
[10]
B. Greschbach et al., "The Effect of DNS on Tor’s Anonymity," in Network and Distributed System Security (NDSS) Symposium 2017, 2017.
[11]
J. Andersson-Schwarz et al., "Transaktionsdimman på nätet hotar digitaliseringen," Dagens Nyheter, 2017.
[12]
M. Ekerå and J. Håstad, "Quantum algorithms for computing short discrete logarithms and factoring RSA integers," in 8th International Workshop on Post-Quantum Cryptography, PQCrypto 2017, 2017, pp. 347-363.
[13]
C. Ansotegui et al., "Structure features for SAT instances classification," Journal of Applied Logic, vol. 23, pp. 27-39, 2017.
[14]
P. De Carvalho Gomes, D. Gurov and M. Huisman, "Specification and verification of synchronization with condition variables," in 5th International Workshop on Formal Techniques for Safety-Critical Systems, FTSCS 2016, 2017, pp. 3-19.
[15]
M. Parks, J. Karlgren and S. Stymne, "Plausibility Testing for Lexical Resources," in Proceedings of CLEF 2017 : Information Access Evaluation meets Multilinguality, Multimodality, and Visualization, 2017.
[16]
M. Amundin et al., "A proposal to use distributional models to analyse dolphin vocalization," in 1st International Workshop on Vocal Interactivity in-and-between Humans, Animals and Robots, 2017, 2017.
[18]
M. Lauria et al., "CNFgen : A generator of crafted benchmarks," in 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, 2017, pp. 464-473.
[19]
L. Wiener, T. Ekholm and P. Haller, "Modular responsiveweb design : An experience report," in Proceeding Programming '17 Companion to the first International Conference on the Art, Science and Engineering of Programming, 2017.
[20]
M. Lauria and J. Nordström, "Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases," in 32nd Computational Complexity Conference (CCC 2017), 2017.
[22]
G. Baud-Berthier, J. Giráldez-Cru and L. Simon, "On the community structure of bounded model checking SAT problems," in 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, 2017, pp. 65-82.
[23]
M. García Lozano, J. Schreiber and J. Brynielsson, "Tracking Geographical Locations using a Geo-Aware Topic Model for Analyzing Social Media Data," Decision Support Systems, vol. 99, no. SI, pp. 18-29, 2017.
[24]
P. Haller and F. Sommar, "Towards an Empirical Study of Affine Types for Isolated Actors in Scala," Electronic Proceedings in Theoretical Computer Science, no. 246, pp. 3-9, 2017.
[25]
J. Westman et al., "Formal Architecture Modeling of Sequential Non-Recursive C Programs," Science of Computer Programming, vol. 146, pp. 2-27, 2017.
[26]
M. Minock, "COVER : Covering the semantically tractable questions," in 15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017 - Proceedings of the Software Demonstrations, 2017, pp. 1-4.
[27]
I. Bonacina and N. Talebanfard, "Strong ETH and Resolution via Games and the Multiplicity of Strategies," Algorithmica, vol. 79, no. 1, pp. 29-41, 2017.
[28]
D. Nanongkai and T. Saranurak, "Dynamic spanning forest with worst-case update time : Adaptive, las vegas, and O(n1/2-∈) - Time," in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, pp. 1122-1129.
[29]
D. Gurov et al., "Deductive Functional Verification of Safety-Critical Embedded C-Code: An Experience Report," in Critical Systems: Formal Methods and Automated Verification, 2017, pp. 3-18.
[30]
H. Nemati, "Secure System Virtualization : End-to-End Verification of Memory Isolation," Doctoral thesis Stockholm : KTH Royal Institute of Technology, TRITA-CSC-A, 2017:18, 2017.
[33]
A. Atserias, M. Lauria and J. Nordström, "Narrow Proofs May Be Maximally Long," ACM Transactions on Computational Logic, vol. 17, no. 3, 2016.
[34]
[35]
J. Brynielsson, U. Franke and S. Varga, "Cyber Situational Awareness Testing," in Combatting Cybercrime and Cyberterrorism : Challenges, Trends and Priorities, Akhgar, Babak; Brewster, Ben Ed., Cham, Switzerland : Springer International Publishing AG, 2016, pp. 209-233.
[36]
I. Bonacina, N. Galesi and N. Thapen, "TOTAL SPACE IN RESOLUTION," SIAM journal on computing (Print), vol. 45, no. 5, pp. 1894-1909, 2016.
[37]
O. Schwarz, "No Hypervisor Is an Island : System-wide Isolation Guarantees for Low Level Code," Doctoral thesis Stockholm : KTH Royal Institute of Technology, TRITA-CSC-A, 2016:22, 2016.
[38]
M. Mikša, "On Complexity Measures in Polynomial Calculus," Doctoral thesis Stockholm, Sweden : KTH Royal Institute of Technology, TRITA-CSC-A, 2017:02, 2016.
[39]
B. Greschbach, "Privacy Issues in Decentralized Online Social Networks and other Decentralized Systems," Doctoral thesis Stockholm : KTH Royal Institute of Technology, TRITA-CSC-A, 2016:28, 2016.
[40]
P. Austrin, S. Benabbas and K. Georgiou, "Better Balance by Being Biased : A 0.8776-Approximation for Max Bisection," ACM Transactions on Algorithms, vol. 13, no. 1, 2016.
[41]
P. Austrin, S. Benabbas and K. Georgiou, "Better Balance by Being Biased : A 0.8776-Approximation for Max Bisection," ACM Transactions on Algorithms, vol. 13, no. 1, 2016.
[42]
P. Haller and A. Loiko, "LACASA : Lightweight Affinity and Object Capabilities in Scala," SIGPLAN notices, vol. 51, no. 10, pp. 272-291, 2016.
[43]
R. Guanciale et al., "Provably secure memory isolation for Linux on ARM : Submission to special issue on Verified Information Flow Security," Journal of Computer Security, vol. 24, no. 6, pp. 793-837, 2016.
[45]
C. Baumann et al., "A High Assurance Virtualization Platform for ARMv8," in Networks and Communications (EuCNC), 2016 European Conference on, 2016.
[46]
D. Nilsson, M. Sahlgren and J. Karlgren, "Dead Man Tweeting," in RE-WOCHAT Workshop on Collecting and Generating Resources for Chatbots and Conversational Agents : Development and Evaluation, 2016.
[47]
V. Kann and A.-K. Högfeldt, "Effects of a Program Integrating Course for Students ofComputer Science and Engineering," in Proc. 47th ACM Technical Symposium on Computing Science Education, 2016, pp. 510-515.
[48]
D. Wikström, "Simplified universal composability framework," in 13th International Conference on Theory of Cryptography, TCC 2016, 2016, pp. 566-595.
[49]
V. Murdock et al., "Second Workshop on Search and Exploration of X-Rated Information (SEXI'16) : WSDM workshop summary," in WSDM 2016 - Proceedings of the 9th ACM International Conference on Web Search and Data Mining, 2016, pp. 697-698.
[50]
O. Schwarz and M. Dam, "Automatic Derivation of Platform Noninterference Properties," in Software Engineering and Formal Methods, Springer LNCS 9763, 2016, pp. 27-44.
Full list in the KTH publications portal
Top page top