Volume 100,
Number 1,
October 2006
Volume 100,
Number 2,
October 2006
- Guy Wolfovitz:
The complexity of depth-3 circuits computing symmetric Boolean functions.
41-46
Electronic Edition (link) BibTeX
- Iztok Banic, Janez Zerovnik:
Fault-diameter of Cartesian graph bundles.
47-51
Electronic Edition (link) BibTeX
- Yosuke Kikuchi, Toru Araki:
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs.
52-59
Electronic Edition (link) BibTeX
- Ernesto Jiménez, Sergio Arévalo, Antonio Fernández:
Implementing unreliable failure detectors with unknown membership.
60-63
Electronic Edition (link) BibTeX
- Peter Damaschke:
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs.
64-68
Electronic Edition (link) BibTeX
- Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel:
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices.
69-71
Electronic Edition (link) BibTeX
- Martin Lange, Rafal Somla:
Propositional dynamic logic of context-free programs and fixpoint logic with chop.
72-75
Electronic Edition (link) BibTeX
- Pum-Mo Ryu, Key-Sun Choi:
Determining the specificity of terms using inside-outside information: a necessary condition of term hierarchy mining.
76-82
Electronic Edition (link) BibTeX
- Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen:
New simple constructions of distance-increasing mappings from binary vectors to permutations.
83-89
Electronic Edition (link) BibTeX
Volume 100,
Number 3,
November 2006
Volume 100,
Number 4,
November 2006
Volume 100,
Number 5,
December 2006
Volume 100,
Number 6,
December 2006
Copyright © Mon Nov 17 20:59:14 2008
by Michael Ley (ley@uni-trier.de)
