Sciweavers

FOCS
1993
IEEE
14 years 3 months ago
Throughput-Competitive On-Line Routing
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, ...
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
FOCS
1993
IEEE
14 years 3 months ago
Scale-sensitive Dimensions, Uniform Convergence, and Learnability
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...
Noga Alon, Shai Ben-David, Nicolò Cesa-Bian...
WG
1997
Springer
14 years 3 months ago
Parallel Algorithms for Treewidth Two
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 ...
Babette de Fluiter, Hans L. Bodlaender
TLCA
1997
Springer
14 years 3 months ago
Primitive Recursion for Higher-Order Abstract Syntax
Joëlle Despeyroux, Frank Pfenning, Carsten Sc...
TLCA
1997
Springer
14 years 3 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
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 ...
Michael Brandt, Fritz Henglein
TLCA
1997
Springer
14 years 3 months ago
Games and Weak-Head Reduction for Classical PCF
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...
Hugo Herbelin
TLCA
1997
Springer
14 years 3 months ago
Proof Nets, Garbage, and Computations
S TECHNICAL REPORT ABSTRACTS
Stefano Guerrini, Simone Martini, Andrea Masini