default search action
Jukka Suomela
Person information
- affiliation (since 2014): Aalto University, Department of Computer Science, Espoo, Finland
- affiliation (2009-2013): Helsinki Institute for Information Technology (HIIT), Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2009
- [b1]Jukka Suomela:
Optimisation problems in wireless sensor networks: Local algorithms and local graphs. University of Helsinki, Finland, 2009
Journal Articles
- 2024
- [j31]Sameep Dahal, Jukka Suomela
:
Distributed half-integral matching and beyond. Theor. Comput. Sci. 982: 114278 (2024) - 2023
- [j30]Alkida Balliu
Locally checkable problems in rooted trees. Distributed Comput. 36(3): 277-311 (2023) - [j29]Yi-Jun Chang, Jan Studený, Jukka Suomela
Distributed graph problems through an automata-theoretic lens. Theor. Comput. Sci. 951: 113710 (2023) - 2022
- [j28]Alpo Honkapohja
Lexical and function words or language and text type? Abbreviation consistency in an aligned corpus of Latin and Middle English plague tracts. Digit. Scholarsh. Humanit. 37(3): 765-787 (2022) - 2021
- [j27]Alkida Balliu
Almost global problems in the LOCAL model. Distributed Comput. 34(4): 259-281 (2021) - [j26]Alkida Balliu
Lower Bounds for Maximal Matchings and Maximal Independent Sets. J. ACM 68(5): 39:1-39:30 (2021) - 2020
- [j25]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn
Improved distributed degree splitting and edge coloring. Distributed Comput. 33(3-4): 293-310 (2020) - [j24]Jukka Suomela
Using Round Elimination to Understand Locality. SIGACT News 51(3): 63-81 (2020) - [j23]Jukka Suomela:
Structural Information and Communication Complexity. Theor. Comput. Sci. 810: 1 (2020) - 2019
- [j22]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz
Algebraic methods in the congested clique. Distributed Comput. 32(6): 461-478 (2019) - [j21]Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela:
Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations. Bull. EATCS 127 (2019) - 2018
- [j20]Jukka Suomela:
The Presburger Award for Young Scientists 2019 - Call for Nominations. Bull. EATCS 126 (2018) - [j19]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela
Node labels in local decision. Theor. Comput. Sci. 751: 61-73 (2018) - 2017
- [j18]Juho Hirvonen, Joel Rybicki, Stefan Schmid
Large Cuts with Local Algorithms on Triangle-Free Graphs. Electron. J. Comb. 24(4): 4 (2017) - [j17]Mika Göös, Juho Hirvonen, Jukka Suomela
Linear-in-Δ lower bounds in the LOCAL model. Distributed Comput. 30(5): 325-338 (2017) - [j16]Christoph Lenzen, Joel Rybicki
Efficient Counting with Optimal Resilience. SIAM J. Comput. 46(4): 1473-1500 (2017) - 2016
- [j15]Danny Dolev, Keijo Heljanko
Synchronous counting and computational algorithm design. J. Comput. Syst. Sci. 82(2): 310-332 (2016) - [j14]Alon Efrat
Improved Approximation Algorithms for Relay Placement. ACM Trans. Algorithms 12(2): 20:1-20:28 (2016) - [j13]Henning Hasemann, Juho Hirvonen, Joel Rybicki
Deterministic local algorithms, unique identifiers, and fractional graph colouring. Theor. Comput. Sci. 610: 204-217 (2016) - [j12]Mika Göös, Jukka Suomela
Locally Checkable Proofs in Distributed Computing. Theory Comput. 12(1): 1-33 (2016) - 2015
- [j11]Lauri Hella
Weak models of distributed computing, with connections to modal logic. Distributed Comput. 28(1): 31-53 (2015) - [j10]Michael A. Bender, Sándor P. Fekete
The minimum backlog problem. Theor. Comput. Sci. 605: 51-61 (2015) - 2014
- [j9]Mika Göös, Jukka Suomela
No sublogarithmic-time approximation scheme for bipartite vertex cover. Distributed Comput. 27(6): 435-443 (2014) - 2013
- [j8]Jukka Suomela
Survey of local algorithms. ACM Comput. Surv. 45(2): 24:1-24:40 (2013) - [j7]Mika Göös, Juho Hirvonen, Jukka Suomela
Lower bounds for local approximation. J. ACM 60(5): 39:1-39:23 (2013) - 2011
- [j6]Marja Hassinen, Joel Kaasinen, Evangelos Kranakis
Analysing local algorithms in location-aware quasi-unit-disk graphs. Discret. Appl. Math. 159(15): 1566-1580 (2011) - [j5]Patrik Floréen
Local Approximability of Max-Min and Min-Max Linear Programs. Theory Comput. Syst. 49(4): 672-697 (2011) - 2010
- [j4]Patrik Floréen
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. Algorithmica 58(1): 102-118 (2010) - 2009
- [j3]Valentin Polishchuk, Jukka Suomela
A simple local 3-approximation algorithm for vertex cover. Inf. Process. Lett. 109(12): 642-645 (2009) - 2008
- [j2]Petteri Kaski, Aleksi Penttinen, Jukka Suomela:
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. Ad Hoc Sens. Wirel. Networks 6(3-4): 239-263 (2008) - 2007
- [j1]Jukka Suomela
Approximability of identifying codes and locating-dominating codes. Inf. Process. Lett. 103(1): 28-33 (2007)
Conference and Workshop Papers
- 2024
- [c81]Alkida Balliu
Brief Announcement: Local Advice and Local Decompression. PODC 2024: 117-120 - [c80]Henrik Lievonen
Distributed Binary Labeling Problems in High-Degree Graphs. SIROCCO 2024: 402-419 - [c79]Chetan Gupta
Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. SPAA 2024: 305-307 - [c78]Xavier Coiteux-Roy
No Distributed Quantum Advantage for Approximate Graph Coloring. STOC 2024: 1901-1910 - 2023
- [c77]Amirreza Akbari, Navid Eslami, Henrik Lievonen
Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms. ICALP 2023: 10:1-10:20 - [c76]Sameep Dahal
Distributed Half-Integral Matching and Beyond. SIROCCO 2023: 339-356 - [c75]Alkida Balliu
Sinkless Orientation Made Simple. SOSA 2023: 175-191 - [c74]Chetan Gupta
Fast Dynamic Programming in Trees in the MPC Model. SPAA 2023: 443-453 - [c73]Sameep Dahal, Francesco D'Amore
Brief Announcement: Distributed Derandomization Revisited. DISC 2023: 40:1-40:5 - 2022
- [c72]Darya Melnyk
Mending Partial Solutions with Few Changes. OPODIS 2022: 21:1-21:17 - [c71]Alkida Balliu
Local Mending. SIROCCO 2022: 1-20 - [c70]Chetan Gupta
Sparse Matrix Multiplication in the Low-Bandwidth Model. SPAA 2022: 435-444 - [c69]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti
Efficient Classification of Locally Checkable Problems in Regular Trees. DISC 2022: 8:1-8:19 - [c68]Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid
Brief Announcement: Temporal Locality in Online Algorithms. DISC 2022: 52:1-52:3 - 2021
- [c67]Alkida Balliu
Locally Checkable Problems in Rooted Trees. PODC 2021: 263-272 - [c66]Yi-Jun Chang
Distributed Graph Problems Through an Automata-Theoretic Lens. SIROCCO 2021: 31-49 - [c65]Sebastian Brandt
Efficient Load-Balancing through Distributed Token Dropping. SPAA 2021: 129-139 - [c64]Alkida Balliu
Locally Checkable Labelings with Small Messages. DISC 2021: 8:1-8:18 - [c63]Janne H. Korhonen, Ami Paz
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. DISC 2021: 58:1-58:4 - 2020
- [c62]Jukka Suomela
Can We Automate Our Own Work - or Show That It Is Hard? (Invited Talk). OPODIS 2020: 3:1-3:1 - [c61]Will Rosenbaum, Jukka Suomela
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. PODC 2020: 89-98 - [c60]Alkida Balliu
How much does randomness help with locally checkable problems? PODC 2020: 299-308 - [c59]Alkida Balliu
Brief Announcement: Classification of Distributed Binary Labeling Problems. PODC 2020: 349-351 - [c58]Jukka Suomela
Landscape of Locality (Invited Talk). SWAT 2020: 2:1-2:1 - [c57]Alkida Balliu
Classification of Distributed Binary Labeling Problems. DISC 2020: 17:1-17:17 - [c56]Sebastian Brandt
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. DISC 2020: 40:1-40:3 - [c55]Yi-Jun Chang
Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. DISC 2020: 41:1-41:3 - 2019
- [c54]Alkida Balliu
Lower Bounds for Maximal Matchings and Maximal Independent Sets. FOCS 2019: 481-497 - [c53]Klaus-Tycho Foerster
On the Power of Preprocessing in Decentralized Network Optimization. INFOCOM 2019: 1450-1458 - [c52]Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela:
2019 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2019: 1 - [c51]Alkida Balliu
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. PODC 2019: 262-271 - [c50]Alkida Balliu
Hardness of Minimal Symmetry Breaking in Distributed Computing. PODC 2019: 369-378 - [c49]Alkida Balliu
Locality of Not-so-Weak Coloring. SIROCCO 2019: 37-51 - 2018
- [c48]Thomas Petig, Elad Michael Schiller, Jukka Suomela
Changing Lanes on a Highway. ATMOS 2018: 9:1-9:15 - [c47]Janne H. Korhonen, Jukka Suomela
Towards a Complexity Theory for the Congested Clique. SPAA 2018: 163-172 - [c46]Alkida Balliu
New classes of distributed time complexity. STOC 2018: 1307-1318 - [c45]Alkida Balliu
Almost Global Problems in the LOCAL Model. DISC 2018: 9:1-9:16 - [c44]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela
Distributed Recoloring. DISC 2018: 12:1-12:17 - 2017
- [c43]Tuomo Lempiäinen, Jukka Suomela
Constant Space and Non-Constant Time in Distributed Computing. OPODIS 2017: 30:1-30:16 - [c42]Sebastian Brandt
LCL Problems on Grids. PODC 2017: 101-110 - [c41]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela
Improved Distributed Degree Splitting and Edge Coloring. DISC 2017: 19:1-19:15 - [c40]Janne H. Korhonen, Jukka Suomela
Brief Announcement: Towards a Complexity Theory for the Congested Clique. DISC 2017: 55:1-55:3 - 2016
- [c39]Sebastian Brandt
A lower bound for the distributed Lovász local lemma. STOC 2016: 479-488 - [c38]Pawel Gawrychowski, Jukka Suomela
Randomized Algorithms for Finding a Majority Element. SWAT 2016: 9:1-9:14 - [c37]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina
Non-local Probes Do Not Help with Many Graph Problems. DISC 2016: 201-214 - 2015
- [c36]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz
Algebraic Methods in the Congested Clique. PODC 2015: 143-152 - [c35]Christoph Lenzen, Joel Rybicki
Towards Optimal Synchronous Counting. PODC 2015: 441-450 - [c34]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela
Node Labels in Local Decision. SIROCCO 2015: 31-45 - [c33]Joel Rybicki
Exact Bounds for Distributed Graph Colouring. SIROCCO 2015: 46-60 - [c32]Laurent Feuilloley
Locally Optimal Load Balancing. DISC 2015: 544-558 - 2014
- [c31]Mika Göös, Juho Hirvonen, Jukka Suomela
Linear-in-delta lower bounds in the LOCAL model. PODC 2014: 86-95 - [c30]Miikka Hilke, Christoph Lenzen, Jukka Suomela
Brief announcement: local approximability of minimum dominating set on planar graphs. PODC 2014: 344-346 - [c29]Juhana Laurinharju, Jukka Suomela
Brief announcement: linial's lower bound made easy. PODC 2014: 377-378 - 2013
- [c28]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela
What can be decided locally without identifiers? PODC 2013: 157-165 - [c27]Stefan Schmid
Exploiting locality in distributed SDN control. HotSDN 2013: 121-126 - [c26]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki
Synchronous Counting and Computational Algorithm Design. SSS 2013: 237-250 - 2012
- [c25]Juho Hirvonen, Jukka Suomela
Distributed maximal matching: greedy is optimal. PODC 2012: 165-174 - [c24]Mika Göös, Juho Hirvonen, Jukka Suomela
Lower bounds for local approximation. PODC 2012: 175-184 - [c23]Lauri Hella
Weak models of distributed computing, with connections to modal logic. PODC 2012: 185-194 - [c22]Henning Hasemann, Juho Hirvonen, Joel Rybicki
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring. SIROCCO 2012: 48-60 - [c21]Mika Göös, Jukka Suomela
No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover. DISC 2012: 181-194 - 2011
- [c20]Mika Göös, Jukka Suomela
Locally checkable proofs. PODC 2011: 159-168 - [c19]Evangelos Kranakis
Planar Subgraphs without Low-Degree Nodes. WADS 2011: 583-594 - 2010
- [c18]Patrik Floréen
Brief announcement: distributed almost stable marriage. PODC 2010: 281-282 - [c17]Jukka Suomela
Distributed algorithms for edge dominating sets. PODC 2010: 365-374 - [c16]Matti Åstrand, Jukka Suomela
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. SPAA 2010: 294-302 - 2009
- [c15]Patrik Floréen
An optimal local approximation algorithm for max-min linear programs. SPAA 2009: 260-269 - [c14]Christoph Lenzen, Jukka Suomela
Local Algorithms: Self-stabilization on Speed. SSS 2009: 17-34 - [c13]Matti Åstrand, Patrik Floréen
A Local 2-Approximation Algorithm for the Vertex Cover Problem. DISC 2009: 191-205 - 2008
- [c12]Patrik Floréen
Tight Local Approximation Results for Max-Min Linear Programs. ALGOSENSORS 2008: 2-17 - [c11]Valentin Polishchuk, Jukka Suomela
Optimal Backlog in the Plane. ALGOSENSORS 2008: 141-150 - [c10]Alon Efrat
Improved Approximation Algorithms for Relay Placement. ESA 2008: 356-367 - [c9]Patrik Floréen
Approximating max-min linear programs with local algorithms. IPDPS 2008: 1-10 - 2007
- [c8]Petteri Kaski, Aleksi Penttinen, Jukka Suomela
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. ADHOC-NOW 2007: 74-86 - [c7]Patrik Floréen
Local Approximation Algorithms for Scheduling Problems in Sensor Networks. ALGOSENSORS 2007: 99-113 - [c6]Petteri Nurmi, Joonas Kukkonen, Eemil Lagerspetz, Jukka Suomela
BeTelGeuse: a tool for Bluetooth data gathering. BODYNETS 2007: 21 - [c5]Patrik Floréen
A distributed approximation scheme for sleep sceduling in sensor networks. SECON 2007: 152-161 - 2006
- [c4]Petteri Nurmi
A System for Context-Dependent User Modeling. OTM Workshops (2) 2006: 1894-1903 - [c3]Jukka Suomela
Approximating relay placement in sensor networks. PE-WASUN 2006: 145-148 - [c2]Jukka Suomela
Computational Complexity of Relay Placement in Sensor Networks. SOFSEM 2006: 521-529 - 2005
- [c1]Jukka Kohonen, Jukka Suomela
Lessons Learned in the Challenge: Making Predictions and Scoring Them. MLCW 2005: 95-116
Editorship
- 2019
- [e2]Jukka Suomela:
33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary. LIPIcs 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-126-9 [contents] - 2016
- [e1]Jukka Suomela
Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9988, 2016, ISBN 978-3-319-48313-9 [contents]
Data and Artifacts
- 2022
- [d3]Paula Rodríguez-Puente
Data for the article "New methods for analysing diachronic suffix competition across registers". Zenodo, 2022 - [d2]Jukka Suomela
Code for the article "New methods for analysing diachronic suffix competition across registers". Zenodo, 2022 - [d1]Jukka Suomela
TypeRatio: comparing competing suffixes. Zenodo, 2022
Informal and Other Publications
- 2024
- [i66]Amirreza Akbari, Xavier Coiteux-Roy
Online Locality Meets Distributed Quantum Computing. CoRR abs/2403.01903 (2024) - [i65]Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi:
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. CoRR abs/2404.15559 (2024) - [i64]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela:
Local Advice and Local Decompression. CoRR abs/2405.04519 (2024) - [i63]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Shared Randomness Helps with Local Distributed Problems. CoRR abs/2407.05445 (2024) - [i62]Anubhav Dhar, Eli Kujawa, Henrik Lievonen, Augusto Modanese, Mikail Muftuoglu, Jan Studený, Jukka Suomela:
Local problems in trees across a wide range of distributed models. CoRR abs/2409.13795 (2024) - 2023
- [i61]Sameep Dahal, Jukka Suomela:
Distributed Half-Integral Matching and Beyond. CoRR abs/2303.05250 (2023) - [i60]Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi:
Fast Dynamic Programming in Trees in the MPC Model. CoRR abs/2305.03693 (2023) - [i59]Sameep Dahal, Francesco D'Amore, Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Distributed derandomization revisited. CoRR abs/2305.07351 (2023) - [i58]Xavier Coiteux-Roy
No distributed quantum advantage for approximate graph coloring. CoRR abs/2307.09444 (2023) - [i57]Henrik Lievonen, Timothé Picavet, Jukka Suomela:
Distributed Binary Labeling Problems in High-Degree Graphs. CoRR abs/2312.12243 (2023) - 2022
- [i56]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela:
Efficient Classification of Local Problems in Regular Trees. CoRR abs/2202.08544 (2022) - [i55]Chetan Gupta, Juho Hirvonen, Janne Korhonen, Jan Studený, Jukka Suomela:
Sparse matrix multiplication in the low-bandwidth model. CoRR abs/2203.01297 (2022) - [i54]Darya Melnyk, Jukka Suomela, Neven Villani
Mending Partial Solutions with Few Changes. CoRR abs/2209.05363 (2022) - 2021
- [i53]Alkida Balliu, Juho Hirvonen, Darya Melnyk
Local Mending. CoRR abs/2102.08703 (2021) - [i52]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
Locally Checkable Problems in Rooted Trees. CoRR abs/2102.09277 (2021) - [i51]Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko:
Locality in Online Algorithms. CoRR abs/2102.09413 (2021) - [i50]Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Locally Checkable Labelings with Small Messages. CoRR abs/2105.05574 (2021) - [i49]Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Sinkless orientation is hard also in the supported LOCAL model. CoRR abs/2108.02655 (2021) - [i48]Amirreza Akbari, Henrik Lievonen, Darya Melnyk
Online Algorithms with Lookaround. CoRR abs/2109.06593 (2021) - 2020
- [i47]Yi-Jun Chang, Jan Studený, Jukka Suomela:
Distributed graph problems through an automata-theoretic lens. CoRR abs/2002.07659 (2020) - [i46]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Efficient Load-Balancing through Distributed Token Dropping. CoRR abs/2005.07761 (2020) - 2019
- [i45]Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
Lower bounds for maximal matchings and maximal independent sets. CoRR abs/1901.02441 (2019) - [i44]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
How much does randomness help with locally checkable problems? CoRR abs/1902.06803 (2019) - [i43]Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela:
Locality of not-so-weak coloring. CoRR abs/1904.05627 (2019) - [i42]Will Rosenbaum, Jukka Suomela:
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. CoRR abs/1907.08160 (2019) - [i41]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of distributed binary labeling problems. CoRR abs/1911.13294 (2019) - 2018
- [i40]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. CoRR abs/1802.06742 (2018) - [i39]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
Almost Global Problems in the LOCAL Model. CoRR abs/1805.04776 (2018) - [i38]Alkida Balliu, Juho Hirvonen, Dennis Olivetti, Jukka Suomela:
Hardness of minimal symmetry breaking in distributed computing. CoRR abs/1811.01643 (2018) - [i37]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
The distributed complexity of locally checkable problems on paths is decidable. CoRR abs/1811.01672 (2018) - [i36]Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid, Jukka Suomela:
On the Power of Preprocessing in Decentralized Network Optimization. CoRR abs/1812.00854 (2018) - 2017
- [i35]Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL problems on grids. CoRR abs/1702.05456 (2017) - [i34]Janne H. Korhonen, Jukka Suomela:
Towards a complexity theory for the congested clique. CoRR abs/1705.03284 (2017) - [i33]Tuomo Lempiäinen, Jukka Suomela:
Constant Space and Non-Constant Time in Distributed Computing. CoRR abs/1705.03876 (2017) - [i32]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. CoRR abs/1706.04746 (2017) - [i31]Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski:
Distributed Colour Reduction Revisited. CoRR abs/1709.00901 (2017) - [i30]Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela:
New Classes of Distributed Time Complexity. CoRR abs/1711.01871 (2017) - 2016
- [i29]Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski:
Randomized algorithms for finding a majority element. CoRR abs/1603.01583 (2016) - 2015
- [i28]Laurent Feuilloley, Juho Hirvonen, Jukka Suomela:
Locally Optimal Load Balancing. CoRR abs/1502.04511 (2015) - [i27]Joel Rybicki, Jukka Suomela:
Exact bounds for distributed graph colouring. CoRR abs/1502.04963 (2015) - [i26]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. CoRR abs/1503.04963 (2015) - [i25]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Towards Optimal Synchronous Counting. CoRR abs/1503.06702 (2015) - [i24]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela:
Node Labels in Local Decision. CoRR abs/1507.00909 (2015) - [i23]Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto:
A Lower Bound for the Distributed Lovász Local Lemma. CoRR abs/1511.00900 (2015) - [i22]Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. CoRR abs/1511.02525 (2015) - [i21]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-Local Probes Do Not Help with Graph Problems. CoRR abs/1512.05411 (2015) - 2014
- [i20]Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Large Cuts with Local Algorithms on Triangle-Free Graphs. CoRR abs/1402.2543 (2014) - [i19]Miikka Hilke, Christoph Lenzen, Jukka Suomela:
Local Approximability of Minimum Dominating Set on Planar Graphs. CoRR abs/1402.2549 (2014) - [i18]Juhana Laurinharju, Jukka Suomela:
Linial's Lower Bound Made Easy. CoRR abs/1402.2552 (2014) - [i17]Jukka Suomela:
Median Filtering is Equivalent to Sorting. CoRR abs/1406.1717 (2014) - 2013
- [i16]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? CoRR abs/1302.2570 (2013) - [i15]Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-$Δ$ Lower Bounds in the LOCAL Model. CoRR abs/1304.1007 (2013) - [i14]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. CoRR abs/1304.5719 (2013) - 2012
- [i13]Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower Bounds for Local Approximation. CoRR abs/1201.6675 (2012) - [i12]Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak Models of Distributed Computing, with Connections to Modal Logic. CoRR abs/1205.2051 (2012) - [i11]Mika Göös, Jukka Suomela:
No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover. CoRR abs/1205.4605 (2012) - 2011
- [i10]Juho Hirvonen, Jukka Suomela:
Distributed Maximal Matching: Greedy is Optimal. CoRR abs/1110.0367 (2011) - 2010
- [i9]Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto:
Local algorithms in (weakly) coloured graphs. CoRR abs/1002.0125 (2010) - 2009
- [i8]Christoph Lenzen, Jukka Suomela, Roger Wattenhofer:
Local Algorithms: Self-Stabilization on Speed. Algorithmic Methods for Distributed Cooperative Systems 2009 - 2008
- [i7]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Tight local approximation results for max-min linear programs. CoRR abs/0804.4815 (2008) - [i6]Valentin Polishchuk, Jukka Suomela:
Optimal backlog in the plane. CoRR abs/0804.4819 (2008) - [i5]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Local approximation algorithms for a class of 0/1 max-min linear programs. CoRR abs/0806.0282 (2008) - [i4]Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. CoRR abs/0809.1489 (2008) - [i3]Valentin Polishchuk, Jukka Suomela:
A simple local 3-approximation algorithm for vertex cover. CoRR abs/0810.2175 (2008) - [i2]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Almost stable matchings in constant time. CoRR abs/0812.4893 (2008) - 2007
- [i1]Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela:
Approximating max-min linear programs with local algorithms. CoRR abs/0710.1499 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: