| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Competitive Analysis for Balanced Transactional Memory Workloads
|
Sharma, Gokarna
|
|
2011
|
63 |
1-2 |
p. 296-322
|
artikel
|
| 2 |
A Distributed Algorithm for Computing the Node Search Number in Trees
|
Coudert, David
|
|
2011
|
63 |
1-2 |
p. 158-190
|
artikel
|
| 3 |
Almost Exact Matchings
|
Yuster, Raphael
|
|
2011
|
63 |
1-2 |
p. 39-50
|
artikel
|
| 4 |
An Exact Exponential Time Algorithm for Power Dominating Set
|
Binkele-Raible, Daniel
|
|
2011
|
63 |
1-2 |
p. 323-346
|
artikel
|
| 5 |
Approximating Node-Connectivity Augmentation Problems
|
Nutov, Zeev
|
|
2011
|
63 |
1-2 |
p. 398-410
|
artikel
|
| 6 |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
|
Aazami, A.
|
|
2011
|
63 |
1-2 |
p. 425-456
|
artikel
|
| 7 |
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
|
Du, Donglei
|
|
2011
|
63 |
1-2 |
p. 191-200
|
artikel
|
| 8 |
Average Case Analysis of Moore’s State Minimization Algorithm
|
Bassino, Frédérique
|
|
2011
|
63 |
1-2 |
p. 509-531
|
artikel
|
| 9 |
Bipartite Matching in the Semi-streaming Model
|
Eggert, Sebastian
|
|
2011
|
63 |
1-2 |
p. 490-508
|
artikel
|
| 10 |
Contribution Games in Networks
|
Anshelevich, Elliot
|
|
2011
|
63 |
1-2 |
p. 51-90
|
artikel
|
| 11 |
External Memory Planar Point Location with Logarithmic Updates
|
Arge, Lars
|
|
2011
|
63 |
1-2 |
p. 457-475
|
artikel
|
| 12 |
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
|
Kavitha, Telikepalli
|
|
2011
|
63 |
1-2 |
p. 224-245
|
artikel
|
| 13 |
Graph Decomposition for Memoryless Periodic Exploration
|
Kosowski, Adrian
|
|
2011
|
63 |
1-2 |
p. 26-38
|
artikel
|
| 14 |
Improved Approximation Algorithms for Data Migration
|
Khuller, Samir
|
|
2011
|
63 |
1-2 |
p. 347-362
|
artikel
|
| 15 |
Improved Competitive Performance Bounds for CIOQ Switches
|
Kesselman, Alex
|
|
2011
|
63 |
1-2 |
p. 411-424
|
artikel
|
| 16 |
Interval Partitions and Polynomial Factorization
|
Gathen, Joachim von zur
|
|
2011
|
63 |
1-2 |
p. 363-397
|
artikel
|
| 17 |
Layered Working-Set Trees
|
Bose, Prosenjit
|
|
2011
|
63 |
1-2 |
p. 476-489
|
artikel
|
| 18 |
Maximum Series-Parallel Subgraph
|
Călinescu, Gruia
|
|
2011
|
63 |
1-2 |
p. 137-157
|
artikel
|
| 19 |
Minimize the Maximum Duty in Multi-interface Networks
|
D’Angelo, Gianlorenzo
|
|
2011
|
63 |
1-2 |
p. 274-295
|
artikel
|
| 20 |
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm
|
Catusse, N.
|
|
2011
|
63 |
1-2 |
p. 551-567
|
artikel
|
| 21 |
Near-Linear Approximation Algorithms for Geometric Hitting Sets
|
Agarwal, Pankaj K.
|
|
2011
|
63 |
1-2 |
p. 1-25
|
artikel
|
| 22 |
On Equilibria for ADM Minimization Games
|
Epstein, Leah
|
|
2011
|
63 |
1-2 |
p. 246-273
|
artikel
|
| 23 |
On the Hitting Times of Quantum Versus Random Walks
|
Magniez, Frédéric
|
|
2011
|
63 |
1-2 |
p. 91-116
|
artikel
|
| 24 |
Polynomial Kernelizations for MIN F+Π1 and MAX NP
|
Kratsch, Stefan
|
|
2011
|
63 |
1-2 |
p. 532-550
|
artikel
|
| 25 |
Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming
|
Summers, Scott M.
|
|
2011
|
63 |
1-2 |
p. 117-136
|
artikel
|
| 26 |
Succinct and I/O Efficient Data Structures for Traversal in Trees
|
Dillabaugh, Craig
|
|
2011
|
63 |
1-2 |
p. 201-223
|
artikel
|
Tijdschrift beschrijving