40th Annual Symposium on Foundations of Computer Science

📖 The Scoop

The proceedings consists of the 67 papers presented at the October 1999 symposium. Among the topics are approximation schemes for minimizing average weighted completion time with release dates, improved bounds for sampling colorings, dynamic planar convex hull operations in near-logarithmic amortized time, Markovian coupling vs. conductance for the Jerrum-Sinclair chain, and bounds for small- error and zero-error quantum algorithms. Some other topics are online scheduling to minimize average stretch, algorithmic aspects of protein structure similarity, non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security, stochastic load balancing and related problems, and the testability of regular languages with a constant number of queries. No subject index. Annotation copyrighted by Book News, Inc., Portland, OR.

Genre: Computers / General (fancy, right?)