301 search results - page 46 / 61 » On extensions of a theorem of Baxter |
132
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
165
click to vote
INFOCOM
2009
IEEE
16 years 21 days ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
166
click to vote
TPHOL
2009
IEEE
16 years 21 days ago
2009
IEEE
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
155
click to vote
TLCA
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
182
click to vote
LICS
2007
IEEE
16 years 10 days ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...