Searching with Dice: Skip lists and Randomized Binary search trees

Esteu aquí

Inici » Notícies » Searching with Dice: Skip lists and Randomized Binary search trees

Papers we love Barcelona is back and we already have a list of amazing talks for the next months. The events will alternate between noon at the University and evenings at some company to be sure that everyone can attend.

dijous 15 febrer 2018

The usefulness of randomization in the design of algorithms has been known for a long time (Rabin's primality test or Karger's algorithm). Randomized algorithms usually yield algorithms which are simple, elegant, with guaranteed expected performance and practical.

This event will take place on Wednesday, 28th of February, from 12:00 a.m. to 2:00 p.m. in the Sala d'Actes Manuel Martí Recober (FIB).

The speaker during the event will be Conrado Martinez, professor from the UPC.

The two papers of this event are:

For more information and assistance www.meetup.com/es-ES/papers-we-love-bcn/events/247274095/?eventId=247274095

What to bring:

You don't need to bring anything especial for this meetup.

Important to know:

Reading the papers is not a must but you should come in an open minded mood :)

This is an event organized by the UPC ACM Student Chapter for more information www.upc.acm.org. If you need anything you can contact us at .