Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]

JOURNAL ARTICLE published April 2022 in Information Processing Letters

Authors: Béatrice Bérard | Serge Haddad

Consecutive retrieval property—revisited

JOURNAL ARTICLE published January 1999 in Information Processing Letters

Authors: Jitender S. Deogun | K. Gopalakrishnan

A parallel algorithm for the minimum weighted vertex cover problem

JOURNAL ARTICLE published February 1995 in Information Processing Letters

Authors: Aristidis Likas | Andreas Stafylopatis

Checking strict positivity of Kraus maps is NP-hard

JOURNAL ARTICLE published February 2017 in Information Processing Letters

Authors: Stéphane Gaubert | Zheng Qu

Sparse LCS Common Substring Alignment

JOURNAL ARTICLE published December 2003 in Information Processing Letters

Authors: Gad M. Landau | Baruch Schieber | Michal Ziv-Ukelson

Algorithms for multicast connection under multi-path routing model

JOURNAL ARTICLE published October 2002 in Information Processing Letters

Authors: Jun Gu | Xiao-Dong Hu | Mu-Hong Zhang

Finding the detour-critical edge of a shortest path between two nodes

JOURNAL ARTICLE published July 1998 in Information Processing Letters

Authors: Enrico Nardelli | Guido Proietti | Peter Widmayer

Prefix grammars: an alternative characterization of the regular languages

JOURNAL ARTICLE published July 1994 in Information Processing Letters

Authors: Michael Frazier | C. David Page

The finite power problem revisited

JOURNAL ARTICLE published December 2002 in Information Processing Letters

Authors: Daniel Kirsten

Fault-tolerant routings in a K-connected network

JOURNAL ARTICLE published July 1988 in Information Processing Letters

Authors: Makoto Imase | Yoshifumi Manabe

Author index of Volume 1

JOURNAL ARTICLE published December 1972 in Information Processing Letters

The two-thirds rule for dynamic storage allocation under equilibrium

JOURNAL ARTICLE published 1971 in Information Processing Letters

Authors: Erol Gelenbe

On proving that a graph has no large clique: A connection with Ramsey theory

JOURNAL ARTICLE published April 1996 in Information Processing Letters

Authors: Richard J. Lipton

Real estate of names

JOURNAL ARTICLE published February 2001 in Information Processing Letters

Authors: K.Rustan M. Leino

A proof of the substitution lemma in de Bruijn's notation

JOURNAL ARTICLE published May 1993 in Information Processing Letters

Authors: Hiroshi Ohtsuka

On a relation between algebraic programs and turing machines

JOURNAL ARTICLE published December 1977 in Information Processing Letters

Authors: James M. Steckelberg | Sharad C. Seth

A quorum based k-mutual exclusion by weighted k-quorum systems

JOURNAL ARTICLE published August 1998 in Information Processing Letters

Authors: Satoshi Fujita

On 2-QBF truth testing in parallel

JOURNAL ARTICLE published January 1996 in Information Processing Letters

Authors: Bengt Aspvall | Christos Levcopoulos | Andrzej Lingas | Robert Storlind

VLSI implementation of fast solvers for band linear systems with constant coefficient matrix

JOURNAL ARTICLE published September 1985 in Information Processing Letters

Authors: B. Codenotti | F. Romani | G. Lotti

On Fixpoint Arithmetic and Infinite Time Turing Machines

JOURNAL ARTICLE published May 2004 in Information Processing Letters

Authors: G LENZI