Titlebook: Automata, Languages and Programming; 31st International C Josep Díaz,Juhani Karhumäki,Donald Sannella Conference proceedings 2004 Springer-

过剩

扩大

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphshts and ./. = .(./ log .) our approaches are the first to achieve .(..) I/Os. We also show that for unweighted undirected graphs, APSP can be solved with just . I/Os. Both our weighted and unweighted approaches require .(..) space. For diameter computations we provide I/O-space tradeoffs. Finally, w

Congeal

A ,-Calculus for Resource Separationlti-place contexts augmented with constraints, allowing a concise presentation of the typing rules. It is an extension of the affine .-calculus. We give a semantics based on sets indexed by resources, and show how the calculus may be extended to handle non-symmetric relations with application to all

Definitive

同步左右

Further Improvements in Competitive Guarantees for QoS Bufferingr space is limited, and packet loss occurs when the buffer overflows. We describe a modification of the previously proposed “preemptive greedy” algorithm of for buffer management and give an analysis to show that this algorithm achieves a competitive ratio of at most 1.75. This improves upon recent

Harness

消息灵通

Testing, Optimizaton, and Games minimizing cost and maximizing the effectiveness of the tests; as a game between tester and system under test; or as a learning problem. We touch on some of these aspects and related algorithmic questions.

陈列

Algorithms for Multi-product Pricingto set prices of multiple products from a single company, so as to maximize the overall revenue of the company. We present approximation algorithms as well as negative results for several variants of the multi-product pricing problem, modeling different purchasing patterns and market assumptions.

FICE

变异