Date 17-19 Oct. 1999
Filter Results
Displaying Results 1 - 25 of 69
-
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
|
PDF (266 KB)
-
Author index
|
PDF (14 KB)
-
-
Fairness in routing and load balancing
|
PDF (168 KB)
-
Long-lived adaptive collect with applications
|
PDF (164 KB)
-
Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields
|
PDF (156 KB)
-
Approximation schemes for minimizing average weighted completion time with release dates
|
PDF (200 KB)
-
Weak adversaries for the k-server problem
|
PDF (112 KB)
-
-
Finding double Euler trails of planar graphs in linear time [CMOS VLSI circuit design]
|
PDF (220 KB)
-
-
-
-
-
Setting parameters by example
|
PDF (92 KB)
-
Finely-competitive paging
|
PDF (120 KB)
-
Cuts, trees and l1-embeddings of graphs
|
PDF (188 KB)
-
Improved bounds for sampling colorings
|
PDF (144 KB)
-
-
-
Magic functions
|
PDF (180 KB)
-
-
Primal-dual approximation algorithms for metric facility location and k-median problems
|
PDF (156 KB)
-
-


