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 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," 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]
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, pp. 18-29, 2017.
[10]
P. De Carvalho Gomes, D. Gurov and M. Huisman, "Specification and verification of synchronization with condition variables," pp. 3-19, 2017 in 5th International Workshop on Formal Techniques for Safety-Critical Systems, FTSCS 2016, 2017, pp. 3-19.
[11]
J. Alwen et al., "Cumulative Space in Black-White Pebbling and Resolution," 2017 in 8th Innovations in Theoretical Computer Science (ITCS) conference, Berkeley, January 9-11, 2017, 2017.
[12]
B. Greschbach et al., "The Effect of DNS on Tor’s Anonymity," 2017 in Network and Distributed System Security (NDSS) Symposium 2017, 2017.
[15]
A. Atserias, M. Lauria and J. Nordström, "Narrow Proofs May Be Maximally Long," ACM Transactions on Computational Logic, vol. 17, no. 3, 2016.
[16]
P. Haller and E. Gonzalez Boix, "Special issue on the 3rd and 4th ACM SIGPLAN workshops on programming based on actors, agents, and decentralized control (AGERE! 2013/2014)," Computer languages, systems & structures, pp. 161-162, 2016.
[17]
J. Brynielsson, U. Franke and S. Varga, "Cyber Situational Awareness Testing," pp. 209-233, 2016in Combatting Cybercrime and Cyberterrorism : Challenges, Trends and Priorities, Akhgar, Babak; Brewster, Ben Ed., Cham, Switzerland : Springer International Publishing AG, 2016, pp. 209-233.
[18]
I. Bonacina, N. Galesi and N. Thapen, "TOTAL SPACE IN RESOLUTION," SIAM journal on computing (Print), vol. 45, no. 5, pp. 1894-1909, 2016.
[19]
J. Westman et al., "Formal Architecture Modeling of Sequential Non-Recursive C Programs," Science of Computer Programming, 2016.
[23]
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.
[24]
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.
[25]
P. Haller and A. Loiko, "LACASA : Lightweight Affinity and Object Capabilities in Scala," SIGPLAN notices, vol. 51, no. 10, pp. 272-291, 2016.
[26]
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.
[28]
C. Baumann et al., "A High Assurance Virtualization Platform for ARMv8," 2016 in Networks and Communications (EuCNC), 2016 European Conference on, 2016.
[29]
D. Nilsson, M. Sahlgren and J. Karlgren, "Dead Man Tweeting," 2016 in RE-WOCHAT Workshop on Collecting and Generating Resources for Chatbots and Conversational Agents : Development and Evaluation, 2016.
[30]
V. Kann and A.-K. Högfeldt, "Effects of a Program Integrating Course for Students ofComputer Science and Engineering," pp. 510-515, 2016 in Proc. 47th ACM Technical Symposium on Computing Science Education, 2016, pp. 510-515.
[31]
D. Wikström, "Simplified universal composability framework," pp. 566-595, 2016 in 13th International Conference on Theory of Cryptography, TCC 2016, 2016, pp. 566-595.
[32]
V. Murdock et al., "Second Workshop on Search and Exploration of X-Rated Information (SEXI'16) : WSDM workshop summary," pp. 697-698, 2016 in WSDM 2016 - Proceedings of the 9th ACM International Conference on Web Search and Data Mining, 2016, pp. 697-698.
[33]
O. Schwarz and M. Dam, "Automatic Derivation of Platform Noninterference Properties," pp. 27-44, 2016 in Software Engineering and Formal Methods, Springer LNCS 9763, 2016, pp. 27-44.
[34]
P. Austrin et al., "Dense Subset Sum may be the hardest," 2016 in Leibniz International Proceedings in Informatics, LIPIcs, 2016.
[35]
H. Miller et al., "Function Passing: A Model for Typed, Distributed Functional Programming," pp. 82-97, 2016 in ACM Symposium on New Ideas in Programming and Reflections on Software (Onward!), 2016, pp. 82-97.
[36]
C. Berkholz and J. Nordström, "Supercritical space-width trade-offs for resolution," 2016 in Leibniz International Proceedings in Informatics, LIPIcs, 2016.
[37]
F. Howar, K. Meinke and A. Rausch, "Learning Systems : Machine-Learning in Software Products and Learning-Based Analysis of Software Systems Special Track at ISoLA 2016," pp. 651-654, 2016 in LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION AND VALIDATION : DISCUSSION, DISSEMINATION, APPLICATIONS, ISOLA 2016, PT II, 2016, pp. 651-654.
[38]
D. Gurov et al., "Static and Runtime Verification, Competitors or Friends? : (Track Summary)," pp. 397-401, 2016 in LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION AND VALIDATION : FOUNDATIONAL TECHNIQUES, PT I, 2016, pp. 397-401.
[39]
J. Brynielsson et al., "Using Cyber Defense Exercises to Obtain Additional Data for Attacker Profiling," pp. 37-42, 2016 in Proceedings of the 14th IEEE International Conference on Intelligence and Security Informatics (ISI 2016), 2016, pp. 37-42.
[40]
H. Lilja, J. Brynielsson and S. Lindquist, "Identifying Radio Communication Inefficiency to Improve Air Combat Training Debriefings," pp. 1-12, 2016 in Proceedings of the 2016 Interservice/Industry Training, Simulation, and Education Conference (I/ITSEC 2016), 2016, pp. 1-12.
[41]
J. Brynielsson, S. Lindquist and L. Luotsinen, "Efficient Implementation of Simulation Support for Tactical-Level Military Training," pp. 1-12, 2016 in Proceedings of the 2016 Interservice/Industry Training, Simulation, and Education Conference (I/ITSEC 2016), 2016, pp. 1-12.
[42]
C. Berkholz and J. Nordström, "Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps," pp. 267-276, 2016 in PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, pp. 267-276.
[43]
R. Guanciale and E. Tuosto, "An Abstract Semantics of the Global View of Choreographies," 2016 in Proceedings 9th Interaction and Concurrency Experience, 2016.
[44]
S. Bhattacharya, M. Henzinger and D. Na Nongkai, "New deterministic approximation algorithms for fully dynamic matching," pp. 398-411, 2016 in 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, 19 June 2016 through 21 June 2016, 2016, pp. 398-411.
[45]
P. Haller et al., "Reactive Async : Expressive Deterministic Concurrency," pp. 11-20, 2016 in Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala, 2016, pp. 11-20.
[46]
P. Haller and A. Loiko, "LaCasa : Lightweight Affinity and Object Capabilities in Scala," pp. 272-291, 2016 in Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, 2016, pp. 272-291.
[47]
M. Henzinger, S. Krinninger and D. Na Nongkai, "A deterministic almost-tight distributed algorithm for approximating single-source shortest paths," pp. 489-498, 2016 in Proceedings of the Annual ACM Symposium on Theory of Computing, 2016, pp. 489-498.
[48]
P. Austrin et al., "Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs," pp. 335-339, 2016 in 2016 IEEE International Symposium on Information Theory, 2016, pp. 335-339.
[49]
R. Guanciale et al., "Cache Storage Channels : Alias-Driven Attacks and Verified Countermeasures," pp. 38-55, 2016 in Proceedings - 2016 IEEE Symposium on Security and Privacy, SP 2016, 2016, pp. 38-55.
[50]
A. Kohan, M. Yamamoto and C. Artho, "Automated Dataset Construction from Web Resources with Tool Kayur," pp. 98-104, 2016 in Proceedings - 2016 4th International Symposium on Computing and Networking, CANDAR 2016, 2016, pp. 98-104.
Full list in the KTH publications portal
Top page top