Results 1  10
of
102
On the Cost of FaultTolerant Consensus When There Are No Faults  A Tutorial
, 2001
"... We consider the consensus problem in asynchronous models enriched with unreliable failure detectors or partial synchrony, where processes can crash or links may fail by losing messages. ..."
Abstract

Cited by 65 (8 self)
 Add to MetaCart
We consider the consensus problem in asynchronous models enriched with unreliable failure detectors or partial synchrony, where processes can crash or links may fail by losing messages.
Precoloring extension. III. Classes of perfect graphs
"... We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some classes of perfect graphs, giving good characterizations (necessary and sufficient conditions) that lead to algorithms with linear or polynomial running time. It is also shown how a larger subclass of perfect graphs can be derived from graphs containing no induced path on four vertices.
A simple algorithm for finding maximal network flows and an application to the Hitchcock problem
 CANADIAN JOURNAL OF MATHEMATICS
, 1957
"... ..."
Insideout polytopes
, 2003
"... We present a common generalization of hyperplane dissections, latticepoint counting, graph coloring, and enumeration of nowherezero flows, magic squares and graphs, antimagic squares and graphs, and generalized latin squares. ..."
Abstract

Cited by 20 (12 self)
 Add to MetaCart
We present a common generalization of hyperplane dissections, latticepoint counting, graph coloring, and enumeration of nowherezero flows, magic squares and graphs, antimagic squares and graphs, and generalized latin squares.
Folding and Cutting Paper
 Revised Papers from the Japan Conference on Discrete and Computational Geometry, volume 1763 of Lecture Notes in Computer Science
, 1998
"... . We present an algorithm to find a flat folding of a piece of paper, so that one complete straight cut on the folding creates any desired plane graph of cuts. The folds are based on the straight skeleton, which lines up the desired edges by folding along various bisectors; and a collection of perpe ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
. We present an algorithm to find a flat folding of a piece of paper, so that one complete straight cut on the folding creates any desired plane graph of cuts. The folds are based on the straight skeleton, which lines up the desired edges by folding along various bisectors; and a collection of perpendiculars that make the crease pattern foldable. We prove that the crease pattern is flat foldable by demonstrating a family of folded states with the desired properties. 1 Introduction Take a sheet of paper, fold it into some flat origami, and make one complete straight cut. What shapes can the unfolded pieces make? For example, Figure 1 shows how to cut out a fivepointed star in this way. You could imagine cutting out the silhouette of your favorite animal, object, or geometric shape. The first published reference to this foldandcut idea that we are aware of is a Japanese book [22] by Kan Chu Sen from 1721. This book contains a variety of problems for testing mathematical intelligence ...
Normal and Sinkless Petri Nets
 Journal of Computer and System Sciences
, 1989
"... We examine both the modeling power of normal and sinkless Petri nets and the computational complexities of various classical decision problems with respect to these two classes. We argue that although neither normal nor sinkless Petri nets are strictly more powerful than persistent Petri nets, th ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We examine both the modeling power of normal and sinkless Petri nets and the computational complexities of various classical decision problems with respect to these two classes. We argue that although neither normal nor sinkless Petri nets are strictly more powerful than persistent Petri nets, they nonetheless are both capable of modeling a more interesting class of problems. On the other hand, we give strong evidence that normal and sinkless Petri nets are easier to analyze than persistent Petri nets. In so doing, we apply techniques originally developed for conflictfree Petri nets  a class defined solely in terms of the structure of the the net  to sinkless Petri nets  a class defined in terms of the behavior of the net. As a result, we give the first comprehensive complexity analysis of a class of potentially unbounded Petri nets defined in terms of their behavior. 1 Introduction Many aspects of the fundamental nature of computation are often studied via formal m...
A system of interaction and structure IV: The exponentials
 IN THE SECOND ROUND OF REVISION FOR MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 2007
"... We study some normalisation properties of the deepinference proof system NEL, which can be seen both as 1) an extension of multiplicative exponential linear logic (MELL) by a certain noncommutative selfdual logical operator; and 2) an extension of system BV by the exponentials of linear logic. T ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
We study some normalisation properties of the deepinference proof system NEL, which can be seen both as 1) an extension of multiplicative exponential linear logic (MELL) by a certain noncommutative selfdual logical operator; and 2) an extension of system BV by the exponentials of linear logic. The interest of NEL resides in: 1) its being Turing complete, while the same for MELL is not known, and is widely conjectured not to be the case; 2) its inclusion of a selfdual, noncommutative logical operator that, despite its simplicity, cannot be axiomatised in any analytic sequent calculus system; 3) its ability to model the sequential composition of processes. We present several decomposition results for NEL and, as a consequence of those and via a splitting theorem, cut elimination. We use, for the first time, an induction measure based on flow graphs associated to the exponentials, which captures their rather complex behaviour in the normalisation process. The results are presented in the calculus of structures, which is the first, developed formalism in deep inference.
An optimized reconfigurable architecture for Transputer networks
 Proc. of 25th Hawaii Int. Conf. on System Sciences (HICSS 92
, 1992
"... This paper presents the architecture of a fully reconfigurable distributed memory computing system. It is assumed that the processors communicate via message passing on an application specific regular network of degree four. To realize any network of this class, we use a special multistage Clos netw ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This paper presents the architecture of a fully reconfigurable distributed memory computing system. It is assumed that the processors communicate via message passing on an application specific regular network of degree four. To realize any network of this class, we use a special multistage Clos network which is built up by a minimal number of equal sized switches. These switches can be configured to realize any connection between input and output ports. To map a network onto the architecture, the process graph has to be partitioned into a number of subsets. We prove that the number of external edges between the subsets can be bounded. For that reason, it is possible to minimize the number of links and switches in our architecture without loosing the ability to realize any regular network of degree four. Moreover, any user specific network can be mapped efficiently on the architecture. This implies an efficient configuration of the system. The multistage structure of the architecture ma...