Journals in DBLP
Andrzej Ehrenfeucht , Jurriaan Hage , Tero Harju , Grzegorz Rozenberg Pancyclicity in switching classes. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:153-156 [Journal ] Raymond R. Devillers , Joël Goossens Liu and Layland's schedulability test revisited. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:157-161 [Journal ] Atsushi Kaneko , Kiyoshi Yoshimoto On spanning trees with restricted degrees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:163-165 [Journal ] Liang Chen , Naoyuki Tokuda A note on "Category and measure in complexity classes". [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:167-168 [Journal ] Steven McKellar , Robert Davis Redundancy removal in multicast protocols. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:169-173 [Journal ] Zoltán Fülöp , Sebastian Maneth Domains of partial attributed tree transducers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:175-180 [Journal ] Fanica Gavril Maximum weight independent sets and cliques in intersection graphs of filaments. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:181-188 [Journal ] Giovanni Dimauro , Sebastiano Impedovo , Giuseppe Pirlo , A. Salzo RNS architectures for the implementation of the `diagonal function'. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:189-198 [Journal ] Amiya Nayak , J. Ren , Nicola Santoro An improved testing scheme for catastrophic fault patterns. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:199-206 [Journal ] Achour Mostéfaoui , Michel Raynal , Frederic Tronel From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:207-212 [Journal ] Amos Beimel , Eyal Kushilevitz Learning unions of high-dimensional boxes over the reals. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:213-220 [Journal ] Daniel Stefankovic Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:5-6, pp:221-225 [Journal ]