Volume 4; Issue 3

ACM Transactions on Algorithms

Volume 4; Issue 3
3

Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem

Year:
2008
Language:
english
File:
PDF, 154 KB
english, 2008
4

Determining plurality

Year:
2008
Language:
english
File:
PDF, 138 KB
english, 2008
5

Average-case lower bounds for the plurality problem

Year:
2008
Language:
english
File:
PDF, 176 KB
english, 2008
6

Balanced parentheses strike back

Year:
2008
Language:
english
File:
PDF, 225 KB
english, 2008
7

Roundtrip spanners and roundtrip routing in directed graphs

Year:
2008
Language:
english
File:
PDF, 183 KB
english, 2008
9

Testing Euclidean minimum spanning trees in the plane

Year:
2008
Language:
english
File:
PDF, 228 KB
english, 2008
10

Clustering, community partition and disjoint spanning trees

Year:
2008
Language:
english
File:
PDF, 203 KB
english, 2008
11

Getting the best response for your erg

Year:
2008
Language:
english
File:
PDF, 227 KB
english, 2008
12

Optimal branch-decomposition of planar graphs in O ( n 3 ) Time

Year:
2008
Language:
english
File:
PDF, 171 KB
english, 2008
13

Dynamic entropy-compressed sequences and full-text indexes

Year:
2008
Language:
english
File:
PDF, 313 KB
english, 2008