Tag - Computation Models

Data Structures Lower Bounds Tue, Jul 24, 2018 12:30 CEST

Speakers: Aurélien Ooms

Sorting in the Asymmetric External Memory Model Wed, Jun 27, 2018 12:30 CEST

Speakers: Nodari Sitchinava

Quantum SDP-Solvers: Better upper bounds Wed, Apr 11, 2018 12:00 CEST

Speakers: Sander Gribling

Sorting and selection in restricted models Wed, Mar 28, 2018 12:30 CEST

Speakers: Varunkumar Jayapaul

Lower bounds for quantum sorting Wed, Nov 8, 2017 12:00 CET

Speakers: Gwenaël Joret

The Cache Oblivious Model of Computation Thu, Oct 12, 2017 12:15 CEST

Speakers: John Iacono

In the standard model of computation often taught in computer science courses one identifies elementary operations and counts them in order to obtain the runtime. However, given the complexity of computing hardware, this measure often does not correlate well with actual observed runtime on a computer; accessing n items sequentially or randomly typically have runtimes that differ by several orders of magnitude. In this talk I will present the cache-oblivious model of computation, a model that was introduced by Prokop in 1999 and is relatively easy to reason with, by modeling the multilevel caches that are a defining feature of the cost of modern computation. After presenting the model, several data structure and algorithms that illustrate design techniques to develop cache-obliviously optimal structures will be presented.

Transfinite Ford-Fulkerson on a Finite Network Wed, Nov 23, 2016 12:00 CET

Speakers: Tony Huynh

Today Tony will tell us about Transfinite Ford-Fulkerson on a Finite Network.

Comparison of real roots (without numerical approximations) Wed, Nov 16, 2016 12:00 CET

Speakers: Aurélien Ooms