IEICE transactions on fundamentals of electronics, communications and computer

• 

  Año 2003, Vol. 86, Número 5

  • Foreword

    Hiro Ito

    pág. 977

    

  • Determination of all connex polygons which are chamaleons --congruent dudeney dissections of poligons--

    Jin Akiyama, Gisaku Nakamura

    págs. 978-986

    

  • Digital curse aproximation with length evaluation

    Tetsuo Asano

    págs. 987-994

    

  • Möbius functions of rooted forests and faigle-kern's greedy polyhedra

    Kazutoshi Ando

    págs. 995-999

    

  • Polyhedral proof of a characterization of perfect bidirected grahs

    Yoshiko Ikebe, Akihisa Tamura

    págs. 1000-1007

    

  • An optical adaptative diagnosis of butterfly networks

    Aya Okashita

    págs. 1008-1018

    

  • An Algorithm for solving the minimum vertex ranking spanning tree problem on interval graphs

    Shin-ichii Nakayama, Shigeru Masuyama

    págs. 1019-1026

    

  • Properties on the average number of spanning trees in connected spanning subgraphs for an undirected graph

    Peng Cheng, Shigeru Masuyama

    págs. 1027-1033

    

  • List edge-colorings of series-parallel graphs

    Tomoya Fujino

    págs. 1034-1045

    

  • On aproximation algorithms for coloring k-colorable Graphs

    Xuzhen Xie

    págs. 1046-1051

    

  • Complexity and completeness of finding another solution and its application to puzzles

    Takayuki Yato, Takahiro Seta

    págs. 1052-1060

    

  • Constructing the suffix tree of a tree with a large alphabet

    Tetsuo Shibuya

    págs. 1061-1066

    

  • An Analysis of the AVL balanced tree insertion algorithm

    Ryozo Nakamura

    págs. 1067-1074

    

  • An alternative analysis of linear synamic hashing algorithm

    Ayad Soufiane

    págs. 1075-1081

    

  • A Hardware/software consynthesis system for processor cores with content addressable memories

    Nozomu Togawa

    págs. 1082-1092

    

  • An LP-based local search to the one dimensional cutting stock problem using a given number cutting patterns

    Shunji Umeta

    págs. 1093-1102

    

  • Randomized time-and energy-optical routing in single-hop, single-channel Radio Networks

    Jacir Luiz Bordim, Jiangtao Cui, Koji Nakano

    págs. 1103-1112

    

  • Quantum algorithms for intersection and proximity problems

    Kunihiko Sadakane

    págs. 1113-1119

    

  • Baby step giant step algorithms in point counting of hyperelliptic curves

    Kazuto Matsuo

    págs. 1127-1134

    

  • An Efficient representation of scalars for simultaneous elliptic scalar multiplication

    Yasuyuki Sakai, Kouichi Sakurai

    págs. 1135-1146

    

  • Random-error resilience of a short collusion-secure code

    Katsunari Yoshioka, Tsutomu Matsumoto

    págs. 1147-1155

    

  • New security index for digital fingerprinting and its bounds

    Shingo Orihara

    págs. 1156-1163

    

  • On the strength of the strong RSA assumption

    Shintaro Itagaki

    págs. 1164-1170

    

  • A simple power attack on a randomized addition-subtraction chains mothed for elliptic curve cryptosystems

    Katsuyuki Okeya, Kouichi Sakurai

    págs. 1171-1180

    

  • On the security of girault key agreement protocols against active attacks

    Soo Hyun Oh

    págs. 1181-1189

    

  • Statistical Analysis of X2-attacks

    Norihisa Isogai

    págs. 1190-1197

    

  • A note on the relationships among certified discrete log cryptosystems

    Eikon Chida

    págs. 1198-1202

    

  • An incremental wiring algorithm for VLSI layout desing

    Yukiko Kubo

    págs. 1203-1206

    

  • Las Vegas, self-verifyging nondeterministic one-way-counter automata with bounded time

    Tsunehiro Yoshinaga, Katsushi Inoue

    págs. 1207-1212

    

  • On the n-th order shift register based discrete logarithm

    Chik How Tan

    págs. 1213-1216