€iavj
»έΜ€Ϋθ
- IuWFNgΜ\»ΖASYΜψ¦ΖΜΦW
JSTͺήF 7H01 . vZ@Θw
Θ€οͺήF 731 . vZ@Θw
i@Φΰ€―€j 1994 - @ΫΑθ€―€
- u`L^VXeπάή³ηΒ«Ζ³ηΐH
ξρZpπξΥΖ·ιwK³ηΒ«Ae-learning,Faculty Development
JSTͺήF 7H02 . m\ξρwA 7H03 . ξρVXeHw
Θ€οͺήF 1003 . vZ@VXeElbg[N€ 1004 . fBAξρwEf[^x[X€ 1602 . ³ηHw
i@Φΰ€―€j 2002 -
€ΖΡiA\_Ά
- 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
- Construction and Practice of a New Educational Environment with Lecture Recording Systems
Proc. 18th International Conference on Advanced Information Networking and Application (AINAf04) i 2004 j pp.12-15
- An O(1) Time Algorithm for Generating Restricted Permutations
INFORMATION iwpGA 2003 j Vol.6,No.4,pp.417-426
- Time Optimal n-SizeMatching Parentheses and Binary Tree Decoding Algorithmson a p-Processor BSR
Parallel Processing Letters iwpGA 2002 j Vol.12,Nos.3&4,pp.365-374
- On generating k-ary trees in computer representation
Information Processing Letters iwpGA 2001 j 77(6)/231-238
- On generating reguler k-ary trees efficiently
The Computer Journal iwpGA 2000 j 43(4)/290-300
- Rearranging Scattered Information on BSR
Information Processing Letters iwpGA 1999 j 71(1)/43-47