176
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
139
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
115
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
153
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer