WebDiarios de Motocicleta

Informatics Weekly, written by Mihai Pătraşcu.

Sunday, August 29, 2010

Barriers 2

›
Later today, I'll be giving a talk at the 2nd Barriers Workshop in Princeton. Here's my attempt to survey data structure lower boun...
6 comments:
Thursday, August 26, 2010

IOI: A Medium Problem

›
Here is another, medium-level problem from the IOI. (Parental advisory: this is not quite as easy as it may sound!) I think of a number betw...
22 comments:
Sunday, August 22, 2010

IOI: Another Hard Problem

›
You are given a matrix A[1..N][1..M] that contains a permutation of the numbers {1, ..., NM}. You are also given W≤N and H≤M. The goal is t...
20 comments:
Friday, August 20, 2010

IOI: The Hard Problem

›
The International Olympiad in Informatics (IOI 2010) is taking part this week at the University of Waterloo, Canada. The olympiad often fea...
9 comments:
Wednesday, August 4, 2010

A taxonomy of range query problems

›
In this post, I will try to enumerate the range query problems that I know about. Let me know if I'm missing anything. The query. Say yo...
9 comments:
Thursday, July 22, 2010

SODA

›
Being on the SODA PC is excruciating. Too many submissions are at the level of a hard exercise – things that David Karger would assign in Ad...
25 comments:
Monday, June 21, 2010

3SUM Puzzle

›
A puzzle courtesy of Mohan Paturi : Given a set S of n numbers, the 3SUM problem asks whether there exist a , b , c ∈ S such that a + b +...
9 comments:
‹
›
Home
View web version
Powered by Blogger.