|
|
Publications
|
|
期刊編輯
|
|
|
|
1. International Journal of Pattern
Recognition and Machine Intelligence.
|
|
|
2. Annals of Mathematics and Artificial
Intelligence.
|
|
|
3. IEEE Transactions on Knowledge and
Data Engineering.
|
|
|
4. International Journal of Foundations
on Computer Science.
|
|
|
5. Computers and Operations Research.
|
|
|
6. Journal of Parallel Algorithms and
Applications.
|
|
|
7. International Journal of
Computational Geometry and Applications.
|
|
|
8. Information Sciences.
|
|
專書
|
|
|
|
1. Chang, C. L. and Lee, R. C. T. , “Symbolic Logic and
Mechanical Theorem Proving”, Academic Press, New
York, 1973. --This book was translated into
Japanese, Russian and Italian.
2. Lee, R. C. T., Clustering Analysis
and its Applications, in “Advances in Information System Science”,
(edited by J. T. Tou), Plenum Press, N.Y., 1981, pp.169-287.
3. Lee, R. C. T., Shen, C. W. and
Chang, S. C., Compilers, in “Handbook of Software Engineering”, (edited
by C. R. Vick and C. VOL. Ramamoorthy), Van Nostrand Reinhold, N.Y., 1982,
pp.201-233.
4. Lee, R. C. T., Chang, R. C., Tseng,
S. S. and Tsai, Y. T., "Introduction to the Design and Analysis of
Algorithms, a Strategic Approach", McGrawHill, 2005.
5. Lee, R. C. T., Chiu, M. C., Lin, J.
S., " Communications Engineering: Essentials for Computer Scientists and
Electrical Engineers", Wiley-IEEE Press, 2007.
|
|
期刊論文
|
On
Symbolic Logic, Fuzzy Logic and Mechanical Theorem Proving:
|
|
|
[CLD73] The Specialization of Programs
by Theorem Proving, Chang, C. L., Lee, R.C. T. and Dixon, J. K., SIAM J. on
Computing, Vol. 2, No. 1, 1973, pp. 7-15.
|
|
|
[L72] An Algorithm to Generate Prime
Implicants and Its Applications to the Selection Problem, Lee, R. C. T.,
Information Sciences, Vol. 4, 1972, pp. 251-259.
|
|
|
[L72] Fuzzy Logic and the Resolution
Principle, Lee, R. C. T., Journal of the ACM, Vol. 19, No. 1, 1972, pp.
109-119.
|
|
|
[LC71]
Some Properties of Fuzzy Logic, Lee, R. C. T. and Chang, C. L., Information
and Control, Vol. 19, No. 5, 1971, pp. 417-431.
|
|
|
[LCW74] An Improved Program Synthesis
Algorithm and Its Correctness, Lee, R. C. T., Chang, C. L. and Waldinger, R.
J., Comm. of the ACM., 1974, pp. 211-217.
|
|
|
[SCL70] A New Algorithm for Generating
Prime Implicants, Slagle, J. R., Chang, C. L. and Lee, R. C. T., IEEE Trans.
on Computers, Vol. C-19, No. 4, 1970, pp. 304-310.
|
|
|
On
Pattern Recognition and Clustering Analysis:
|
|
|
[CCL95] Near Pattern-Matching Scheme
Based Upon Principal Component Analysis, Chen, C. Y., Chang, C. C. and Lee,
R. C. T., Pattern Recognition Letters, Vol. 16, 1995, pp. 339-345.
|
|
|
[CL73] A Heuristic Method for
Non-linear Mapping in Cluster Analysis, Chang, C. L. and Lee, R. C. T., IEEE
Trans. on Systems, Man and Cybernetics, Vol. SMC-3, No. 1, 1973, pp. 197-200.
|
|
|
[L71] Application of Information Theory
to Select Relevant Variables, Lee, R. C. T., Mathematical Biosciences, Vol.
11, 1971, pp. 153-161.
|
|
|
[L74] Experiments with Some Clustering
Analysis Algorithms, Lee, R. C. T., Pattern Recognition, Vol. 6, 1974, pp.
181-187.
|
|
|
[LCC76] Application of Principle
Component Analysis to Multikey Searching, Lee, R. C. T., Chin, Y. H. and
Chang, S. C., IEEE Trans. on Software Engr., Vol. SE-2, No. 3, 1976, pp.
185-193.
|
|
|
[LSB77] A Triangulation Method for the
Sequential Mapping of Points from N-Space to 2-Space, Lee, R. C. T., Slagle,
J. R. and Blum, H., IEEE Trans. on Computers, Vol. C-26, No. 3, 1977, pp.
288-292.
|
|
|
[SL71] Application of Game Tree
Searching to Sequential Pattern Recognition, Slagle, J. R. and Lee, R. C. T.,
Comm. of the ACM, Vol. 14, No. 2, 1971, pp. 103-110.
|
|
|
[TLMSG73] Applications of Artificial
Intelligence, Relationships between Mass Spectra and Pharmacological Activity
of Drugs, Ting, K. L. H., Lee, R. C. T., Milne, G. W. A., Shapiro, M. and Guarino,
A. M., Science, Vol. 180, 1973, pp. 417-420.
|
|
|
On Data Base Design & Information Security
Systems:
|
|
|
[CLD82] Symbolic Gray Code as a Perfect
Multi-attribute Hashing Scheme for Partial Match Queries, Chang, C. C., Lee,
R. C. T. and Du, M. W., IEEE Trans. on Software Engr., Vol. SE-8, No. 3,
1982, pp. 235-249.
[CDL83] The Hierarchical Ordering in Multiattribute Files, Chang, C. C., Du,
M. W. and Lee, R. C. T., Information Sciences, Vol. 31, No. 1, 1983, pp.
41-75.
[CDL84] Performance Analysis of Cartesian Product Files and Random Files,
Chang, C. C., Du, M. W. and Lee, R. C. T., IEEE Trans. on Software Engr.,
Vol. SE-10, No. 10, 1984, pp. 88-99.
[CL86] A Letter Oriented Minimal Perfect Hashing Scheme, Chang, C. C. and
Lee, R. C. T., The Computer Journal, Vol. 29, No. 3, 1986, pp. 277-281.
[CLLC96] Redundant MKH Files Design among Multiple Disks for Concurrent
Partial Match Retrieval, Chen, C.Y., Lin, H.F., Lee, R.C.T. and Chang, C.C.,
Journal of Systems and Software, Vol. 35, No. 3, 1996, pp. 199-207.
[CLCL97] Multidisk Smaller Sized MKH File Allocation for Partial Match
Retrieval, Chen, C. Y., Lin, H. F., Chang, C. C. and Lee, R. C. T., Journal
of Information Science and Engineering, Vol. 13, 1997, pp. 125-141.
[CLCL97] Optimal Bucket Allocation Design of K-ary MKH Files for Partial
Match Retrieval, Chen, C.Y., Lin, H.F., Chang, C.C. and Lee, R.C.T., IEEE 03.
Transactions on Knowledge and Data Engineering, Vol. 9, No. 1, 1997, pp.
148-160.
[DL80] Symbolic Gray Code as a Multi-key Hashing Function, Du, H. C. and Lee,
R. C. T., IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol.
PAMI-2, No. 1, 1980, pp. 83-90.
[KLCC77] Storage Reduction through Minimal Spanning Trees and Spanning
Forests, Kang, A. N. C., Lee, R. C. T., Chang, C. L. and Chang, S. K., 1977,
IEEE Trans. on Computers, Vol. C-26, No. 5, 1977, pp. 425-434.
[LCML94] Optimal Multiple Key Hashing Files for Orthogonal Range Queries,
Liang, J., Chang, C. C., McFadyen, R. G. and Lee, R. C. T., Information
Sciences Vol. 79, No. 1-2, 1994, pp. 145-158.
[LCWL91] Password Authetication Using Newton’s Interpolating Polynomials, Lin, C.
H., Chang, C. C., Wu, T. C. and Lee, R. C. T., Information Systems, Vol. 16,
No. 1, 1991, pp. 97.
[LLD79] Common Properties of Some Multiattribute File Systems, Lin, W. C.,
Lee, R. C. T. and Du, H. C., IEEE Trans. on Software Engr., Vol. SE-5, No. 2,
1979, pp. 160-174.
[LMS78] Towards Automatic Auditing of Records, Lee, R. C. T., Mong, S. T. and
Slagle, J. R., IEEE Trans. on Software Engr., Vol. SE-4, No. 5, 1978, pp.
441-448.
[LT79] Multi-key Sorting, Lee, R. C. T. and Tseng, S. H., Policy Analysis and
Information Systems, Vol. 3, No. 2, 1979, pp. 1-20.
|
|
|
On Sequential Algorithm Design:
|
|
|
[CHL98] An Optimal Algorithm for Finding the Minimum Cardinality
Dominating set on Permutation Graphs, Chao, H.S., Hsu, F.R. and Lee, R.C.T.,
Lecture Notes in Computer Science, Vol. 1449, 1998, pp. 309.
[CL84] The Average Performance Analysis of a Closest Pair Algorithm, Chang,
R. C. and Lee, R. C. T., International Journal of Computer Mathematics, Vol.
16, 1984, pp. 125-130.
[CL84] The Average Length of Delaunay Triangulations, Chang, R. C. and Lee,
R. C. T., BIT, Vol. 24, 1984, pp. 269-273.
[CL86] An O(NlogN) Minimal Spanning Tree Algorithm for N Points in the Plane,
Chang, R. C. and Lee, R. C. T., BIT, Vol. 26, 1986, pp. 7-16.
[CL88] On a Scheduling Problem where a Job Can Be Executed Only by a Limited
Number of Processors, Chang, R. S. and Lee, R. C. T., Computers and
Operations Research, Vol. 15, No. 5, 1988, pp. 471-478.
[CL90] On the Continuous Working Problem, Chang, R. S. and Lee, R. C. T.,
Discrete Applied Mathematics, Vol. 28, 1990, pp. 93-109.
[CLL89] A Fault-Tolerance Strategy for Pyramid Architecture, Chang, K. L.,
Lin, F. C. and Lee, R. C. T., Journal of Information Science and Engineering,
Vol. 5, 1989, pp. 105-121.
[CTL91] 20-Relative Neighborhood Graphs Are Hamiltonian, Chang, M. S., Tang,
C. Y. and Lee, R. C. T., Journal of Graph Theory, Vol. 15, No. 5, 1991, pp.
543-557.
[CTL92] Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by
2-Relative Neighborhood Graphs, Chang, M. S., Tang, C. Y. and Lee, R. C. T.,
Discrete Applied Mathematics, Vol. 39, 1992, pp. 1-12.
[CTL92] Solving the Euclidean Bottleneck Matching Problem by K-Relative
Neighborhood Graphs, Chang, M. S., Tang, C. Y. and Lee, R. C. T.,
Algorithmica, Vol. 8, 1992, pp. 177-194.
[CWL94] Generating All Maximal Independent Sets on Trees in Lexical Order,
Chang, Y. H., Wang, J. S. and Lee, R. C. T., Information Sciences, Vol. 76,
1994, pp. 279-296.
[CYL92] Amortized Analysis of Disk Scheduling Algorithms, SSTF, SCAN and
N-Step SCAN, Chen, T. S., Yang, W. P. and Lee, R. C. T., BIT, Vol. 32, 1992,
pp. 546- 558.
[DL91] A Transformational Approach to Synthesizing Combinatorial Circuits,
Tai, S. C., Du, M. W. and Lee, R. C. T., IEEE Transactions on Computer-Aided-
Design of Integrated Circuits and Systems, Vol. 10, No. 3, March 1991, pp.
286- 295.
[DL91] Transformation Completeness Properties of SVPC Transformation Sets,
Tai, S. C., Du, M. W. and Lee, R. C. T., Discrete Applied Mathematics, Vol.
32, 1991, pp. 263-273.
[FL91] Voronoi Diagrams of Moving Points in the Plane, Fu, J. J. and Lee, R.
C. T., International Journal of Computational Geometry and Applications, Vol.
1, No. 1, March 1991, pp. 23-32.
[FL91] Minimum Spanning Trees of Moving Points in the Plane, Fu, J. J. and
Lee, R. C. T., IEEE Transactions on Computers, Vol. 40, No. 1, 1991, pp.
113-118.
[HCL93] The Searching over Separators Strategy to Solve Some NP-hard Problems
in Sub-exponential Time, Hwang, R. Z., Chang, R. C. and Lee, R. C. T.,
Algorithmica, Vol. 9, 1993, pp. 393-423.
[HL93] The Slab Dividing Approach to Solve the Euclidean P-Center Problem,
Hwang, R. Z., Lee, R. C. T. and Chang, R. C., Algorithmica, Vol. 9, 1993, pp.
1-22.
[HLC92] Special Subgraphs of Weighted Visibility Graphs, Hsu, F. R., Lee, R.
C. T. and Chang, R. C., Information Processing Letters, Vol. 43, 1992, pp.
69-75.
[HTCL94] Single Step Searching in Weighted Block Graphs, Hsiao, J. Y., Tang,
C. Y., Chang, R. S. and Lee, R. C. T., Information Sciences, Vol. 81, 1994,
pp. 1-29.
[HTL92] An Average Analysis of a Resolution Principle Algorithm in Mechanical
Theorem Proving, Hu, T. H., Tang, C. Y. and Lee, R. C. T., Annals of
Mathematics and Artificial Intelligence, Vol. 6, 1992, pp. 235-252.
[KL91] On Weighted 2-Center and 3-Center Problems, Ko, M. T. and Lee, R. C.
T., Information Sciences, Vol. 54, 1991, pp. 169-190.
[KLC90] Rectilinear m-Center Problem, Ko, M. T., Lee, R. C. T. and Chang, C.
S., Naval Research Logistics, Vol. 37, 1990, pp. 419-427.
[KLC90] An Approximation Algorithm for the Rectilinear M-Center Problem, Ko,
M. T., Lee, R. C. T. and Chang, J. S., Algorithmica, Vol. 5, 1990, pp.
341-352.
[LCL95] A New Public-Key Cipher System Based upon the Diophantine Equations,
Lin, C. H., Chang, C. C. and Lee, R. C. T., IEEE Transactions on Computers,
Vol. 44, No. 1, 1995, pp.13-19.
[LTL90] Minimum Rectangular Partition Problem for Simple Rectilinear
Polygons, Liou, W. T., Tan, J. J. M. and Lee, R. C. T., IEEE Trans. on
Computer- Aided Design of Integrated Circuits and Systems, Vol. 9, No. 7,
1990, pp. 720-733.
[LTL91] Covering Convex Rectilinear Polygons in Linear Time, Liou, W. T.,
Tang, C. Y. and Lee, R. C. T., International Journal of Computational
Geometry and Applications, Vol. 1, No. 2, 1991, pp. 137-185.
[LTL2003] The Full Steiner Tree Problem, Lu, C. L., Tang, C.Y. and Lee, R. C.
T., Theoretical Computer Science, Vol. 306, pp.55-67, 2003.
[LWL94] Characteristics of The Hopfield Associative Memory Utilizing
Isomorphism Relations, Lee, C. Y., Wang, J. S. and Lee, R. C. T., IEEE
Transactions on Neural Networks, Vol. 5, No. 3, 1994, pp. 523-526.
[PWL94] Recognizing Shortest Path Trees in Linear Time, Peng, C. H., Wang, J.
S. and Lee, R. C. T., Information Processing Letters, Vol. 57, 1994, pp.
77-85.
[SL79] On the Optimal Solution to AND/OR Series Parallel Graphs, Simon, S.
and Lee, R. C. T., Journal of the ACM, Vol. 18, No. 3, 1979, pp. 354-357.
[STL2004] The Minimal Spanning Tree Preservation Approaches for DNA Multiple
Sequence Alignment and Evolutionary Tree Construction, Shyu, S. J., Tsai, Y.
T. and Lee, R. C. T., Journal of Combinatorial Optimization, Vol. 8, No. 4,
2004, pp.453-468.
[TBL85] On the Complexity of Some Multi-attribute File Design Problems, Tang,
C. Y., Buehrer, D. and Lee, R. C. T., Information Systems, Vol. 10, No. 1,
1985, pp. 21-25.
[WL90] An Efficient Channel Routing Algorithm to Yield an Optimal Solution,
Wang, J. S. and Lee, R. C. T., IEEE Transactions on Computers, Vol. 39, No.
7, July 1990, pp. 957-962.
[WLC89] The Number of Intersections between Two Rectangular Paths, Wang, Y.
L., Lee, R. C. T. and Chang, J. S., IEEE Trans. on Computers, Vol. 38, No.
11, Nov. 1989, pp. 1564-1571.
[WLL2005] The Approximability of the Weighted Hamiltonian Path Completion
Problem on a Tree, Wu, Q., Lu, C. L. and Lee, R. C. T., accepted by
Theoretical Computer Science, 2005.
[WCL98] The NPO-Completeness of the Longest Hamiltonian Cycle Problem, Wu, Q.
S., Chao, K. M. and Lee, R. C. T., Information Processing Letters, Vol. 65,
1998, pp. 119-123.
[WLC92] Computing the Convex Hull
in a Hammock, Wang, Y. L., Lee, R. C. T. and Chang, J. S., Information
Sciences, Vol. 59, 1992, pp. 103-119.
[YL90] The Weighted Perfect Domination Problem, Yen, C. C. and Lee, R. C. T.,
Information Processing Letters, Vol. 35, 1990, pp. 295-299.
[YL94] A Linear Algorithm to Solve the Weighted Perfect Domination Problem in
Series-Parallel Graphs, Yen, C. C. and Lee, R. C. T., European Journal of
Operations Research, Vol. 73, 1994, pp. 192-198.
[YL96] The Weighted Perfect Domination Problem and Its Variants, Yen, C. C.
and Lee, R. C. T., Discrete Applied Mathematics, Vol. 66, 1996, pp. 147-160.
No. 1, 1995, pp. 13-19.
[YWL89] A Branch-and-Bound Algorithm to Solve the Equal-Execution-Time Job
Scheduling Problem with Precedence Constraint and Profile, Yang, C. I., Wang,
J. S. and Lee, R. C. T., Computers and Operations Research, Vol. 16, No. 3,
1989, pp. 257-269.
|
|
|
On Parallel Algorithm Design:
|
|
|
[CCL87]
A New Systolic Architecture for Convex Hull and Half-Plane Intersection
Problems, Chen, G. H., Chern, M. S. and Lee, R. C. T., BIT, Vol. 27, 1987,
pp. 141-147.
[CHL97] An Optimal EREW Parallel Algorithm for Computing Breadth-First Search
Trees on Permutation Graphs, Chao, H. S., Hsu, F. R. and Lee, R. C. T.,
Information Processing Letters, Vol. 61, 1997, pp. 311-316.
[HCL92] Parallel Algorithms for Computing the Minimum Visible Vertex Distance
between Two Polygons, Hsu, F. R., Chang, R. C. and Lee, R. C. T.,
International Journal of Computational Geometry and Applications, Special
Issue: Parallel Computaional Geometry, Vol. 2, No. 2, 1992, pp. 135-162.
[HCL93] Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility
of Polygons from Segments, Hsu, F. R., Chang, R. C. and Lee, R. C. T.,
Journal of Parallel Algorithms and Applications, Vol. 1, 1993, pp. 83-98.
[HHL98] Embedding Incomplete Binary Trees into Incomplete Hypercubes, Huang,
C. H., Hsiao, J. Y. and Lee, R. C. T., IEE Proceedings on Computers and
Digital Techniques, Vol. 145, No. 6, 1998, pp. 377-384.
[HHL99] An Optimal Embedding of Cycles into Incomplete Hypercubes, Huang, C.
H., Hsian, J. Y. and Lee, R. C. T., Information Processing Letters, Vol. 72,
1999, pp. 213-218.
[HL88] Efficient Algorithms for Finding Maximal Cliques, Clique Trees, and
Minimum Coloring on Chordal Graphs, Ho, C. W. and Lee, R. C. T., Information
Processing Letters, Vol. 28, 1988, pp. 301-309.
[HL89] Counting Clique Trees and Computing Elimination Schemes in Parallel,
Ho, C. W. and Lee, R. C. T., Information Processing Letters, Vol. 31, 1989,
pp. 61-68.
[HL90] A Parallel Algorithm for Solving Sparse Triangular Systems, Ho, C. W.
and Lee, R. C. T., IEEE Transactions on Computers, Vol. 39, No. 6, 1990, pp.
848- 852.
[SCL87] Systolic Algorithms to Examine All Pairs of Elements, Shih, Z. C.,
Chen, G. H. and Lee, R. C. T., Comm. of the ACM, Vol. 30, No. 2, 1987, pp.
161-167.
[SL90] Solving the Set Cover Problem on a Supercomputer, Shyu, S. J. and Lee,
R. C. T., Parallel Computing, Vol. 13, 1990, pp. 295-300.
[SL90] The Vectorization of the Partition Problem, Shyu, S. J. and Lee, R. C.
T., Parallel Computing, Vol. 16, 1990, pp. 343-350.
[SLC87] A Parallel Nonlinear Mapping Algorithm, Shen, C. W., Lee, R. C. T.
and Chin, Y. H., International Journal of Pattern Recognition and Artificial
Intelligence, Vol. 1, No. 1, 1987, pp. 53-69.
[SLY89] A Systolic Algorithm for Extracting Regions for a Planar Graph, Shih,
Z. C., Lee, R. C. T. and Yang, S. N., Computer Vision, Graphics and Image
Processing, Vol. 47, 1989, pp. 227-242.
[SLY90] A Parallel Algorithm for Finding Congruent Regions, Shih, Z. C., Lee,
R. C. T. and Yang, S. N., Parallel Computing, Vol. 13, No. 2, 1990, pp.
135-142.
[TL84] A New Parallel Sorting Algorithm Based upon Min-Mid-Max Operations,
Tseng, S. S. and Lee, R. C. T., BIT, Vol. 24, 1984, pp. 187-195.
[TL84] A Parallel Algorithm to Solve the Stable Marriage Problem, Tseng, S.
S. and Lee, R. C. T., BIT, Vol. 24, 1984, pp. 308-316.
[TL84] Optimal Speed-up of Parallel Algorithms Based upon the
Divide-and-Conquer Strategy, Tang, C. Y. and Lee, R. C. T., Information
Sciences, Vol. 32, 1984, pp. 173-186.
[TL85] A Parallel Sorting Scheme where Basic Operations Sort N Elements,
Tseng, S. S. and Lee, R. C. T., International Journal of Computer and
Information Sciences, Vol. 14, No. 6, 1985, pp. 455-467.
[TL85] A Review of Parallel Sorting Algorithms, Tseng, S. S. and Lee, R. C.
T., Proceedings of NSC-Part A, 1985, pp. 277-295.
[TL90] Problems that are Unlikely to Have Efficient Parallel Algorithms,
Tseng, D. L. Y. and Lee, R. C. T., in Advances in Parallel Computing, (D. J.
Evans editor) JAI Press, London, Vol. 1, 1990, pp. 1223-147.
[YL86] The Mapping of 2-D Array Processors to 1-D Array Processors, Yang, C.
B. and Lee, R. C. T., Parallel Computing, Vol. 3, 1986, pp. 217-229.
[YL87] Systolic Algorithms for the Longest Common Subsequence Problem, Yang,
C. B. and Lee, R. C. T., Journal of the Chinese Institute of Engineers, Vol.
10, No. 6, 1987, pp. 691-697.
[YLC90] Parallel Graph Algorithms Based upon Broadcast Communications, Yang,
C. B., Lee, R. C. T. and Chen, W. T., IEEE Transactions on Computers, Vol.
39, No. 12, Dec., 1990, pp. 1468-1472.
|
|
其他
|
|
|
|
01. 李家同, "讓高牆倒下吧", 聯經出版公司, 1995。
|
|
|
02. 李家同, "陌生人", 聯經出版公司,
1995。
|
|
|
03. 李家同, "幕永不落下",
九歌出版公司, 2000。
|
|
|
04. 李家同, 海柏, "專門替中國人寫的英文基本文法", 聯經出版公司,
2000。
|
|
|
05. 李家同, "鐘聲又再響起"", 聯經出版公司, 2002。
|
|
|
06. 李家同, 文庭澍,
"專門替中國人寫的英文課本初級(上冊)", 聯經出版公司, 2003。
|
|
|
07. 李家同, 文庭澍,
"專門替中國人寫的英文課本初級(下冊)", 聯經出版公司, 2003。
|
|
|
08. 李家同,
"不能讓窮小孩落入永遠的貧困", 博幼基金會,
2004。
|
|
|
09. 李家同,
"一切從基本做起", 圓神出版公司,
2004。
|
|
|
10. 李家同, "讓知識帶希望回家", 博幼基金會,
2004。
|
|
|
11. 李家同, 文庭澍, "專門替中國人寫的英文課本中級(上冊)", 聯經出版公司,
2004。
|
|
|
12. 李家同, 文庭澍, "專門替中國人寫的英文課本中級(下冊)", 聯經出版公司,
2004。
|
|
|
13. 李家同,
"學好英文，沒有捷徑", 聯經出版公司,
2004。
|
|
|
14. 李家同,
"李伯伯最愛的40本書",
圓神出版公司, 2005。
|
|
|
15. 李家同,
"第21頁",
九歌出版公司, 2006。
|
|
|
16. 李家同, "專門為中學生寫的數學課本代數(上冊)", 聯經出版公司, 2006。
|
|
|
17. 李家同, "專門為中學生寫的數學課本代數(下冊)", 聯經出版公司, 2006。
|
|
|
18. 李家同, "專門為中學生寫的數學課本四則運算, 聯經出版公司, 2006。
|
|
|
19. 李家同, 郝凱揚, "讀李家同學英文1—我的盲人恩師", 聯經出版公司, 2006。
|
|
|
20. 李家同, 郝凱揚, "讀李家同學英文2—車票", 聯經出版公司, 2006。
|
|
|
21. 李家同, 郝凱揚, "讀李家同學英文3—我只有八歲", 聯經出版公司, 2007。
|
|
|
22. 李家同, 康士林, 鮑端磊, "跟李伯伯學英文：Page 21", 九歌出版公司, 2007。
|
|
|
23. 李家同, 郝凱揚, " 讀李家同學英文4—竊聽者", 聯經出版公司, 2007。
|
|
|
24. 李家同, 博幼基本會, " 孩子，一個都不放棄", 圓神出版公司, 2008。
|
|
|
25. 李家同, "故事六十八", 聯經出版公司, 2008。
|
|
|
26. 李家同, 郝凱揚, "讀李家同學英文5—我在天堂嗎？", 聯經出版公司, 2008。
|
|
|
27. 李家同,
文庭澍, "專門替中國人寫的英文課本高級(上冊)", 聯經出版公司,
2008。
|
|
|
28. 李家同, 郝凱揚, "讀李家同學英文6—李花村", 聯經出版公司, 2009。
|
|
|
29. 李家同, 鍾偉明, "車票(李家同故事繪本)", 聯經出版公司, 2009。
|
|
|
30. 李家同, 江長芳, " 蘋果(李家同故事繪本)", 聯經出版公司, 2009。
|
|
|
31. 李家同, 郝凱揚, " 讀李家同學英文7—小男孩的爸爸", 聯經出版公司, 2009。
|
|
|
32. 李家同, 陳盈帆, "太陽下山，回頭看(李家同故事繪本)", 聯經出版公司, 2009。
|
|
|
33. 李家同, 康士林, 鮑端磊, "跟李伯伯學英文：Good Fate ", 九歌出版公司, 2009。
|
|
|
34. 李家同, "李伯伯最愛的48個電影故事", 圓神出版公司, 2009。
|
|
|
35. 李家同,
曾琬婷, "山谷裡的丁香花（李家同故事繪本）", 聯經出版公司,
2009
|
|
|
36. 李家同,
林昭緯 , "三個孩子的故事（李家同故事繪本）", 聯經出版公司,
2009
|
|
|
|
