Exploiting Locality in Distributed SDN Control S Schmid, J Suomela HotSDN 2013, 2013 | 264 | 2013 |
Survey of local algorithms J Suomela ACM Computing Surveys 45 (2), 2013 | 249 | 2013 |
Locally checkable proofs in distributed computing M Göös, J Suomela Theory of Computing 12, 2016 | 146* | 2016 |
Algebraic methods in the congested clique K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela PODC 2015, 2015 | 141 | 2015 |
A Lower Bound for the Distributed Lovász Local Lemma S Brandt, O Fischer, J Hirvonen, B Keller, T Lempiäinen, J Rybicki, ... STOC 2016, 2016 | 127 | 2016 |
Lower bounds for maximal matchings and maximal independent sets A Balliu, S Brandt, J Hirvonen, D Olivetti, M Rabie, J Suomela Journal of the ACM (JACM) 68 (5), 1-30, 2021 | 97 | 2021 |
Improved approximation algorithms for relay placement A Efrat, SP Fekete, JSB Mitchell, V Polishchuk, J Suomela ACM Transactions on Algorithms 12 (2), 20, 2016 | 83* | 2016 |
Weak Models of Distributed Computing, with Connections to Modal Logic L Hella, M Järvisalo, A Kuusisto, J Laurinharju, T Lempiäinen, K Luosto, ... Distributed Computing, 2014 | 68 | 2014 |
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks M Åstrand, J Suomela SPAA 2010, 2010 | 68 | 2010 |
LCL problems on grids S Brandt, J Hirvonen, JH Korhonen, T Lempiäinen, PRJ Östergård, ... PODC 2017, 2017 | 67 | 2017 |
A local 2-approximation algorithm for the vertex cover problem M Åstrand, P Floréen, V Polishchuk, J Rybicki, J Suomela, J Uitto DISC 2009, 2009 | 58 | 2009 |
Optimisation problems in wireless sensor networks: local algorithms and local graphs J Suomela Helsingin yliopisto, 2009 | 57* | 2009 |
Local algorithms: self-stabilization on speed C Lenzen, J Suomela, R Wattenhofer SSS 2009, 2009 | 55 | 2009 |
Almost stable matchings by truncating the Gale–Shapley algorithm P Floréen, P Kaski, V Polishchuk, J Suomela Algorithmica 58 (1), 102–118, 2010 | 54 | 2010 |
New Classes of Distributed Time Complexity A Balliu, J Hirvonen, JH Korhonen, T Lempiäinen, D Olivetti, J Suomela STOC 2018, 2018 | 51 | 2018 |
A simple local 3-approximation algorithm for vertex cover V Polishchuk, J Suomela Information Processing Letters 109 (12), 642–645, 2009 | 51 | 2009 |
Approximability of identifying codes and locating-dominating codes J Suomela Information Processing Letters 103 (1), 28–33, 2007 | 51 | 2007 |
Classification of distributed binary labeling problems A Balliu, S Brandt, Y Efron, J Hirvonen, Y Maus, D Olivetti, J Suomela DISC 2020, 2020 | 50 | 2020 |
Computational complexity of relay placement in sensor networks J Suomela SOFSEM 2006, 2006 | 48 | 2006 |
What can be decided locally without identifiers? P Fraigniaud, M Göös, A Korman, J Suomela PODC 2013, 2013 | 45 | 2013 |
Almost Global Problems in the LOCAL Model A Balliu, S Brandt, D Olivetti, J Suomela DISC 2018, 2018 | 42 | 2018 |
Towards a complexity theory for the congested clique JH Korhonen, J Suomela SPAA 2018, 2018 | 42* | 2018 |
Lower Bounds for Local Approximation M Göös, J Hirvonen, J Suomela Journal of the ACM 60 (5), 2013 | 41 | 2013 |
Comparing type counts: The case of women, men and -ity in early English letters T Säily, J Suomela Corpus Linguistics: Refinements and Reassessments, 87–109, 2009 | 39 | 2009 |
Large cuts with local algorithms on triangle-free graphs J Hirvonen, J Rybicki, S Schmid, J Suomela Electronic Journal of Combinatorics 24 (4), 2017 | 38* | 2017 |
Hardness of minimal symmetry breaking in distributed computing A Balliu, J Hirvonen, D Olivetti, J Suomela PODC 2019, 2019 | 31 | 2019 |
Linear-in-∆ lower bounds in the LOCAL model M Göös, J Hirvonen, J Suomela Distributed Computing 30 (5), 325-338, 2017 | 30* | 2017 |
Synchronous counting and computational algorithm design D Dolev, K Heljanko, M Järvisalo, JH Korhonen, C Lenzen, J Rybicki, ... Journal of Computer and System Sciences 82 (2), 310-332, 2016 | 30 | 2016 |
The distributed complexity of locally checkable problems on paths is decidable A Balliu, S Brandt, YJ Chang, D Olivetti, M Rabie, J Suomela PODC 2019, 2019 | 28 | 2019 |
The minimum backlog problem MA Bender, SP Fekete, A Kröller, V Liberatore, JSB Mitchell, V Polishchuk, ... Theoretical Computer Science 605, 51-61, 2015 | 26 | 2015 |
How much does randomness help with locally checkable problems? A Balliu, S Brandt, D Olivetti, J Suomela PODC 2020, 2020 | 25 | 2020 |
Improved Distributed Degree Splitting and Edge Coloring M Ghaffari, J Hirvonen, F Kuhn, Y Maus, J Suomela, J Uitto DISC 2017, 2017 | 25 | 2017 |
Node Labels in Local Decision P Fraigniaud, J Hirvonen, J Suomela SIROCCO 2015, 2015 | 24 | 2015 |
Locally Checkable Problems in Rooted Trees A Balliu, S Brandt, D Olivetti, J Studený, J Suomela, A Tereshchenko PODC 2021, 2021 | 23 | 2021 |
Non-local probes do not help with many graph problems M Göös, J Hirvonen, R Levi, M Medina, J Suomela DISC 2016, 2016 | 23* | 2016 |
BeTelGeuse – a tool for Bluetooth data gathering P Nurmi, J Kukkonen, E Lagerspetz, J Suomela, P Floréen BodyNets 2007, 2007 | 23 | 2007 |
Lessons learned in the challenge: making predictions and scoring them J Kohonen, J Suomela MLCW 2005, 2005 | 23 | 2005 |
Local approximability of minimum dominating set on planar graphs M Hilke, C Lenzen, J Suomela PODC 2014, 2014 | 21* | 2014 |
Distributed maximal matching: greedy is optimal J Hirvonen, J Suomela PODC 2012, 2012 | 21 | 2012 |
Local algorithms in (weakly) coloured graphs M Åstrand, V Polishchuk, J Rybicki, J Suomela, J Uitto arXiv preprint arXiv:1002.0125, 2010 | 21* | 2010 |
A distributed approximation scheme for sleep sceduling in sensor networks P Floréen, P Kaski, J Suomela SECON 2007, 2007 | 19 | 2007 |
Exact bounds for distributed graph colouring J Rybicki, J Suomela SIROCCO 2015, 2015 | 18 | 2015 |
Median Filtering is Equivalent to Sorting J Suomela arXiv preprint arXiv:1406.1717, 2014 | 18 | 2014 |
types2: Exploring word-frequency differences in corpora T Säily, J Suomela Big and Rich Data in English Corpus Linguistics, Methods and Explorations, 2017 | 17* | 2017 |
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring H Hasemann, J Hirvonen, J Rybicki, J Suomela Theoretical Computer Science, 2014 | 17 | 2014 |
Distributed algorithms for edge dominating sets J Suomela PODC 2010, 2010 | 17 | 2010 |
A system for context-dependent user modeling P Nurmi, A Salden, S Lau, J Suomela, M Sutterer, J Millerat, M Martin, ... CAMS 2006, 2006 | 17 | 2006 |
Distributed graph problems through an automata-theoretic lens YJ Chang, J Studený, J Suomela SIROCCO 2021, 2021 | 16 | 2021 |
On the Power of Preprocessing in Decentralized Network Optimization KT Foerster, J Hirvonen, S Schmid, J Suomela INFOCOM 2019, 2019 | 16 | 2019 |
Linial’s lower bound made easy J Laurinharju, J Suomela PODC 2014, 2014 | 16* | 2014 |
An optimal local approximation algorithm for max-min linear programs P Floréen, J Kaasinen, P Kaski, J Suomela SPAA 2009, 2009 | 16 | 2009 |
types2: type and hapax accumulation curves J Suomela Computer program, 2016 | 15* | 2016 |
Local approximability of max-min and min-max linear programs P Floréen, M Hassinen, J Kaasinen, P Kaski, T Musto, J Suomela Theory of Computing Systems 49 (4), 672–697, 2011 | 15 | 2011 |
Approximating max-min linear programs with local algorithms P Floréen, P Kaski, T Musto, J Suomela IPDPS 2008, 2008 | 15 | 2008 |
Local approximation algorithms for scheduling problems in sensor networks P Floréen, P Kaski, T Musto, J Suomela ALGOSENSORS 2007, 2007 | 15 | 2007 |
Locally Checkable Labelings with Small Messages A Balliu, K Censor-Hillel, Y Maus, D Olivetti, J Suomela DISC 2021, 2021 | 14 | 2021 |
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems W Rosenbaum, J Suomela PODC 2020, 2020 | 14 | 2020 |
Distributed Recoloring M Bonamy, P Ouvrard, M Rabie, J Suomela, J Uitto DISC 2018, 2018 | 14 | 2018 |
No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover M Göös, J Suomela Distributed Computing, 2014 | 14 | 2014 |
Locality of not-so-weak coloring A Balliu, J Hirvonen, C Lenzen, D Olivetti, J Suomela SIROCCO 2019, 2019 | 13 | 2019 |
Distributed Algorithms J Hirvonen, J Suomela Textbook, Aalto University, 2020 | 11* | 2020 |
Landscape of Locality J Suomela SWAT 2020, 2020 | 11* | 2020 |
Towards Optimal Synchronous Counting C Lenzen, J Rybicki, J Suomela PODC 2015, 2015 | 11 | 2015 |
Tight local approximation results for max-min linear programs P Floréen, M Hassinen, P Kaski, J Suomela ALGOSENSORS 2008, 2008 | 11 | 2008 |
Relay placement in sensor networks J Suomela University of Helsinki, 2005 | 11 | 2005 |
Distributed graph problems through an automata-theoretic lens YJ Chang, J Studený, J Suomela Theoretical Computer Science 951, 113710, 2023 | 10 | 2023 |
Changing Lanes on a Highway T Petig, EM Schiller, J Suomela ATMOS 2018, 2018 | 10 | 2018 |
Efficient counting with optimal resilience C Lenzen, J Rybicki, J Suomela SIAM Journal on Computing 46 (4), 1473-1500, 2017 | 10* | 2017 |
Analysing local algorithms in location-aware quasi-unit-disk graphs M Hassinen, J Kaasinen, E Kranakis, V Polishchuk, J Suomela, A Wiese Discrete Applied Mathematics 159 (15), 1566–1580, 2011 | 10 | 2011 |
Local Mending A Balliu, J Hirvonen, D Melnyk, D Olivetti, J Rybicki, J Suomela SIROCCO 2022, 2022 | 9 | 2022 |
Approximating relay placement in sensor networks J Suomela PE-WASUN 2006, 2006 | 9 | 2006 |
Efficient classification of locally checkable problems in regular trees A Balliu, S Brandt, YJ Chang, D Olivetti, J Studený, J Suomela DISC 2022, 2022 | 8 | 2022 |
Locality helps sleep scheduling J Suomela WSW 2006, 2006 | 8 | 2006 |
Locality in online, dynamic, sequential, and distributed graph algorithms A Akbari, N Eslami, H Lievonen, D Melnyk, J Särkijärvi, J Suomela ICALP 2023, 2023 | 7* | 2023 |
Locally Optimal Load Balancing L Feuilloley, J Hirvonen, J Suomela DISC 2015, 2015 | 7 | 2015 |
Local approximation algorithms for a class of 0/1 max-min linear programs P Floréen, M Hassinen, P Kaski, J Suomela arXiv preprint arXiv:0806.0282, 2008 | 7* | 2008 |
Coordinating concurrent transmissions: A constant-factor approximation of maximum-weight independent set in local conflict graphs P Kaski, A Penttinen, J Suomela Ad Hoc & Sensor Wireless Networks 6 (3–4), 239–263, 2008 | 7 | 2008 |
Distributed Algorithms 2020 J Hirvonen, J Suomela | 6 | 2021 |
Using Round Elimination to Understand Locality J Suomela ACM SIGACT News 51, 63–81, 2020 | 6 | 2020 |
Local 3-approximation algorithms for weighted dominating set and vertex cover in quasi unit-disk graphs M Hassinen, V Polishchuk, J Suomela LOCALGOS 2008, 2008 | 6 | 2008 |
New methods for analysing diachronic suffix competition across registers: How -ity gained ground on -ness in Early Modern English P Rodríguez-Puente, T Säily, J Suomela International Journal of Corpus Linguistics 27 (4), 506-528, 2022 | 5 | 2022 |
Sinkless Orientation Made Simple A Balliu, JH Korhonen, F Kuhn, H Lievonen, D Olivetti, S Pai, A Paz, ... SOSA 2023, 2021 | 5* | 2021 |
Efficient Load-Balancing through Distributed Token Dropping S Brandt, B Keller, J Rybicki, J Suomela, J Uitto SPAA 2021, 2021 | 5* | 2021 |
Variation in the Productivity of Adjective Comparison in Present-Day English T Säily, V González-Díaz, J Suomela Corpus Approaches to Contemporary British Speech: Sociolinguistic Studies of …, 2018 | 5 | 2018 |
No distributed quantum advantage for approximate graph coloring X Coiteux-Roy, F d'Amore, R Gajjala, F Kuhn, FL Gall, H Lievonen, ... STOC 2024, 2024 | 4 | 2024 |
Lexical and function words or language and text type? Abbreviation consistency in an aligned corpus of Latin and Middle English plague tracts A Honkapohja, J Suomela Digital Scholarship in the Humanities 37 (3), 765-787, 2022 | 4 | 2022 |
Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete J Suomela cstheory.stackexchange.com, 2010 | 4* | 2010 |
Optimal backlog in the plane V Polishchuk, J Suomela ALGOSENSORS 2008, 2008 | 4 | 2008 |
Randomized algorithms for finding a majority element P Gawrychowski, J Suomela, P Uznański SWAT 2016, 2016 | 3 | 2016 |
A Course on Deterministic Distributed Algorithms J Suomela | 3 | 2014 |
Planar subgraphs without low-degree nodes E Kranakis, O Morales Ponce, J Suomela WADS 2011, 2011 | 3 | 2011 |
Distributed Half-Integral Matching and Beyond S Dahal, J Suomela SIROCCO 2023, 2023 | 2 | 2023 |
Mending Partial Solutions with Few Changes D Melnyk, J Suomela, N Villani OPODIS 2022, 2022 | 2 | 2022 |
Temporal Locality in Online Algorithms M Pacut, M Parham, J Rybicki, S Schmid, J Suomela, A Tereshchenko DISC 2022, 2022 | 2* | 2022 |
Sparse matrix multiplication in the low-bandwidth model C Gupta, J Hirvonen, J Korhonen, J Studený, J Suomela SPAA 2022, 2022 | 2 | 2022 |
Variation in morphological productivity in the history of English: The case of -er T Säily, J Suomela, E Mäkelä Presentation, International Society for the Linguistics of English (ISLE 4 …, 2016 | 2 | 2016 |
Lower bounds for local algorithms J Suomela 3rd Workshop on Advances in Distributed Graph Algorithms (ADGA 2014), 2014 | 2 | 2014 |
Online Locality Meets Distributed Quantum Computing A Akbari, X Coiteux-Roy, F d'Amore, FL Gall, H Lievonen, D Melnyk, ... arXiv preprint arXiv:2403.01903, 2024 | 1 | 2024 |
Distributed Binary Labeling Problems in High-Degree Graphs H Lievonen, T Picavet, J Suomela SIROCCO 2024, 2024 | 1 | 2024 |
Distributed derandomization revisited S Dahal, F d'Amore, H Lievonen, T Picavet, J Suomela DISC 2023, 2023 | 1* | 2023 |