IEICE Technical Committee

Information and Systems-Theoretical Foundations of Computing(Date:2000/07/18)

Presentation

,

[Date]2000/7/18
[Paper #]

,

[Date]2000/7/18
[Paper #]

COMP2000-27 On the maximum satisfiability of random 3CNF formulae

Mitsuo Motoki,

[Date]2000/7/18
[Paper #]COMP2000-27

COMP2000-28 Refinements to the Definition of Indistinguishability for Public-key Encryption Schemes

Hideaki Sakai, Noriko Nakamura, Yoshihide Igarashi,

[Date]2000/7/18
[Paper #]COMP2000-28

Computational Complexity of Finding Rare Intemsets and Meaningful Association Rules

Teppei Matsuyama, Ryuichi Nakanishi, Minoru Ito, Michio Nakanishi,

[Date]2000/7/18
[Paper #]COMP2000-29

COMP2000-30 A Linear Time Algorithm for the 3-Edge-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones

Toshiya Mashima, Toshimasa Watanabe,

[Date]2000/7/18
[Paper #]COMP2000-30

COMP2000-31 Parallel algorithm with constant communication rounds for the convex hull of sorted points

Naoki Oshige, Akihiro Fujiwara,

[Date]2000/7/18
[Paper #]COMP2000-31

COMP2000-32 A Time- and Communication-Optimal Distributed Sorting Algorithm on a Line Network

Atsushi Sasaki,

[Date]2000/7/18
[Paper #]COMP2000-32

COMP2000-33 Energy-Efficient Initialization Protocols for Radio Networks with no Collision Detection

Koji Nakano, Olariu Stephan,

[Date]2000/7/18
[Paper #]COMP2000-33

,

[Date]2000/7/18
[Paper #]