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, November 30, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Johannes Lengler

Random Integers

In this talk, we will study random integers. More precisely, we look at integers drawn uniformly at random. Obviously, this does not make sense because it is impossible to sample from the set of all integers uniformly at random. Nevertheless, we will see that it is still possible to make some precise statements.

Once we have understood which statements are allowed, we are able to address question like "How many random integral vectors of size n do we need in order that they span the whole space Z^n, a.a.s. for n-> oo?"

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