Journals in DBLP
Xuandong Li , Johan Lilius Efficient verification of a class of time Petri nets using linear programming. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:219-224 [Journal ] Gerhard J. Woeginger The reconstruction of polyominoes from their orthogonal projections. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:225-229 [Journal ] Limin Xiang , Kazuo Ushijima , Changjie Tang On generating k-ary trees in computer representation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:231-238 [Journal ] Carlos Martín-Vide , Victor Mitrana Some undecidable problems for parallel communicating finite automata systems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:239-245 [Journal ] Paulo A. S. Veloso , Sheila R. M. Veloso On local modularity variants and -institutions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:247-253 [Journal ] Michelangelo Grigni A Sperner lemma complete for PPA. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:255-259 [Journal ] Chinda Wongngamnit , Dana Angluin Robot localization in a grid. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:261-267 [Journal ] Hiroyuki Kawai , Naohiro Fujikake , Yukio Shibata Factorization of de Bruijn digraphs by cycle-rooted trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:269-275 [Journal ] Frank Harary , Vladik Kreinovich , Luc Longpré A new graph characteristic and its application to numerical computability. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:277-282 [Journal ] Vicent Cholvi , Pablo Boronat A minimal property for characterizing deadlock-free programs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:77, n:5-6, pp:283-290 [Journal ]