Skip to main content
To KTH's start page

Publications

Link to the full list   in the KTH publication portal.

TCS Publications, 50 latest

[1]
H. Wang, S. Tu and A. Gionis, "Sequential Diversification with Provable Guarantees," in Proceedings Of The Eighteenth Acm International Conference On Web Search And Data Mining, WSDM 2025, 2025, pp. 345-353.
[2]
G. Preti et al., "POLARIS : Sampling from the Multigraph Configuration Model with Prescribed Color Assortativity," in Proceedings Of The Eighteenth Acm International Conference On Web Search And Data Mining, Wsdm 2025, 2025, pp. 30-39.
[3]
M. Sevenhuijsen, K. Etemadi and M. Nyberg, "VeCoGen: Automating Generation of Formally Verified C Code With Large Language Models," in FormaliSE 2025: ACM/IEEE International Conference on Formal Methods in Software Engineering, Ottawa, Canada, April 27-28, 2025., 2025.
[4]
M. M. Ahmadpanah et al., "CodeX : Contextual Flow Tracking for Browser Extensions," in Proceedings of the Fifteenth ACM Conference on Data and Application Security and Privacy, CODASPY 2025, 2025.
[5]
Y. Liu et al., "Specification Mining for Smart Contracts with Trace Slicing and Predicate Abstraction," in Proceedings - 2025 IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2025, 2025, pp. 147-158.
[6]
X. Liu et al., "ContractViz : Extending Eclipse Trace Compass for Smart Contract Transaction Analysis," in Proceedings - 2025 IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2025, 2025, pp. 819-823.
[7]
D. Lundberg, R. Guanciale and M. Dam, "Proof-Producing Symbolic Execution for P4," in Verified Software. Theories, Tools and Experiments - 16th International Conference, VSTTE 2024, Revised Selected Papers, 2025, pp. 70-83.
[8]
G. Zhang, I. Sarpe and A. Gionis, "Efficient and Practical Approximation Algorithms for Advertising in Content Feeds," in WWW 2025 - Proceedings of the ACM Web Conference, 2025, pp. 3193-3203.
[9]
A. Gadekar, A. Gionis and S. Thejaswi, "Fair Clustering for Data Summarization : Improved Approximation Algorithms and Complexity Insights," in WWW 2025 - Proceedings of the ACM Web Conference, 2025, pp. 4458-4469.
[10]
E. Riese et al., "Experiences, Impacts and Implications of a STINT Teaching Sabbatical," in KTH SoTL 2025, KTH Royal Institute of Technology, Sweden, May 20, 2025., 2025.
[12]
[13]
S. Dalleiger, J. Vreeken and M. Kamp, "Federated Binary Matrix Factorization Using Proximal Optimization," in 39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025, Philadelphia, United States of America, Feb 25 2025 - Mar 4 2025, 2025, pp. 16144-16152.
[14]
S. Tu, "Models and Algorithms for Addressing Challenges in Online Social Networks," Doctoral thesis : KTH Royal Institute of Technology, TRITA-EECS-AVL, 2025:57, 2025.
[15]
S. Dalleiger and A. Gionis, "Creating Coherence in Federated Non-Negative Matrix Factorization," in 39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025, Philadelphia, United States of America, Feb 25 2025 - Mar 4 2025, 2025, pp. 16135-16143.
[16]
S. Thejaswi, J. Lauri and A. Gionis, "Restless reachability problems in temporal graphs," Knowledge and Information Systems, 2025.
[17]
M. Eshghie, "Securing Smart Contracts Against Business Logic Flaws," Doctoral thesis : KTH Royal Institute of Technology, TRITA-EECS-AVL, 2025:56, 2025.
[18]
M. Ekerå and J. Gärtner, "A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography," IACR Communications in Cryptology, vol. 2, no. 1, 2025.
[19]
B. Baudry and M. Monperrus, "Humor for graduate training," ACM Inroads, 2025.
[21]
V. Andersson et al., "UPPERCASE IS ALL YOU NEED," in SIGBOVIK 2025, Carnegie Mellon University, Pittsburgh, PA, USA, April 4, 2025, 2025.
[22]
E. Poorhadi, "Formal Modelling of the Impact of Cyberattacks on Safety of Networked Control Systems," Doctoral thesis Stockholm, Sweden : KTH Royal Institute of Technology, TRITA-EECS-AVL, 2025:39, 2025.
[23]
K. Vombatkere, A. Gionis and E. Terzi, "Forming coordinated teams that balance task coverage and expert workload," Data mining and knowledge discovery, vol. 39, no. 3, 2025.
[24]
C. Izu et al., "Introducing Code Quality at CS1 Level : Examples and Activities," in ITiCSE WGR 2024 - Publication of the 2024 Working Group Reports on Innovation and Technology in Computer Science Education, 2025, pp. 339-377.
[25]
J. Augustine and M. Mohit Daga, "Distributed Small Cuts using Semigroups," in ICDCN 2025 - Proceedings of the 26th International Conference on Distributed Computing and Networking, 2025, pp. 134-143.
[26]
A. de Almeida Borges et al., "Lessons for Interactive Theorem Proving Researchers from a Survey of Coq Users," Journal of automated reasoning, vol. 69, no. 1, 2025.
[27]
A. M. Ahmadian, "To Secure a Flow : From Specification to Enforcement of Information Flow Control," Doctoral thesis Stockholm : KTH Royal Institute of Technology, TRITA-EECS-AVL, 2025:22, 2025.
[28]
D. Oliveira et al., "Understanding Code Understandability Improvements in Code Reviews," IEEE Transactions on Software Engineering, vol. 51, no. 1, pp. 14-37, 2025.
[29]
F. Cornell et al., "Unsupervised Ontology- and Taxonomy Construction Through Hyperbolic Relational Domains and Ranges," in Machine Learning and Principles and Practice of Knowledge Discovery in Databases - International Workshops of ECML PKDD 2023, Revised Selected Papers, 2025, pp. 339-348.
[30]
J. Amilon and D. Gurov, "Deductively Verified Program Models for Software Model Checking," in Leveraging Applications of Formal Methods, Verification and Validation. Specification and Verification - 12th International Symposium, ISoLA 2024, Proceedings, 2025, pp. 8-25.
[32]
F. Reyes García, B. Baudry and M. Monperrus, "Breaking-Good: Explaining Breaking Dependency Updates with Build Analysis," in Proceedings - 2024 IEEE International Conference on Source Code Analysis and Manipulation, SCAM 2024, 2024, pp. 36-46.
[33]
M. Ciaperoni et al., "Beam-search SIEVE for low-memory speech recognition," in Interspeech 2024, 2024, pp. 272-276.
[34]
M. Mikša and J. Nordström, "A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds," Journal of the ACM, vol. 71, no. 6, 2024.
[35]
A. M. Ahmadian, M. Soloviev and M. Balliu, "Disjunctive Policies for Database-Backed Programs," in 2024 IEEE 37TH Computer Security Foundations Symposium, CSF 2024, 2024, pp. 388-402.
[36]
E. Poorhadi and E. Troubitsyna, "Automating an Integrated Model-Driven Approach to Analysing the Impact of Cyberattacks on Safety," in Computer Safety, Reliability, and Security. SAFECOMP 2024 Workshops, 2024, pp. 61-73.
[37]
M. A. Kuhail et al., "Designing a Haptic Boot for Space With Prompt Engineering : Process, Insights, and Implications," IEEE Access, vol. 12, pp. 134235-134255, 2024.
[38]
M. Shcherbakov, "Code-Reuse Attacks in Managed Programming Languages and Runtimes," Doctoral thesis Stockholm : KTH Royal Institute of Technology, TRITA-EECS-AVL, 2024:75, 2024.
[39]
N. Dayan, I. Bercea and R. Pagh, "Aleph Filter : To Infinity in Constant Time," Proceedings of the VLDB Endowment, vol. 17, no. 11, pp. 3644-3656, 2024.
[40]
A. Andreasson et al., "Cybersecurity work at Swedish administrative authorities : taking action or waiting for approval," Cognition, Technology & Work, vol. 26, no. 4, pp. 709-731, 2024.
[41]
M. Aghvamipanah et al., "Activity Recognition Protection for IoT Trigger-Action Platforms," in Proceedings - 9th IEEE European Symposium on Security and Privacy, Euro S and P 2024, 2024, pp. 600-616.
[42]
T. Marinaro et al., "Beyond Over-Protection : A Targeted Approach to Spectre Mitigation and Performance Optimization," in ACM AsiaCCS 2024 - Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 2024, pp. 203-216.
[43]
F. Reyes García et al., "BUMP : A Benchmark of Reproducible Breaking Dependency Updates," in Proceedings - 2024 IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024, 2024, pp. 159-170.
[44]
R. Glassey and A. Baltatzis, "Active Repos : Integrating Generative AI Workflows into GitHub," in ITiCSE 2024 - Proceedings of the 2024 Conference Innovation and Technology in Computer Science Education, 2024, pp. 777-778.
[45]
S. Fowler et al., "Behavioural Types for Heterogeneous Systems (Position Paper)," in Proceedings - 15th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, PLACES 2024, 2024, pp. 37-48.
[46]
Y. Tian et al., "Driving Intention Recognition and Speed Prediction at Complex Urban Intersections Considering Traffic Environment," IEEE transactions on intelligent transportation systems (Print), vol. 25, no. 5, pp. 4470-4488, 2024.
[47]
I. Bercea, J. B. Tejs Houen and R. Pagh, "Daisy Bloom Filters," in 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024, 2024.
[48]
T. Lanciano et al., "A Survey on the Densest Subgraph Problem and its Variants," ACM Computing Surveys, vol. 56, no. 8, 2024.
[49]
C. Lidström, "Automated Deductive Verification of Safety-Critical Embedded Software," Doctoral thesis Stockholm : KTH Royal Institute of Technology, TRITA-EECS-AVL, 2024:17, 2024.
[50]
J. Amilon et al., "An Exercise in Mind Reading: Automatic Contract Inference for Frama-C," in Guide to Software Verification with Frama-C: Core Components, Usages, and Applications, : Springer Nature, 2024.