|
Vol.E75-D No.1
pp.30-34
Special SectionPAPER
Parallel Algorithms for the Maximal Tree Cover Problems
Zhi-Zhong CHEN, Takumi KASAI, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.35-43
Special SectionPAPER
Optimal Grain Size Determination for Tree-Structured Parallel Programs
Tsuyoshi KAWAGUCHI, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.44-49
Special SectionPAPER
A Characterization of PC=P
Mitsunori OGIWARA, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.50-57
Special SectionPAPER
Elliptic Curve Cryptosytems and Their Applications
Kenji KOYAMA, Tatsuaki OKAMOTO, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.58-63
Special SectionPAPER
Distributed Leader Election on Chordal Ring Networks
Koji NAKANO, Toshimitsu MASUZAWA, Nobuki TOKURA, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.64-77
Special SectionPAPER
Fully Abstract Models for Communicating Processes with respect to Weak Linear Semantics with Divergence
Eiichi HORITA, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.78-88
Special SectionPAPER
The Universal Recognition Problems for Multiple Context-Free Grammars and for Linear Context-Free Rewriting Systems
Yuichi KAJI, Ryuichi NAKANISI, Hiroyuki SEKI, Tadao KASAMI, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.89-94
Special SectionPAPER
Computational Power of Memory-Based Parallel Computation Models with Communication
Yasuhiko TAKENAGA, Shuzo YAJIMA, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.95-101
Special SectionPAPER
An RNC Algorithm for Finding a Largest Common Subtree of Two Trees
Tatsuya AKUTSU, |
|
Summary | Full Text:PDF | |
|
Vol.E75-D No.1
pp.102-109
Special SectionPAPER
Interactive Bi-proof Systems and Undeniable Signature Schemes
Atsushi FUJIOKA, Tatsuaki OKAMOTO, Kazuo OHTA, |
|
Summary | Full Text:PDF | |
|
Current List: 41421 - 41430
|