Lin, Jyh-Shyan; Chang, Jen-Chun; Chen, Rong-Jaye New simple constructions of distance-increasing mappings from binary vectors to permutations. (English) Zbl 1185.68455 Inf. Process. Lett. 100, No. 2, 83-89 (2006). MSC: 68R05 × Cite Format Result Cite Review PDF Full Text: DOI
Ryu, Pum-Mo; Choi, Key-Sun Determining the specificity of terms using inside-outside information: a necessary condition of term hierarchy mining. (English) Zbl 1185.68308 Inf. Process. Lett. 100, No. 2, 76-82 (2006). MSC: 68P20 × Cite Format Result Cite Review PDF Full Text: DOI
Lange, Martin; Somla, Rafał Propositional dynamic logic of context-free programs and fixpoint logic with chop. (English) Zbl 1185.68391 Inf. Process. Lett. 100, No. 2, 72-75 (2006). MSC: 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Elbassioni, Khaled; Lotker, Zvi; Seidel, Raimund Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices. (English) Zbl 1185.68777 Inf. Process. Lett. 100, No. 2, 69-71 (2006). MSC: 68U05 90C05 × Cite Format Result Cite Review PDF Full Text: DOI
Damaschke, Peter A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. (English) Zbl 1185.68280 Inf. Process. Lett. 100, No. 2, 64-68 (2006). MSC: 68P10 68W05 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Jiménez, Ernesto; Arévalo, Sergio; Fernández, Antonio Implementing unreliable failure detectors with unknown membership. (English) Zbl 1185.68093 Inf. Process. Lett. 100, No. 2, 60-63 (2006). MSC: 68M15 × Cite Format Result Cite Review PDF Full Text: DOI
Kikuchi, Yosuke; Araki, Toru Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. (English) Zbl 1185.05090 Inf. Process. Lett. 100, No. 2, 52-59 (2006). MSC: 05C38 68R10 68M10 × Cite Format Result Cite Review PDF Full Text: DOI
Banič, Iztok; Žerovnik, Janez Fault-diameter of Cartesian graph bundles. (English) Zbl 1185.05121 Inf. Process. Lett. 100, No. 2, 47-51 (2006). MSC: 05C76 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Wolfovitz, Guy The complexity of depth-3 circuits computing symmetric Boolean functions. (English) Zbl 1185.68355 Inf. Process. Lett. 100, No. 2, 41-46 (2006). MSC: 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI