| 1 | Nov 09 | Barak Cohen | Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan Approximating the minimum spanning tree weight in sublinear time Link |
| 2 | Nov 16 | Ilan Ben Bassat | Seth Pettie, Vijaya Ramachandran An optimal minimum spanning tree algorithm Link |
| 3 | Nov 23 | Amir Pirogovsky | Michael L. Fredman, Dan E. Willard Surpassing the information theoretic bound with fusion trees Journal of Computer and System Sciences 47, 424-436 (1993) |
| 4 | Nov 30 | Guy Kalinski Or Cohen |
Mikkel Thorup Equivalence between priority queues and sorting Link |
| 5 | Dec 07 | Nadav Lev | Boris V. Cherkassky, Andrew V. Goldberg, and Craig Silverstein Buckets, Heaps, Lists, and Monotone Priority Queues Link |
| 6 | Dec 14 | Marina Kotlarevsky Alex Gaskin |
Rolf H. Möhring, Martin Skutella, and Frederik Stork Scheduling with AND/OR Precedence Constraints Link |
| 7 | Dec 21 |
Gilad Egozi Tehila Hananuv |
Raimund Seidel and Micha Sharir Top-Down Analysis of Path Compression Link |
| 8 | Jan 04 | Sagi Lisker | Tim Roughgarden, Éva Tardos How bad is selfish routing? Link |
| 9 | Jan 11 | Hagai Helman Gorlik Ilia |
Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt Linear work suffix array construction Link |
| 10 | Jan 18 | Itay Flikier Sella Nevo |
Rasmus Pagh, Flemming Friche Rodler Cuckoo hashing Link |
| 11 | Jan 25 | Evgeny Gorokuvsky | Camil Demetrescu, Giuseppe F. Italiano A new approach to dynamic all pairs shortest paths Link |