Profile

Cover photo
Jukka Suomela
209 followers|228,429 views
AboutPostsPhotos+1's

Stream

Jukka Suomela

Shared publicly  - 
 
15 fully funded doctoral student positions in computer science.

Deadline: 29 February 2016.

#universityofhelsinki #aaltouniversity #phd #computerscience
1
Add a comment...

Jukka Suomela

Shared publicly  - 
 
 
A response by +Piotr Indyk to an editorial by 
+Moshe Vardi 
(ed: In a recent CACM editorial, CACM editor-in-chief +Moshe Vardi discussed Babai's result on graph isomorphism and the recent hardness result for edit distance in the context of a larger discussion on the significance of complexity-theoretic assumptions. +Piotr Indyk (one of the authors of the ...
1 comment on original post
1
Add a comment...

Jukka Suomela

Discussion  - 
 
Is THEORYNT dead?

Is everyone following DMANET?
1
Brent W. Hopkins's profile photoDavid Eppstein's profile photoJukka Suomela's profile photoHarry Zisopoulos's profile photo
4 comments
 
Never heard of THEORYNT before, I'd love to have a DMANET that's a bit more targeted and specific to theory. But yeah, checking the list, the latest messages seem to be from December...
Add a comment...

Jukka Suomela

Shared publicly  - 
 
University of Helsinki:

— "The number of University staff will reduce by approximately 980 by the end of 2017"
— "terminations will account for 570"
— "Of the employees to be terminated, 75 will represent teaching and research staff and 495 other staff"

#universityofhelsinki #helsinki
3
1
David Eppstein's profile photoJukka Suomela's profile photoAdam Smith's profile photoDee Roytenberg's profile photo
3 comments
 
I know it is not much consolation, but Canadian academics held tight (and fought back) for 9.5 years of the Harper government's attacks on, among other things, academic freedom and funding. The government has now changed and things are looking up again. So hold in there! It may be a rough ride, but I hope it will be short. 
Add a comment...

Jukka Suomela

Shared publicly  - 
 
Finally: pip3 install meson
 
Version 0.29.0 is out. The biggest change is that we now install using distutils/setuptools That means that installing Meson just got as easy as this:

pip3 install [your options] meson
View original post
1
Add a comment...

Jukka Suomela

Shared publicly  - 
 
 
2016 SIROCCO Prize for Innovation in Distributed Computing awarded to Masafumi (Mark) Yamashita

— laudatio: http://sirocco2016.hiit.fi/award/

Yamashita will give his award lecture at SIROCCO 2016 on 20 July 2016 in Helsinki, Finland

— conference web site: http://sirocco2016.hiit.fi/

Nominations are requested for the 2017 Prize for Innovation in Distributed Computing

— deadline 30 April 2016
— call for nominations: http://sirocco2016.hiit.fi/award-call/

#SIROCCO2016 #SIROCCO2017 #distributedcomputing
Laudatio. It is a pleasure to award the 2016 SIROCCO Prize for Innovation in distributed computing to Masafumi (Mark) Yamashita. Mark presented many original ideas and important results that have enriched the theoretical computer science community, and the distributed computing community, ...
View original post
2
1
Luca Aceto's profile photo
Add a comment...
Have them in circles
209 people
Tuomas Puikkonen's profile photo
Danupon Nanongkai's profile photo
Janne Korhonen's profile photo
Sajin Koroth's profile photo
Riitta Säily's profile photo
Helge Keitel's profile photo
Noon van der Silk's profile photo
Jani Jaakkola's profile photo
András Salamon's profile photo

Jukka Suomela

Announcements  - 
 
SIROCCO 2016 — 23rd International Colloquium on Structural Information and Communication Complexity, Helsinki, Finland

Call for Papers

— Submission deadline: 6 May 2016 (Friday)
— Notification of acceptance: 9 June 2016 (Thursday)
— Conference: 19–21 July 2016 (Tuesday–Thursday)

SIROCCO is devoted to the study of the interplay between communication and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints.

Original papers are solicited from all areas of study of local structural knowledge and global communication and computational complexities. Among the typical areas are distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, and communication complexity.

#sirocco2016 #distributedcomputing #parallelcomputing #communicationcomplexity #information #knowledge #callforpapers #cfp
Dates. Submission deadline: 6 May 2016 (Friday), at 23:59, anywhere on earth. Notification of acceptance: 9 June 2016 (Thursday); Conference: 19–21 July 2016 (Tuesday–Thursday). Theme. SIROCCO is devoted to the study of the interplay between communication and knowledge in multi-processor systems ...
5
1
Sajin Koroth's profile photo
Add a comment...

Jukka Suomela

Shared publicly  - 
 
Our paper "A Lower Bound for the Distributed Lovász Local Lemma" (with Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, and Jara Uitto) was accepted to STOC 2016.

The manuscript is available here: http://arxiv.org/abs/1511.00900

#stoc2016
Abstract: We show that any randomised Monte Carlo distributed algorithm for the Lov\'asz local lemma requires $\Omega(\log \log n)$ communication rounds, assuming that it finds a correct assignment with high probability. Our result holds even in the special case of $d = O(1)$, where $d$ is the ...
7
Add a comment...

Jukka Suomela

Shared publicly  - 
 
On Wednesday, University of Helsinki published their numbers of personnel reductions:
— total reductions 980, out of which teachers & researchers 295
— layoffs 570, out of which teachers & researchers 75.

Today, Aalto University did the same:
— total reductions 316, out of which teachers & researchers 175
— layoffs 188, out of which teachers & researchers 109.

("Total reductions" includes layoffs + retirements + fixed-term contracts that are not renewed.)

Today, University of Helsinki also announced their plans for introducing tuition fees. Previously, university education in Finland was entirely free for everyone, but in the future, our universities have to introduce tuition fees for non-EU students. For University of Helsinki, the fees will be 10ke–25ke.

#aaltouniversity #universityofhelsinki #universities #funding #finland
Total layoffs 188, personnel reductions by other means 128.
2
Ed S's profile photo
Ed S
 
Ouch.
Add a comment...

Jukka Suomela

Shared publicly  - 
 
This is an overview of the talk that I will give in Helsinki Algorithms Seminar on Thursday at Aalto University: https://www.hiit.fi/algorithms-seminar

— — —

Are parallel algorithms strictly more powerful than distributed algorithms?

More precisely, we will study graph problems in the following settings:

— parallel algorithm ≈ shared memory, multiple processors (e.g. CREW PRAM model with n processors),

— distributed algorithm ≈ computer network, message passing (e.g. LOCAL model).

In a parallel algorithm, the unknown input graph is stored in the memory, while in a distributed algorithm, the unknown input graph is encoded in the structure of the computer network.

While there are plenty of superficial differences between these two models of computing, the key fundamental difference is locality. In a distributed algorithm, whatever a node outputs after T steps can only depend on the input that is within distance T of the node in the network, while parallel algorithms do not have such limitations. In a parallel algorithm, any processor can directly read any part of the input.

It is easy to come up with some artificial graph problem that exploit this freedom. Here is a simple example: binary consensus. All nodes are labeled with an input label (0 or 1), and all nodes have to produce an output label (0 or 1). All nodes have to output the same label, and the common output label has to be equal to one of the input labels.

Now it is easy to design a parallel algorithm that solves this problem in O(1) time: for each node i, processor i reads the input of node 1, writes it as the output of node i, and stops.

It is also easy to see that this problem cannot be solved in o(n) time with any distributed algorithm. To see this, consider three possible worlds:
— a path labelled with 00...0000...00,
— a path labelled with 11...1111...11,
— a path labelled with 11...1100...00.
In the first case, all nodes have to output 0, and in the second case, all nodes have to output 1. In the third case, either output is fine, but all nodes have to produce the same output. If the common output is, e.g., 0, then nodes in the middle of the part "11...11" have to distinguish between the second case (in which they output 1) and the third case (in which they output 0), and this is not possible in o(n) time. The case of the common output 1 is analogous, we will just look at the second halves.

However, this is not a typical graph problem. For typical graph problems (graph colouring, independent sets, matchings, vertex covers, dominating sets …) it is much more difficult to have (super-exponential) separations between distributed and parallel algorithms.

In our recent work "Non-Local Probes Do Not Help with Graph Problems" (with Mika Göös, Juho Hirvonen, Reut Levi, and Moti Medina) we explain why this is the case: there is a large family of graph problems for which the existence of efficient parallel algorithms directly implies an efficient distributed algorithm. Parallel algorithms could try to access any part of the input graph directly, but this is not useful. You can find the manuscript here: http://arxiv.org/abs/1512.05411

#distributedalgorithms #parallelalgorithms #distributedcomputing #parallelcomputing #locality #aaltouniversity
Description. The Helsinki Algorithms Seminar is a weekly meeting of researchers in the Helsinki area interested in the art of algorithms and algorithm design, broadly interpreted to cover both theoretical ideas and algorithm engineering on concrete computing platforms.
3
1
Jukka Suomela's profile photoHelger Lipmaa's profile photo
Add a comment...

Jukka Suomela

Announcements  - 
 
PODC 2016 workshops announced —
see http://www.podc.org/ for more information:

Monday, 25 July 2016

— Biological Distributed Algorithms (BDA)
— Distributed Cloud Computing (DCC)
— Distributed Cryptocurrencies and Consensus Ledgers (DCCL)
— Theory of Transactional Memory (WTTM)

Friday, 29 July 2016

— Adaptive Resource Management and Scheduling for Cloud Computing (ARMS-CC)
— Distributed Computing: Mixing Systems and Theory (DeMiST)
— Realistic models for Algorithms in Wireless Networks (WRAWN)

#PODC2016Chicago #distributedcomputing #distributedalgorithms #biology #cloudcomputing #cryptocurrency #transactionalmemory #wirelessnetworks
1
1
Pedro Augusto's profile photo
Add a comment...

Jukka Suomela

Shared publicly  - 
 
Helsinki Algorithms Seminar meets again tomorrow, 14 January, at 4pm: https://www.hiit.fi/algorithms-seminar

Mika Göös will give a talk on "Communication Complexity vs. Partition Numbers".

Abstract: In communication complexity, perhaps the most basic observation is that a deterministic protocol computing a function F(x,y) partitions the communication matrix of F into 2^C monochromatic rectangles, where C is the number of bits exchanged between Alice and Bob. In other words, the logarithm of the partition number (least number of monochromatic rectangles needed to partition the communication matrix) is a lower bound on communication complexity.

We show that deterministic communication complexity can be superlogarithmic in the partition number. We also obtain near-optimal deterministic lower bounds for the related Clique vs. Independent Set problem (CIS; introduced by Yannakakis in 1988) that captures a one-sided variant of the partition number. In particular, this yields new lower bounds for the log-rank conjecture. We also provide some co-nondeterministic lower bounds for CIS, which has applications to the Alon--Saks--Seymour conjecture in graph theory.

To obtain the above results, we cheat: we study analogous questions in the easy-to-understand world of decision tree complexity, and then we "lift" these results over to communication complexity using a general simulation theorem.

Joint work with Toniann Pitassi and Thomas Watson.

#helsinki #aaltouniversity #algorithms
Description. The Helsinki Algorithms Seminar is a weekly meeting of researchers in the Helsinki area interested in the art of algorithms and algorithm design, broadly interpreted to cover both theoretical ideas and algorithm engineering on concrete computing platforms.
1
1
Helger Lipmaa's profile photo
Add a comment...
Jukka Suomela's +1's are the things they like, agree with, or want to recommend.
Why the Security of USB Is Fundamentally Broken | Threat Level | WIRED
www.wired.com

Computer users pass around USB sticks like silicon business cards. Although we know they often carry malware infections, we depend on antivi

It happened: Git 2.0 is here and it's full of goodies - Atlassian Blogs
blogs.atlassian.com

Git 2.0 is here and it’s full of goodies. This major release of `git` has been brewing for a long time and I am excited to go on the hunt in

Best paper awards at ICALP 2014
processalgebra.blogspot.com

The EATCS is proud to announce that the program committees of the three tracks of ICALP 2014 have selected the following papers for the best

Barcode / QR-Code / Bluetooth / RFID / NFC / DAQ / Label Software: Barco...
tec-it.blogspot.com

News on barcode software, 2D bar code software, Bluetooth, Auto-ID, RFID, AIDC, barcode labeling, reporting software, data acquisition and s

Moves
market.android.com

Moves automatically tracks your everyday life and exercise. Just carry your phone in your pocket or bag. FEATURES • Automatic Tracking: Reco

Google Play Книги
market.android.com

Google Play – это настоящий рай для книголюбов. В этом интернет-магазине вас ждут миллионы книг, в том числе бесплатных. Выберите из новинок

GPS Test
market.android.com

The GPS Test app for Android is a utility that shows GPS information read from your phones internal GPS. Will support GLONASS phones. The ap

Google Play Music
market.android.com

Google Play Music makes it easy to discover, play and share the music you love on Android and the web. With our new All Access service, you

Feedly News Reader. Blogs. RSS
market.android.com

"Feedly is what you needly" - David Pogue, New York Times.Feedly is a new way to browse the content of your favorite news sites, rss feeds,

Dropbox
market.android.com

Dropbox 提供免費的服務,讓您可以隨時隨地存取您所有的相片、文件和影片。一旦在電腦上安裝了 Dropbox,您儲存在 Dropbox 的任何檔案都會自動儲存到您所有的電腦、手機及 Dropbox 網站。有了 Dropbox 應用程式,您可以把重要的東西全部帶著走。即使是出門

Andropas Pro
market.android.com

Andropas Pro lisää uusia ominaisuuksia Andropas-ohjelmaan. Tue Andropaksen kehitystä ja osta Andropas Pro.Ominaisuudet: - Suosikkipysäkit ja

younited by F-Secure
market.android.com

With younited you can have all your stuff in a safe cloud. You can access your pictures, videos, music and docs with your Android and other

The selected-papers network
gowers.wordpress.com

This post is to report briefly on a new and to my mind very exciting venture in academic publishing. It's called the Selected Papers Network

What can be decided locally without identifiers? | Abstract Talk
www.abstract-talk.org

Abstract. Do unique node identifiers help in deciding whether a network G has a prescribed property P? We study this question in the context

The On-Line Encyclopedia of Integer Sequences™ (OEIS™)
oeis.org

The On-Line Encyclopedia of Integer Sequences™ (OEIS™). Enter a sequence, word, or sequence number: Hints. Note: Advanced searches are now m

ACM Digital Library
portal.acm.org

www.acm.org - The premier society in computing brings you the Computer Portal.

Fingerpori - HS.fi
www.hs.fi

Löydät Fingerporin Heimon, Allanin ja Mustanaamion HS.fi:stä. Luettavissa myös kaikki stripit vuodesta 2007.

Viivi & Wagner - HS.fi
www.hs.fi

Parhaat stripit ja parisuhteen hoitovinkit. Viivi & Wagner -arkistosta löydät kaiken parisuhteesta sian ja naisen sanoin. Jaa parhaat st

The Geomblog: Models for MapReduce
feedproxy.google.com

Models for MapReduce. I've been listening to Jeff Phillips' comparison of different models for MapReduce (he's teaching a class

Free online dictionary definitions for learners of English ...
www.oxfordadvancedlearnersdictionary.com

Free online dictionary definitions and pronunciations for learners of English from the bestselling Oxford Advanced Learner's Dictionary.