Œ€‹†i‹“‡˜a•vj

Œ»έ‚ΜŒ€‹†‰Ϋ‘θ

  1. ƒIƒuƒWƒFƒNƒg‚Μ•\Œ»‚ΖƒAƒ‹ƒSƒŠƒYƒ€‚ΜŒψ—¦‚Ζ‚ΜŠΦŒW
    JST•ͺ—ށF 7H01 . ŒvŽZ‹@‰ΘŠw
    ‰ΘŒ€”ο•ͺ—ށF 731 . ŒvŽZ‹@‰ΘŠw
    i‹@ŠΦ“ΰ‹€“―Œ€‹†j 1994 - @‘Ϋ“Α’θ‹€“―Œ€‹†
  2. u‹`‹L˜^ƒVƒXƒeƒ€‚πŠά‚ή‹³ˆηŠΒ‹«‚Ζ‹³ˆηŽΐ‘H
    ξ•ρ‹Zp‚πŠξ”Υ‚Ζ‚·‚ιŠwK‹³ˆηŠΒ‹«Ae-learning,Faculty Development
    JST•ͺ—ށF 7H02 . ’m”\ξ•ρŠwA 7H03 . ξ•ρƒVƒXƒeƒ€HŠw
    ‰ΘŒ€”ο•ͺ—ށF 1003 . ŒvŽZ‹@ƒVƒXƒeƒ€Eƒlƒbƒgƒ[ƒN€ 1004 . ƒƒfƒBƒAξ•ρŠwEƒf[ƒ^ƒx[ƒX€ 1602 . ‹³ˆηHŠw
    i‹@ŠΦ“ΰ‹€“―Œ€‹†j 2002 -

Œ€‹†‹ΖΡi’˜‘A”­•\˜_•Ά“™

  1. A New Educational Environment wity Lecture Recording System -Practice and Experience-
    The 3rd International Conference on INFORMATION,Tokyo, NOv.29-Dec.2,2004,Keynote Speech
  2. Construction and Practice of a New Educational Environment with Lecture Recording Systems
    Proc. 18th International Conference on Advanced Information Networking and Application (AINAf04) i 2004 j pp.12-15
  3. An O(1) Time Algorithm for Generating Restricted Permutations
    INFORMATION iŠwpŽGŽA 2003 j Vol.6,No.4,pp.417-426
  4. Time Optimal n-SizeMatching Parentheses and Binary Tree Decoding Algorithmson a p-Processor BSR
    Parallel Processing Letters iŠwpŽGŽA 2002 j Vol.12,Nos.3&4,pp.365-374
  5. On generating k-ary trees in computer representation
    Information Processing Letters iŠwpŽGŽA 2001 j 77(6)/231-238
  6. On generating reguler k-ary trees efficiently
    The Computer Journal iŠwpŽGŽA 2000 j 43(4)/290-300
  7. Rearranging Scattered Information on BSR
    Information Processing Letters iŠwpŽGŽA 1999 j 71(1)/43-47