Analysis of Scheduling Algorithms for Proportionate Fairness

Advances in the regularity method p. 2 Fighting spam : the science p. 3 The consequences of Imre Simon's work in the theory of automata, languages, and semigroups p. 5 Querying priced information in databases : the conjunctive case p. 6 Sublinear methods for detecting periodic trends in data streams p. 16 An improved data stream summary : the count-min sketch and its applications p. 29 Rotation and lighting invariant template matching p. 39 Computation of the bisection width for random d-regular graphs p. 49 Constrained integer partitions p. 59 Embracing the giant component p. 69 Sampling grid colorings with fewer colors p. 80 The complexity of finding top-toda-equivalence-class members p. 90 List partitions in chordal graphs p. 100 Bidimensional parameters and local treewidth p. 109 Vertex disjoint paths on clique-width bounded graphs p. 119 On partitioning interval and circular-arc graphs into proper interval subgraphs with applications p. 129 Collective tree exploration p. 141 Off-centers : a new type of steiner points for computing size-optimal quality-guaranteed delaunay triangulations p. 152 Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time p. 162 A geometric approach to the bisection method p. 172 Improved linear expected-time algorithms for computing maxima p. 181 A constant approximation algorithm for sorting buffers p. 193 Approximation schemes for a class of subset selection problems p. 203 Finding k-connected subgraphs with minimum average weight p. 212 On the (im)possibility of non-interactive correlation distillation p. 222 Pure future local temporal logics are expressively complete for Mazurkiewicz traces p. 232 How expressions can code for automata p. 242 Automata for arithmetic meyer sets p. 252 Efficiently computing the density of regular languages p. 262 Longest repeats with a book of don't cares p. 271 Join irreducible pseudovarieties, group mapping, and Kovacs-Newman semigroups p. 279 Complementation of rational sets on scattered linear orderings of finite rank p. 292 Expected length for the longest common subsequence for large alphabets p. 302 Universal types and simulation of individual sequences p. 312 Separating codes : constructions and bounds p. 322 Encoding homotopy of paths in the plane p. 329 A unified approach to coding labeled trees p. 339