| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A New Efficient Algorithm for Computing the Longest Common Subsequence
|
Iliopoulos, Costas S.
|
|
2008
|
45 |
2 |
p. 355-371
|
artikel
|
| 2 |
Bounds on Mincut for Cayley Graphs over Abelian Groups
|
Lipets, Vladimir
|
|
2008
|
45 |
2 |
p. 372-380
|
artikel
|
| 3 |
Exponential Separation of Quantum and Classical Online Space Complexity
|
Le Gall, François
|
|
2007
|
45 |
2 |
p. 188-202
|
artikel
|
| 4 |
Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults
|
Hsieh, Sun-Yuan
|
|
2008
|
45 |
2 |
p. 407-425
|
artikel
|
| 5 |
Foreword
|
Kleinberg, Robert
|
|
2009
|
45 |
2 |
p. 187
|
artikel
|
| 6 |
Network Design with Weighted Players
|
Chen, Ho-Lin
|
|
2008
|
45 |
2 |
p. 302-324
|
artikel
|
| 7 |
On the Price of Heterogeneity in Parallel Systems
|
Godfrey, P. Brighten
|
|
2008
|
45 |
2 |
p. 280-301
|
artikel
|
| 8 |
Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game
|
Litman, Ami
|
|
2008
|
45 |
2 |
p. 325-354
|
artikel
|
| 9 |
Tell Me Who I Am: An Interactive Recommendation System
|
Alon, Noga
|
|
2008
|
45 |
2 |
p. 261-279
|
artikel
|
| 10 |
The Cache Complexity of Multithreaded Cache Oblivious Algorithms
|
Frigo, Matteo
|
|
2007
|
45 |
2 |
p. 203-233
|
artikel
|
| 11 |
Towards a Scalable and Robust DHT
|
Awerbuch, Baruch
|
|
2008
|
45 |
2 |
p. 234-260
|
artikel
|
| 12 |
Unavoidable Sets of Partial Words
|
Blanchet-Sadri, F.
|
|
2008
|
45 |
2 |
p. 381-406
|
artikel
|
Tijdschrift beschrijving