FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, ...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...
WG
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
TLCA
1997
Springer
13 years 11 months ago
1997
Springer
TLCA
1997
Springer
13 years 11 months ago
1997
Springer
TLCA
1997
Springer
13 years 11 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
TLCA
1997
Springer
13 years 11 months ago
1997
Springer
We present a game model for classical PCF, a nite version of PCF extended by a catch/throw mechanism. This model is build from E-dialogues, a kind of two-players game de ned by Lor...
TLCA
1997
Springer
13 years 11 months ago
1997
Springer
TLCA
1997
Springer
13 years 11 months ago
1997
Springer
S TECHNICAL REPORT ABSTRACTS