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

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

By sank I think we have an exciting program that awaits us during HALG 2019: http://highlightsofalgorithms.org/speakers. Please remember that the call for short contributed talks