Blog

IGAFIT Algorithmic Colloquium

By sank We are excited to announce a new online seminar – IGAFIT Algorithmic Colloquium. This new event aims to integrate the European algorithmic community and keep it connected during the times of the pandemic. This online seminar will take place biweekly on Thursday at 14:00 CET, with the talks lasting for 45 …read more From::

Read on »

Faster PageRank on MPC

By sank Years ago when I learned about Google PageRank algorithm, my first reaction was this is not the way it should be done! There should be some proof. This probably just shows that my CS education was too theoretical ;). Years later I have learned that indeed there are some nice …read more From::

Read on »

Postdoc position in theoretical computer science

By Renata Czarniecka We announce POSTDOC POSITIONS at the Institute of Informatics, University of Warsaw, Poland. The positions are supported by the ERC Consolidator Grant TUgbOAT: “Towards Unification of Algorithmic Tools” led by Piotr Sankowski. The TUgbOAT’ focus is on basic algorithmic problems. Example topics include: * algorithms for finding matchings in graphs; * online

Read on »

We are looking for YOU to join our award-winning scientific team!

By Renata Czarniecka Have you just graduated your PhD and are considering a post-doc position in theory of informatics? Science is your passion and you would like to spend most of your post-doc researching on whatever interests you? You are in the right place. At MIM UW we offer you: Great FREEDOM OF CHOICE related

Read on »

Call for Invited Talk Nominations: HALG 2020

By sank 5th Highlights of Algorithms conference (HALG 2020) ETH Zurich, June 3-5, 2020​http://2020.highlightsofalgorithms.org/ The HALG 2020 conference seeks high-quality nominations for invited talks that will highlight recent advances in algorithmic research. Similarly to previous years, there are two categories of invited talks: A. survey (60 minutes): a survey of an …read more From:: Banach’s

Read on »

Call for Participation: HALG 2019 (Highlights of Algorithms)

4rd Highlights of Algorithms conference (HALG 2019) Copenhagen, June 14-16, 2019 http://highlightsofalgorithms.org/ The Highlights of Algorithms conference is a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area. The conference will provide a broad picture of the latest research in algorithms …read more From:: Banach’s

Read on »

The Curse of Euclidean Metric: Square Roots

By Renata Czarniecka The deadline was approaching without mercy and there was, of course, still some polishing to be done for our SODA paper. But then we run into an issue. To make things worse, this issue turned out to be a hard one, a fundamental known open problem in computational geometry. …read more From::

Read on »

How to identify m numbers using m/log m checks

By Renata Czarniecka Here’s an old trick that we found useful for proving some tight complexity lower bounds. You are given m coins, each of weight either a or b, and a modern scale that can tell you the total weight of any chosen subset of coins. How many weighings do …read more From:: Banach’s

Read on »

HALG 2019 – Call For Submissions of Short Contributed Presentations

By sank The HALG 2019 conference seeks submissions for contributed presentations. Each presentation is expected to consist of a poster and a short talk (an invitation to the poster). There will be no conference proceedings, hence presenting work already published at a different venue or journal (or to be submitted there) is …read more From::

Read on »