- Distributed algorithms for edge dominating sets
- Stable matchings from the perspective of distributed algorithms
- Stable matchings from the perspective of distributed algorithms
- Tanja Saily Research Unit for Variation, Contacts and Change in English Department of English, P.O. Box 24, FI-00014 University of Helsinki, Finland Jukka Suomela Helsinki Institute for Information Technology HIIT Department of Computer Science, P.O.
- Tanja Saily Research Unit for Variation, Contacts and Change in English Department of English, P.O. Box 24, FI-00014 University of Helsinki, Finland Jukka Suomela Helsinki Institute for Information Technology HIIT Department of Computer Science, P.O.
- A distributed approximation scheme for sleep scheduling in sensor networks
- [1] E. Falck, P. Floreen, P. Kaski, J. Kohonen, and P. Orponen. Balanced data gathering in energy-constrained sensor networks. Proc. ALGOSENSORS 2004, LNCS 3121, pages 5970, 2004. Springer.
- Approximating Relay Placement in Sensor Networks Jukka Suomela
- Optimal Backlog in the Plane Valentin Polishchuk and Jukka Suomela
- Coordinating Concurrent Transmissions: A Constant-Factor Approximation of
- Paderborn, 20 October 2009 Jukka Suomela --HIIT, University of Helsinki, Finland
- Local Approximation Algorithms for Scheduling Problems in Sensor Networks
- Local algorithms and max-min linear programs
- Lessons Learned in the Challenge: Making Predictions and Scoring Them
- Local approximation algorithms for scheduling problems in sensor networks
- Locality Helps Sleep Scheduling Jukka Suomela
- BeTelGeuse A Tool for Bluetooth Data Gathering
- Tight Local Approximation Results for Max-Min Linear Programs
- Coordinating Concurrent Transmissions: A Constant-Factor Approximation of
- Improved Approximation Algorithms for Relay Placement
- Helsinki Institute for Information Technology HIIT, Department of Computer Science, P. O. Box 68, FI-00014 University of Helsinki, Finland. HIIT is a joint research institute of University of Helsinki and Helsinki University of Technology. Research suppor
- Brief Announcement: Distributed Almost Stable Marriage
- Tight local approximation results for max-min linear programs
- Analysing local algorithms in location-aware quasi unit-disk graphs
- Coordinating concurrent transmissions: A constant-factor approximation of
- NOTICE: This is the author's version of a work that was accepted for publication in Information Processing Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural
- Locally Checkable Proofs mika.goos@cs.helsinki.fi
- Locally Checkable Proofs Mika Goos & Jukka Suomela
- Distributed Algorithms for Edge Dominating Sets Jukka Suomela
- Fast Distributed Approximation Algorithms for Vertex Cover and Set Cover in Anonymous Networks
- HIIT seminar, 16 October 2009 Jukka Suomela
- Models of distributed computing: port numbering and local algorithms
- A Local 2-approximation Algorithm for the Vertex Cover Problem
- An Optimal Local Approximation Algorithm for Max-Min Linear Programs
- Comparing type counts: The case of women, men and -ity in early English letters
- Approximating max-min linear programs with local algorithms
- A distributed approximation scheme for sleep scheduling in sensor networks
- A System for Context-Dependent User Modeling Petteri Nurmi1
- Relay Placement in Sensor Networks Jukka Suomela
- Lessons Learned in the Challenge: Making Predictions and Scoring Them
- Brief Announcement: Distributed Almost Stable Marriage
- Local 3-approximation algorithms for weighted dominating set and vertex cover
- The Minimum-Backlog Problem Michael A. Bender, Sandor P. Fekete, Alexander Kroller, Vincenzo
- BeTelGeuse: Tool for Context Data Gathering via Bluetooth
- Relay Placement in Sensor Networks Jukka Suomela
- Local algorithms in (weakly) coloured graphs Matti Astrand, Valentin Polishchuk, Joel Rybicki,
- Computational Complexity of Relay Placement in Sensor Networks
- Computational Complexity of Relay Placement in Sensor Networks
- Locality helps sleep scheduling Jukka Suomela
- Approximating Max-min Linear Programs with Local Algorithms Patrik Floreen Petteri Kaski Topi Musto Jukka Suomela
- Localalgorithms Patrik Floreen Marja Hassinen Petteri Kaski
- Department of Computer Science Series of Publications A
- Locally Checkable Proofs Mika Goos and Jukka Suomela
- Planar Subgraphs without Low-Degree Nodes Evangelos Kranakis1
- Local approximability of max-min and min-max linear programs
- Fast distributed approximation algorithms for vertex cover and
- s.t. Ax 1, SPAA, Calgary, Canada, 13 August 2009
- arXiv:0806.0282v1[cs.DC]2Jun2008 Local Approximation Algorithms for a Class of
- Approximating vertex covers in anonymous networks
- DISC, Elche, Spain, 23 September 2009 Matti strand Patrik Floren Valentin Polishchuk
- SURVEY OF LOCAL ALGORITHMS JUKKA SUOMELA
- A distributed approximation scheme for sleep scheduling in sensor networks
- Approximating max-min linear programs with local algorithms
- Jukka Suomela Helsinki Institute for Information Technology HIIT
- Distributed Maximal Matching: Greedy is Optimal
- Lower Bounds for Local Approximation Mika Goos, Juho Hirvonen, and Jukka Suomela
- Weak Models of Distributed Computing, with Connections to Modal Logic