Journals in DBLP
Guy Wolfovitz The complexity of depth-3 circuits computing symmetric Boolean functions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:41-46 [Journal ] Iztok Banic , Janez Zerovnik Fault-diameter of Cartesian graph bundles. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:47-51 [Journal ] Yosuke Kikuchi , Toru Araki Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:52-59 [Journal ] Ernesto Jiménez , Sergio Arévalo , Antonio Fernández Implementing unreliable failure detectors with unknown membership. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:60-63 [Journal ] Peter Damaschke A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:64-68 [Journal ] Khaled Elbassioni , Zvi Lotker , Raimund Seidel Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:69-71 [Journal ] Martin Lange , Rafal Somla Propositional dynamic logic of context-free programs and fixpoint logic with chop. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:72-75 [Journal ] Pum-Mo Ryu , Key-Sun Choi Determining the specificity of terms using inside-outside information: a necessary condition of term hierarchy mining. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:76-82 [Journal ] Jyh-Shyan Lin , Jen-Chun Chang , Rong-Jaye Chen New simple constructions of distance-increasing mappings from binary vectors to permutations. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:83-89 [Journal ]