Here we have highlighted some examples of recent papers coauthored by the members of the Helsinki Algorithms & Theory community.

Ringtail: Practical Two-Round Threshold Signatures from Learning with Errors · C. Boschini, D. Kaviani, R.W.F. Lai, G. Malavolta, A. Takahashi, M. Tibouchi

A Multilinear Johnson–Lindenstrauss Transform · P. Kaski, H. Mannila, A. Matakos

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths · N. Fischer, B. Haeupler, R. Latypov, A. Roeyskoe, A. Sulser

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture · A. Björklund, R. Curticapean, T. Husfeldt, P. Kaski, K. Pratt

On the Locality of Hall's Theorem · S. Brandt, Y. Maus, A. Narayanan, F. Schlager, J. Uitto

A universal sequence of tensors for the asymptotic rank conjecture · P. Kaski, M. Michałek

Noise-Aware Differentially Private Regression via Meta-Learning · O. Räisä, S. Markou, M. Ashman, W.P. Bruinsma, M. Tobaben, A. Honkela, R.E. Turner

Traitor Tracing without Trusted Authority from Registered Functional Encryption · P. Branco, R.W.F. Lai, M. Maitra, G. Malavolta, A. Rahimi, I.K.Y. Woo

RoK, Paper, SISsors – Toolkit for Lattice-based Succinct Arguments · M. Klooß, R.W.F. Lai, N.K. Nguyen, M. Osadnik

Evasive LWE Assumptions: Definitions, Classes, and Counterexamples · C. Brzuska, A. Ünal, I.K.Y. Woo

On Bounded Storage Key Agreement and One-Way Functions · C. Brzuska, G. Couteau, C. Egger, W. Quach

A New Characterization of FAC⁰ via Discrete Ordinary Differential Equation · M. Antonelli, A. Durand, J. Kontinen

Learning big logical rules by joining small rules · C. Hocquette, A. Niskanen, R. Morel, M. Järvisalo, A. Cropper

Mapping the Multiverse of Latent Representations · J. Wayland, C. Coupette, B. Rieck

Subsampling is not Magic: Why Large Batch Sizes Work for Differentially Private Stochastic Optimisation · O. Räisä, J. Jälkö, A. Honkela

Estimating the Permanent by Nesting Importance Sampling · J. Harviainen, M. Koivisto

Adaptive Massively Parallel Coloring in Sparse Graphs · R. Latypov, Y. Maus, S. Pai, J. Uitto

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs · A. Björklund, P. Kaski, J. Nederlof

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification · E. Galby, S. Kisfaludi-Bak, D. Marx, R. Sharma

Testing Spreading Behavior in Networks with Arbitrary Topologies · A. Modanese, Y. Yoshida

The Group Access Bounds for Binary Search Trees · P. Chalermsook, M. Gupta, W. Jiamjitrak, A. Pareek, S. Yingchareonthawornchai

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces · F. Abbassi, S. Banerjee, J. Byrka, P. Chalermsook, A. Gadekar, K. Khodamoradi, D. Marx, R. Sharma, J. Spoerhase

The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True · A. Björklund, P. Kaski

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers · T. Hakoniemi, N. Limaye, I. Tzameret

No Distributed Quantum Advantage for Approximate Graph Coloring · X. Coiteux-Roy, F. d'Amore, R. Gajjala, F. Kuhn, F. Le Gall, H. Lievonen, A. Modanese, M.-O. Renou, G. Schmid, J. Suomela

A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space · S. Kisfaludi-Bak, G. van Wordragen

Separator Theorem and Algorithms for Planar Hyperbolic Graphs · S. Kisfaludi-Bak, J. Masaříková, E.J. van Leeuwen, B. Walczak, K. Węgrzycki

Fine-Grained Complexity of Earth Mover's Distance under Translation · K. Bringmann, F. Staals, K. Węgrzycki, G. van Wordragen

Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions · T. Hankala, M. Hannula, J. Kontinen, J. Virtema

Learning MDL Logic Programs from Noisy Data · C. Hocquette, A. Niskanen, M. Järvisalo, A. Cropper

A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams · M. Cambus, F. Kuhn, E. Lindy, S. Pai, J. Uitto