Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 19, 2016, 12:15 pm

Duration: 45 minutes

Location: OAT S15/S16/S17

Speaker: Asier Mujika

Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set

Choosing a permutation of n elements uniformly at random is a well-known problem, and it is a simple exercise to design an algorithm which achieves this in time O(n). One natural generalization of the problem is to give weights to the elements, and then draw a permutation based on the distribution induced by these weights, where elements with higher weights are more likely to be at the beginning. In this presentation we will overview existing algorithms for this problem, and describe some new approaches. Even though an algorithm that runs in time O(n) is known, it is fairly complicated. On the other hand, we will see a much simpler algorithm which runs in time O(n log log n) (and is actually possible to implement!) and even O(n) under some restrictions. All in all, we will see some neat algorithm design tricks.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login