Volume 8; Issue 4

ACM Transactions on Algorithms

Volume 8; Issue 4
1

All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time

Year:
2012
Language:
english
File:
PDF, 182 KB
english, 2012
2

Replacement paths and k simple shortest paths in unweighted directed graphs

Year:
2012
Language:
english
File:
PDF, 200 KB
english, 2012
3

Fully dynamic randomized algorithms for graph spanners

Year:
2012
Language:
english
File:
PDF, 584 KB
english, 2012
5

Parallel pipelined filter ordering with precedence constraints

Year:
2012
Language:
english
File:
PDF, 391 KB
english, 2012
6

Succinct ordinal trees based on tree covering

Year:
2012
Language:
english
File:
PDF, 412 KB
english, 2012
7

The smoothed complexity of edit distance

Year:
2012
Language:
english
File:
PDF, 262 KB
english, 2012
8

An online scalable algorithm for average flow time in broadcast scheduling

Year:
2012
Language:
english
File:
PDF, 218 KB
english, 2012
10

Range searching on uncertain data

Year:
2012
Language:
english
File:
PDF, 284 KB
english, 2012
11

The effectiveness of stackelberg strategies and tolls for network congestion games

Year:
2012
Language:
english
File:
PDF, 173 KB
english, 2012
12

How to meet asynchronously (almost) everywhere

Year:
2012
Language:
english
File:
PDF, 179 KB
english, 2012