Showing papers in "Information Processing Letters in 2001"

TL;DR: A novel application of a stochastic name-passing calculus for the study of biomolecular systems is described, specifying the structure and dynamics of biochemical networks in a variant of the Stochastic π -calculus, yielding a model which is mathematically well-defined and biologically faithful.

TL;DR: This work shows the deadline-monotonic priority ordering policy is optimal where task deadlines do not exceed their (respective) periods and the complexity of (sufficient and necessary) feasibility analysis is NP-hard.

TL;DR: A ranking function for the permutations on n symbols assigns a unique integer in the range [0,n !− 1] to each of the n! permutations.

TL;DR: It will be proved that it is NP-complete to reconstruct a two-dimensional pattern from its two orthogonal projections H and V, if (1) the pattern has to be connected (and hence forms a so-called polyomino), or if (2) the patterns have to be horizontally and vertically convex.

TL;DR: This variant of Reiter's hitting-set algorithm produces a hitting- set tree instead of an acyclic directed graph as an advantage some subset checks necessary for reducing the graph during search can be avoided.

TL;DR: This paper shows that the problem of finding an edge e ∗ ∈P G (r,s) whose removal is such that the length of P G−e ∗ (r-s) is maximum can be solved in O (m·α(m,n)) time, where α is the functional inverse of the Ackermann function, thus improving on the previous O ( m+n log n) time bound.

TL;DR: This work reduces the problem to the minimization of finite automata on finite words and obtains an algorithm running in time O (n · log n) ,w here n is the number of states of the automaton.

TL;DR: It is proved that a new complexity measure including energy E and time t in the form of the expression E×t 2 be used as the measure of the efficiency of a computation and that the metric is optimal.

TL;DR: This algorithm can be thought of as column-wise “parallelization” of the classical dynamic programming approach and is very efficient in practice, where computing the length of an LCS of two strings can be done in linear time and constant (additional/working) space.

TL;DR: This work states that in a medium-size collection of around 1 GB of English text derived from the TREC world-wide web data, there are around 170 million word occurrences, of which just under 2 million are distinct words.

TL;DR: The time of distributed deterministic broadcasting in synchronous radio networks of unknown topology and size is studied by assuming that nodes are completely ignorant of the network: they know neither its topology, nor size, nor even their immediate neighborhood.

TL;DR: It is shown that the shortest watchman route in a simple polygon is unique, except for very special cases where there is an infinite number of shortest routes of equal length, and an O (n 5 ) time solution to thewatchman route problem is presented.

TL;DR: On a network having m edges and n nodes, Hsu and Huang's self-stabilizing algorithm for maximal matching stabilizes in at most 2m+n moves.

TL;DR: The goal is to develop closed form expressions for how closely the clocks can be synchronized in a failure-free distributed system when the hardware clocks do not drift but there is uncertainty in the message delays.

TL;DR: A general approach to annotation inference for a given static program checker that reuses the checker as a subroutine is presented and shows how it applies to ESC.

TL;DR: It is proved that quantum computing is polynomially equivalent to classical probabilistic computing with an oracle for estimating the value of simple sums, quadratically signed weight enumerators (QWGTs) and a natural BQPP complete problem is proved.

TL;DR: Sperner's lemma for non-orientable 3-manifolds is complete for PPA by considering non- orientable spaces.

TL;DR: The main ingredient of the proof is that weak probabilistic partitions suffice for the construction of tree metrics with low distortion, in contrast to strong partitions used by Bartal, and the result is the best possible by providing a lower bound of �( log diam G) for the distortion of any probabilistically approximation of the square grid by tree metrics.

TL;DR: Arkin et al. as mentioned in this paper proposed an approximation algorithm with a constant performance guarantee, 4, under the assumption that the weights in B satisfy the triangle inequality (TI) and provided a constant-time algorithm with the same guarantee.

TL;DR: The problem of finding a minimum cost subset S⊆V such that, for each vertex v∈V−S, there are k vertex-disjoint paths from S to v, can be solved by a greedy algorithm in O ( min {k, n }nm) time in a digraph.

TL;DR: In this paper, the authors proposed a new approach to use a minimum number of active links and thus reduce network pricing by allowing multiple parallel links, in order to satisfy any set of requests even if the available bandwidth is insufficient.

TL;DR: It will be shown, in contrast with this, that the minimum weight maximal matching problem cannot be approximated within any polynomially computable factor unless P=NP.

TL;DR: A positive answer to this conjecture is given, showing that this problem to minimize total compression plus weighted flow cost is NP-hard.

TL;DR: A new variation of hypercubes, denoted by SQn, is presented and a generalization of SQn is presented, which can construct an n-dimensional generalized shuffle-cube with 2 n vertices which is n-regular and n-connected.

TL;DR: A class ⪯ n of process preorders related to contrasimulation equivalence and characterize the predicates they preserve and an axiomatization is given for the preorder⪯ 2 (impossible futures).

TL;DR: A new algorithm is given couting monotone Boolean functions of n variables (or equivalently the elements of free distributive lattices of n generators).

TL;DR: Using refinement algebra, this work clarify and extend the applicability of previously proposed sharp rules for total correctness and show how further rules may be found.

TL;DR: In this article, it was shown that the splicing operation can give rise to different subclasses of regular languages, when a finite set of rules is iterated on a set of axioms.

TL;DR: A derivation of Dijkstra's shortest path algorithm is presented, view the problem as computation of a “greatest solution” of a set of equations, and a UNITY-style computation is prescribed whose implementation results in DijkStra's algorithm.

TL;DR: Two improved heuristics for the two-machine no-wait flowshop problem with an availability constraint are provided, and it is shown that each has a worst-case error bound of 5/3.