Lessons Learned in the Challenge: Making Predictions and Scoring Them. - Jukka Kohonen; Jukka Suomela (MLCW, 2005)

A System for Context-Dependent User Modeling. - Petteri Nurmi; Alfons H. Salden; Sian Lun Lau; Jukka Suomela; Michael Sutterer; Jean Millerat; Miquel Martin; Eemil Lagerspetz; Remco Poortinga (OTM Workshops (2), 2006)

Approximating relay placement in sensor networks. - Jukka Suomela (PE-WASUN, 2006)

Computational Complexity of Relay Placement in Sensor Networks. - Jukka Suomela (SOFSEM, 2006)

Local Approximation Algorithms for Scheduling Problems in Sensor Networks. - Patrik Floréen; Petteri Kaski; Topi Musto; Jukka Suomela (ALGOSENSORS, 2007)

BeTelGeuse: a tool for Bluetooth data gathering. - Petteri Nurmi; Joonas Kukkonen; Eemil Lagerspetz; Jukka Suomela; Patrik Floréen (BODYNETS, 2007)

A distributed approximation scheme for sleep sceduling in sensor networks. - Patrik Floréen; Petteri Kaski; Jukka Suomela (SECON, 2007)

Approximability of identifying codes and locating-dominating codes. - Jukka Suomela (Inf. Process. Lett., 2007)

Tight Local Approximation Results for Max-Min Linear Programs. - Patrik Floréen; Marja Hassinen; Petteri Kaski; Jukka Suomela (ALGOSENSORS, 2008)

Optimal Backlog in the Plane. - Valentin Polishchuk; Jukka Suomela (ALGOSENSORS, 2008)

Improved Approximation Algorithms for Relay Placement. - Alon Efrat; Sándor P. Fekete; Poornananda R. Gaddehosur; Joseph S. B. Mitchell; Valentin Polishchuk; Jukka Suomela (ESA, 2008)

Approximating max-min linear programs with local algorithms. - Patrik Floréen; Petteri Kaski; Topi Musto; Jukka Suomela (IPDPS, 2008)

Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. - Petteri Kaski; Aleksi Penttinen; Jukka Suomela (Ad Hoc Sens. Wirel. Networks, 2008)

Local approximation algorithms for a class of 0/1 max-min linear programs - Patrik Floréen; Marja Hassinen; Petteri Kaski; Jukka Suomela (CoRR, 2008)

Almost stable matchings in constant time - Patrik Floréen; Petteri Kaski; Valentin Polishchuk; Jukka Suomela (CoRR, 2008)

Local Algorithms: Self-Stabilization on Speed. - Christoph Lenzen 001; Jukka Suomela; Roger Wattenhofer (Algorithmic Methods for Distributed Cooperative Systems, 2009)

An optimal local approximation algorithm for max-min linear programs. - Patrik Floréen; Joel Kaasinen; Petteri Kaski; Jukka Suomela (SPAA, 2009)

A Local 2-Approximation Algorithm for the Vertex Cover Problem. - Matti Åstrand; Patrik Floréen; Valentin Polishchuk; Joel Rybicki; Jukka Suomela; Jara Uitto (DISC, 2009)

A simple local 3-approximation algorithm for vertex cover. - Valentin Polishchuk; Jukka Suomela (Inf. Process. Lett., 2009)

Optimisation problems in wireless sensor networks: Local algorithms and local graphs. - Jukka Suomela (2009)

Brief announcement: distributed almost stable marriage. - Patrik Floréen; Petteri Kaski; Valentin Polishchuk; Jukka Suomela (PODC, 2010)

Distributed algorithms for edge dominating sets. - Jukka Suomela (PODC, 2010)

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. - Matti Åstrand; Jukka Suomela (SPAA, 2010)

Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. - Patrik Floréen; Petteri Kaski; Valentin Polishchuk; Jukka Suomela (Algorithmica, 2010)

Local algorithms in (weakly) coloured graphs - Matti Åstrand; Valentin Polishchuk; Joel Rybicki; Jukka Suomela; Jara Uitto (CoRR, 2010)

Locally checkable proofs. - Mika Göös; Jukka Suomela (PODC, 2011)

Planar Subgraphs without Low-Degree Nodes. - Evangelos Kranakis; Oscar Morales-Ponce; Jukka Suomela (WADS, 2011)

Analysing local algorithms in location-aware quasi-unit-disk graphs. - Marja Hassinen; Joel Kaasinen; Evangelos Kranakis; Valentin Polishchuk; Jukka Suomela; Andreas Wiese (Discret. Appl. Math., 2011)

Local Approximability of Max-Min and Min-Max Linear Programs. - Patrik Floréen; Marja Hassinen; Joel Kaasinen; Petteri Kaski; Topi Musto; Jukka Suomela (Theory Comput. Syst., 2011)

Distributed maximal matching: greedy is optimal. - Juho Hirvonen; Jukka Suomela (PODC, 2012)

What can be decided locally without identifiers? - Pierre Fraigniaud; Mika Göös; Amos Korman; Jukka Suomela (PODC, 2013)

Exploiting locality in distributed SDN control. - Stefan Schmid 001; Jukka Suomela (HotSDN, 2013)

Synchronous Counting and Computational Algorithm Design. - Danny Dolev; Janne H. Korhonen; Christoph Lenzen 001; Joel Rybicki; Jukka Suomela (SSS, 2013)

Survey of local algorithms. - Jukka Suomela (ACM Comput. Surv., 2013)

Lower bounds for local approximation. - Mika Göös; Juho Hirvonen; Jukka Suomela (J. ACM, 2013)

Linear-in-delta lower bounds in the LOCAL model. - Mika Göös; Juho Hirvonen; Jukka Suomela (PODC, 2014)

Brief announcement: local approximability of minimum dominating set on planar graphs. - Miikka Hilke; Christoph Lenzen 001; Jukka Suomela (PODC, 2014)

Brief announcement: linial's lower bound made easy. - Juhana Laurinharju; Jukka Suomela (PODC, 2014)

Local Approximability of Minimum Dominating Set on Planar Graphs. - Miikka Hilke; Christoph Lenzen 001; Jukka Suomela (CoRR, 2014)

Linial's Lower Bound Made Easy. - Juhana Laurinharju; Jukka Suomela (CoRR, 2014)

Median Filtering is Equivalent to Sorting. - Jukka Suomela (CoRR, 2014)

No sublogarithmic-time approximation scheme for bipartite vertex cover. - Mika Göös; Jukka Suomela (Distributed Comput., 2014)

Towards Optimal Synchronous Counting. - Christoph Lenzen 001; Joel Rybicki; Jukka Suomela (PODC, 2015)

Exact Bounds for Distributed Graph Colouring. - Joel Rybicki; Jukka Suomela (SIROCCO, 2015)

Locally Optimal Load Balancing. - Laurent Feuilloley; Juho Hirvonen; Jukka Suomela (DISC, 2015)

Non-Local Probes Do Not Help with Graph Problems. - Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela (CoRR, 2015)

Weak models of distributed computing, with connections to modal logic. - Lauri Hella; Matti Järvisalo; Antti Kuusisto; Juhana Laurinharju; Tuomo Lempiäinen; Kerkko Luosto; Jukka Suomela; Jonni Virtema (Distributed Comput., 2015)

The minimum backlog problem. - Michael A. Bender; Sándor P. Fekete; Alexander Kröller; Vincenzo Liberatore; Joseph S. B. Mitchell; Valentin Polishchuk; Jukka Suomela (Theor. Comput. Sci., 2015)

A lower bound for the distributed Lovász local lemma. - Sebastian Brandt 002; Orr Fischer; Juho Hirvonen; Barbara Keller; Tuomo Lempiäinen; Joel Rybicki; Jukka Suomela; Jara Uitto (STOC, 2016)

Randomized Algorithms for Finding a Majority Element. - Pawel Gawrychowski; Jukka Suomela; Przemyslaw Uznanski (SWAT, 2016)

Non-local Probes Do Not Help with Many Graph Problems. - Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela (DISC, 2016)

Synchronous counting and computational algorithm design. - Danny Dolev; Keijo Heljanko; Matti Järvisalo; Janne H. Korhonen; Christoph Lenzen 001; Joel Rybicki; Jukka Suomela; Siert Wieringa (J. Comput. Syst. Sci., 2016)

Improved Approximation Algorithms for Relay Placement. - Alon Efrat; Sándor P. Fekete; Joseph S. B. Mitchell; Valentin Polishchuk; Jukka Suomela (ACM Trans. Algorithms, 2016)

Deterministic local algorithms, unique identifiers, and fractional graph colouring. - Henning Hasemann; Juho Hirvonen; Joel Rybicki; Jukka Suomela (Theor. Comput. Sci., 2016)

Locally Checkable Proofs in Distributed Computing. - Mika Göös; Jukka Suomela (Theory Comput., 2016)

Constant Space and Non-Constant Time in Distributed Computing. - Tuomo Lempiäinen; Jukka Suomela (OPODIS, 2017)

LCL Problems on Grids. - Sebastian Brandt 002; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Patric R. J. Östergård; Christopher Purcell; Joel Rybicki; Jukka Suomela; Przemyslaw Uznanski (PODC, 2017)

Brief Announcement: Towards a Complexity Theory for the Congested Clique. - Janne H. Korhonen; Jukka Suomela (DISC, 2017)

Large Cuts with Local Algorithms on Triangle-Free Graphs. - Juho Hirvonen; Joel Rybicki; Stefan Schmid 001; Jukka Suomela (Electron. J. Comb., 2017)

Distributed Colour Reduction Revisited. - Jukka Kohonen; Janne H. Korhonen; Christopher Purcell; Jukka Suomela; Przemyslaw Uznanski (CoRR, 2017)

Linear-in-Δ lower bounds in the LOCAL model. - Mika Göös; Juho Hirvonen; Jukka Suomela (Distributed Comput., 2017)

Efficient Counting with Optimal Resilience. - Christoph Lenzen 001; Joel Rybicki; Jukka Suomela (SIAM J. Comput., 2017)

Changing Lanes on a Highway. - Thomas Petig; Elad Michael Schiller; Jukka Suomela (ATMOS, 2018)

Towards a Complexity Theory for the Congested Clique. - Janne H. Korhonen; Jukka Suomela (SPAA, 2018)

New classes of distributed time complexity. - Alkida Balliu; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Dennis Olivetti; Jukka Suomela (STOC, 2018)

Distributed Recoloring. - Marthe Bonamy; Paul Ouvrard; Mikaël Rabie; Jukka Suomela; Jara Uitto (DISC, 2018)

The Presburger Award for Young Scientists 2019 - Call for Nominations. - Jukka Suomela (Bull. EATCS, 2018)

Node labels in local decision. - Pierre Fraigniaud; Juho Hirvonen; Jukka Suomela (Theor. Comput. Sci., 2018)

On the Power of Preprocessing in Decentralized Network Optimization. - Klaus-Tycho Foerster; Juho Hirvonen; Stefan Schmid 001; Jukka Suomela (INFOCOM, 2019)

2019 Edsger W. Dijkstra Prize in Distributed Computing. - Lorenzo Alvisi; Shlomi Dolev; Faith Ellen; Idit Keidar; Fabian Kuhn; Jukka Suomela (PODC, 2019)

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Mikaël Rabie; Jukka Suomela (PODC, 2019)

Hardness of Minimal Symmetry Breaking in Distributed Computing. - Alkida Balliu; Juho Hirvonen; Dennis Olivetti; Jukka Suomela (PODC, 2019)

Locality of Not-so-Weak Coloring. - Alkida Balliu; Juho Hirvonen; Christoph Lenzen 001; Dennis Olivetti; Jukka Suomela (SIROCCO, 2019)

Algebraic methods in the congested clique. - Keren Censor-Hillel; Petteri Kaski; Janne H. Korhonen; Christoph Lenzen 001; Ami Paz; Jukka Suomela (Distributed Comput., 2019)

Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations. - Lorenzo Alvisi; Shlomi Dolev; Faith Ellen; Idit Keidar; Fabian Kuhn; Jukka Suomela (Bull. EATCS, 2019)

Can We Automate Our Own Work - or Show That It Is Hard? (Invited Talk). - Jukka Suomela (OPODIS, 2020)

Brief Announcement: Classification of Distributed Binary Labeling Problems. - Alkida Balliu; Sebastian Brandt 002; Yuval Efron; Juho Hirvonen; Yannic Maus; Dennis Olivetti; Jukka Suomela (PODC, 2020)

How much does randomness help with locally checkable problems? - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jukka Suomela (PODC, 2020)

Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. - Will Rosenbaum; Jukka Suomela (PODC, 2020)

Landscape of Locality (Invited Talk). - Jukka Suomela (SWAT, 2020)

Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. - Sebastian Brandt 002; Barbara Keller; Joel Rybicki; Jukka Suomela; Jara Uitto (DISC, 2020)

Classification of Distributed Binary Labeling Problems. - Alkida Balliu; Sebastian Brandt 002; Yuval Efron; Juho Hirvonen; Yannic Maus; Dennis Olivetti; Jukka Suomela (DISC, 2020)

Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. - Yi-Jun Chang; Jan Studený; Jukka Suomela (DISC, 2020)

Improved distributed degree splitting and edge coloring. - Mohsen Ghaffari 001; Juho Hirvonen; Fabian Kuhn; Yannic Maus; Jukka Suomela; Jara Uitto (Distributed Comput., 2020)

Using Round Elimination to Understand Locality. - Jukka Suomela (SIGACT News, 2020)

Structural Information and Communication Complexity. - Jukka Suomela (Theor. Comput. Sci., 2020)

Locally Checkable Problems in Rooted Trees. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (PODC, 2021)

Efficient Load-Balancing through Distributed Token Dropping. - Sebastian Brandt 002; Barbara Keller; Joel Rybicki; Jukka Suomela; Jara Uitto (SPAA, 2021)

Locally Checkable Labelings with Small Messages. - Alkida Balliu; Keren Censor-Hillel; Yannic Maus; Dennis Olivetti; Jukka Suomela (DISC, 2021)

Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. - Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jukka Suomela (DISC, 2021)

Locality in Online Algorithms. - Maciej Pacut; Mahmoud Parham; Joel Rybicki; Stefan Schmid 001; Jukka Suomela; Aleksandr Tereshchenko (CoRR, 2021)

Sinkless orientation is hard also in the supported LOCAL model. - Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jukka Suomela (CoRR, 2021)

Online Algorithms with Lookaround. - Amirreza Akbari; Henrik Lievonen; Darya Melnyk; Joona Särkijärvi; Jukka Suomela (CoRR, 2021)

Almost global problems in the LOCAL model. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jukka Suomela (Distributed Comput., 2021)

Lower Bounds for Maximal Matchings and Maximal Independent Sets. - Alkida Balliu; Sebastian Brandt 002; Juho Hirvonen; Dennis Olivetti; Mikaël Rabie; Jukka Suomela (J. ACM, 2021)

Mending Partial Solutions with Few Changes. - Darya Melnyk; Jukka Suomela; Neven Villani (OPODIS, 2022)

Local Mending. - Alkida Balliu; Juho Hirvonen; Darya Melnyk; Dennis Olivetti; Joel Rybicki; Jukka Suomela (SIROCCO, 2022)

Sparse Matrix Multiplication in the Low-Bandwidth Model. - Chetan Gupta 002; Juho Hirvonen; Janne H. Korhonen; Jan Studený; Jukka Suomela (SPAA, 2022)

Efficient Classification of Locally Checkable Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (DISC, 2022)

Brief Announcement: Temporal Locality in Online Algorithms. - Maciej Pacut; Mahmoud Parham; Joel Rybicki; Stefan Schmid 001; Jukka Suomela; Aleksandr Tereshchenko (DISC, 2022)

Efficient Classification of Local Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (CoRR, 2022)

Lexical and function words or language and text type? Abbreviation consistency in an aligned corpus of Latin and Middle English plague tracts. - Alpo Honkapohja; Jukka Suomela (Digit. Scholarsh. Humanit., 2022)

Data for the article "New methods for analysing diachronic suffix competition across registers". - Paula Rodríguez-Puente; Tanja Säily; Jukka Suomela (Zenodo, 2022)

Code for the article "New methods for analysing diachronic suffix competition across registers". - Jukka Suomela (Zenodo, 2022)

TypeRatio: comparing competing suffixes. - Jukka Suomela (Zenodo, 2022)

Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms. - Amirreza Akbari; Navid Eslami; Henrik Lievonen; Darya Melnyk; Joona Särkijärvi; Jukka Suomela (ICALP, 2023)

Sinkless Orientation Made Simple. - Alkida Balliu; Janne H. Korhonen; Fabian Kuhn; Henrik Lievonen; Dennis Olivetti; Shreyas Pai; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jan Studený; Jukka Suomela; Jara Uitto (SOSA, 2023)

Fast Dynamic Programming in Trees in the MPC Model. - Chetan Gupta 002; Rustam Latypov; Yannic Maus; Shreyas Pai; Simo Särkkä; Jan Studený; Jukka Suomela; Jara Uitto; Hossein Vahidi 001 (SPAA, 2023)

Brief Announcement: Distributed Derandomization Revisited. - Sameep Dahal; Francesco D'Amore 001; Henrik Lievonen; Timothé Picavet; Jukka Suomela (DISC, 2023)

Distributed derandomization revisited. - Sameep Dahal; Francesco D'Amore 001; Henrik Lievonen; Timothé Picavet; Jukka Suomela (CoRR, 2023)

Distributed graph problems through an automata-theoretic lens. - Yi-Jun Chang; Jan Studený; Jukka Suomela (Theor. Comput. Sci., 2023)

Locally checkable problems in rooted trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (Distributed Comput., 2023)

Local Problems in Trees Across a Wide Range of Distributed Models. - Anubhav Dhar; Eli Kujawa; Henrik Lievonen; Augusto Modanese; Mikail Muftuoglu; Jan Studený; Jukka Suomela (OPODIS, 2024)

Brief Announcement: Local Advice and Local Decompression. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Krzysztof Nowicki 002; Dennis Olivetti; Eva Rotenberg; Jukka Suomela (PODC, 2024)

Distributed Binary Labeling Problems in High-Degree Graphs. - Henrik Lievonen; Timothé Picavet; Jukka Suomela (SIROCCO, 2024)

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SPAA, 2024)

No Distributed Quantum Advantage for Approximate Graph Coloring. - Xavier Coiteux-Roy; Francesco D'Amore 001; Rishikesh Gajjala; Fabian Kuhn; François Le Gall; Henrik Lievonen; Augusto Modanese; Marc-Olivier Renou; Gustav Schmid; Jukka Suomela (STOC, 2024)

Local Advice and Local Decompression. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Krzysztof Nowicki 002; Dennis Olivetti; Eva Rotenberg; Jukka Suomela (CoRR, 2024)

Distributed half-integral matching and beyond. - Sameep Dahal; Jukka Suomela (Theor. Comput. Sci., 2024)

Shared Randomness Helps with Local Distributed Problems. - Alkida Balliu; Mohsen Ghaffari 001; Fabian Kuhn; Augusto Modanese; Dennis Olivetti; Mikaël Rabie; Jukka Suomela; Jara Uitto (ICALP, 2025)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SIROCCO, 2025)

Online Locality Meets Distributed Quantum Computing. - Amirreza Akbari; Xavier Coiteux-Roy; Francesco D'Amore 001; François Le Gall; Henrik Lievonen; Darya Melnyk; Augusto Modanese; Shreyas Pai; Marc-Olivier Renou; Václav Rozhon; Jukka Suomela (STOC, 2025)

Distributed Quantum Advantage for Local Problems. - Alkida Balliu; Sebastian Brandt 002; Xavier Coiteux-Roy; Francesco D'Amore 001; Massimo Equi; François Le Gall; Henrik Lievonen; Augusto Modanese; Dennis Olivetti; Marc-Olivier Renou; Jukka Suomela; Lucas Tendick; et al. (STOC, 2025)

Distributed Quantum Advantage in Locally Checkable Labeling Problems. - Alkida Balliu; Filippo Casagrande; Francesco D'Amore 001; Massimo Equi; Barbara Keller; Henrik Lievonen; Dennis Olivetti; Gustav Schmid; Jukka Suomela (CoRR, 2025)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs. - Alkida Balliu; Corinna Coupette; Antonio Cruciani; Francesco D'Amore 001; Massimo Equi; Henrik Lievonen; Augusto Modanese; Dennis Olivetti; Jukka Suomela (CoRR, 2025)

Distributed Algorithms for Potential Problems. - Alkida Balliu; Thomas Boudier; Francesco D'Amore 001; Dennis Olivetti; Gustav Schmid; Jukka Suomela (CoRR, 2025)