• (Chair) Professor of Information Engineering, The Chinese University of Hong Kong (香港中文大學 訊息工程講座教授), since 8/89
• Technical member at Bell Labs and Bellcore, 7/79~8/90 (on leave 89~90)
• Tenured Assoc. Prof. of Math/Statistics/CS and Assist. Prof. of Math, University of Illinois at Chicago, 8/76~7/81 (on leave 79~81)
• Instructor in Applied Mathematics, M.I.T., 8/74~7/76
• Research Associate, Electronics Research Laboratory, University of California, Berkeley, 6/73~8/73
• Teaching/Research Assistant, Math Department, University of California, Berkeley, part time, 71~73
• Second Lieutenant, Air force, 7/70~6/71

• 31 US patents

• Honorary Professor, Xidian University, 6/2008~life
• Great Master of Science, China's International Guest Academic Talents “111” Program at BUPT Base (中国教育部 创新引智计划北邮基地 学术大师), 1/2008~12/2012
• Honorary Chair Professor, National Tsing Hua University, 1/2008~12/2011

• Featured scientist of Scientific American, Chinese 7/2007 edition                                                                                                            

• Outstanding Patent Award, Industrial Technology Research Institute (ITRI), Taiwan (工業技術研究院 優質專利獎), 11/2006

• Chair Professor of Shenzhen Graduate School, Peking University, since 2/2006
• Outstanding Paper Award and Outstanding Service Award,  6th Int’l Conf. on Parallel and Distributed Computing, Applications and Tech. (PDCAT’05), Dalian, China, 12/2005

• Advisory Professor, Beijing University of Posts & Telecommunications (BUPT), 10/2005~10/2008
• The 2005 IEEE Information Theory Society Paper Award , 9/2005
• The Metro Switch Project of ITRI, chartered by the Ministry of Economic Affairs, Taiwan, adopted Li’s algebraic switch fabric as the switching core and achieved total success, 2002-04.

• Application of Fast Constant Division Routines (IEEE Trans. Computer 1985) to software in telephone switching systems saved the Bell System US$49M, 1983.

• Algorithm for uniform distribution of traffic cutback ( J. Comp. & Sys. Sci., 1986) was applied to volume control in AT&T Calling Card Service, 1981.

• Keynote speaker, Fourth International Conference on Internet Computing for Engineering and Science (ICICSE’09), Harbin, China, 12/2009
• Keynote speaker, 2009 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC 2009), Beijing, 11/2009.
• Speaker, University Colloquium (成电讲坛), University of Electronic Science and Technology of China (UESTC, 电子科技大学), Chengdu, China, 10/2009
• Main Speaker, Harbin Workshop on Information Security and Network Coding (HWISNC2009), Harbin, China, 8/2009
• Computer Science Distinguished Lecture, National Chiao Tung University (國立交通大學), Taiwan, 11/2008
• Invited Position Talk, IEEE International Conference on Computer Communications and Networks (ICCCN) 2007, Honolulu, Hawaii, 8/2007
• EE & CS Distinguished Lecture, National Chiao Tung University, 5/2007
• Keynote Speaker, International Symposium of Communication and Information Technology (ISCIT), Beijing, China, 10/2005.
• Keynote Speaker, Vista Forum of Science and Technology, International Conference Center, Taipei, 3/2001.
  

• General Chair, IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC 2009), Beijing, 11/2009.
• General Chair, IEEE International Workshop on Network Coding, Theory, and Applications (NetCod), 1/2008
• General Chair, IEEE Taiwan/Hong Kong Joint Workshop on Information Theory and Communications, Hong Kong, 1/2005

• Member, IEEE Kiyo Tomiyasu Award Committee, 5/2009-4/2010
• Reviewer of “2009 Award for Junior Research Investigators” for Academia Sinica (中央研究院) , Taiwan, 1/2009
• External reviewer for promotions in National Chiao Tung University, 2007
• Member of International Steering Committee of NetCod Workshop, since 4/2007
• External examiner for Faculty of Engineering, City University of Hong Kong (香港城市大學), 2005 & 2007
• External reviewer for promotion in National Ching Hua University, 2007
• External expert in recruitments review for Faculty of Engineering, City University of Hong Kong, 2006
• Member, ISCIT International Steering Committee, since 10/2005
• Consultant to Cluster Technology Ltd., 2003~04
• Consultant to Terapower Ltd. 2000~04
• Technical Advisor to All Asia Partners, Taiwan, 1997~2004
• Member, Telecommunications Standards Advisory Committee for OFTA of Hong Kong Government, 01/1997~12/1998
• Consultant to MTK Computers Ltd., 1995~98
• Member, Engineering Panel of Research Committee, University & Polytechnic Grants Committee (UPGC), 1993~95
  

(In reversed chronological order)

• Co-founding of the field of network coding, including the original work of the award-winning paper .Linear Network Coding,. the Butterfly Network, the commutative algebraic foundation of convolutional network coding, etc.
• The book .Algebraic Switching Theory and Broadband Applications. (2000-01) accumulates Li.s original research findings on switching during 1985-2000 and transforms the electromechanical field into a new branch of applied algebra. A partial offspring of algebraic switching theory is fiber memory for optical data.
• Li's martingale of patterns (Annals of Probability, 1980) has been cited in stochastic-processes textbooks. This tool has been actively applied to genetics, communications, and probability theory till now.
• Till today, Li's Zugzwang Game Theory ( J. Combinatorial Theory, 1976), with the additive structure of isomorphic to dyadic rational numbers on a half plane, is being ensued by researchers in combinatorial game theory.

• Annals of Probability; Annals of Statistics; Stochastic Processes and Their Applications;
• SIAM J. on Computing; SIAM J. of Applied Math; SIAM J. of Algebraic and Discrete Methods;
• IEEE Trans. on Automatic Control; IEEE Trans. on Communications. IEEE Trans. on Computers; IEEE Trans. on Information Theory
• American Mathematical Monthly; Annals of New York Academy of Sciences; Bulletin of London Mathematical Society; Studies of Applied Mathematics
• Computer Communications; Foundations and Trends in Communications & Information Theory; J. Optical Networking; Microprocessors & Micro Systems
• Information Processing Letters; Int’l J. of Computer System Science & Engineering; J. of Computer & Systems Sciences; IEICE Trans. on Information & Systems; J. of Parallel Distributed Computing
• Annals of Discrete Mathematics; Combinatorica; Discrete Mathematics; Int'l J. of Game Theory; J. of Combinatorial Theory, Series A; J. of Combinatorial Theory, Series B

• S.-Y. R. Li and X. J. Tan, “Mux/demux queues, FIFO queues, and their construction by fiber memories,”paper submitted for publication.
• S.-Y. R. Li and Q. T. Sun, “Network coding theory via commutative algebra,” paper submitted for publication.
• S.-Y. R. Li and X. J. Tan, "Efficient construction of timeslot interchangers by optical switches and delay lines," paper submitted for publication.
• S.-Y. R. Li, “Unified algebraic theory for sorting, routing, multicasting, and concentration networks,” IEEE Transactions on Communications, 10 pages, around Dec. 2009 .
• X. J. Tan and S.-Y. R. Li, "Hybrid Preservation of Conditionally Nonblocking Switches under 2-stage Interconnection," IEEE Transactions on Communications, vol. 57. no. 4, pp. 940-942, April 2009.
• S.-Y. R. Li and X. J. Tan, "On Rearrangeability of Tandem of Banyan-type Networks," IEEE Trans. on Communications, vol. 57. No. 1, pp. 164-170, Jan 2009.
• Z. F. Qian, G. W. Lu, and S.-Y. R. Li, “Improved optical-path supervisory scheme for optical cross connects based on different time-delay recognition,” Journal of Optical Networking, Vol. 7, No. 1, pp. 80-87, Dec. 2007.
• S.-Y. R. Li, "網路編碼迷蝴蝶", Scientific American, Chinese edition, no. 65, pp. 54-56, July 2007.
• S.-Y. R. Li and X. J. Tan, "Recursive Construction of Parallel Distribution Networks,. Journal of Parallel Distributed Computing, vol. 67, no. 6, pp.617-634, June 2007.
• S.-Y. R. Li and X. J. Tan, .Preservation of Conditionally Nonblocking Switches under 2-stage Interconnection,. IEEE Trans. on Communications, vol. 55, no. 5, pp. 973-980, May 2007.
• X. J. Tan and S.-Y. R. Li, .Rearrangeability of Tandem Cascade of Banyan-type Networks,. IEICE Trans. on Information and Systems, vol. E90-D, no. 1, pp. 67-74, Jan., 2007.
• S.-Y. R. Li, R. W. Yeung and N. Cai, .Reflection on Linear Network Coding,. IEEE Information Theory Society Newsletter, vol. 56, no. 4, pp. 5-8, December 2006.
• S.-Y. R. Li, .Network Coding Brings a Paradigm Shift in Communications,. SPIE Newsroom, DOI: 10.1117/2.1200604.0102, May, 2006.
• R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, .Network Coding Theory, Part II,. Foundations and Trends in Communications and Information Theory, vol. 2, no. 5, pp. 319-381, 2005.
• R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, .Network Coding Theory, Part I,. Foundations and Trends in Communications and Information Theory, vol. 2, no. 4, pp. 241-318, 2005.
• S.-Y. R. Li, R. W. Yeung and N. Cai, .Linear Network Coding,. IEEE Transactions on Information Theory, vol. 49, No. 2, pp. 371-381, Feb., 2003
• Note: This paper wins The 2005 IEEE Information Theory Society Paper Award. It initiates the study of network coding with linear coding mechanisms, which proves to achieve the best possible effect of network coding. This work is instrumental in popularizing network coding. A preliminary version by Li/Yeung appears in Proceedings of ISORA.98, pp. 197-211.
• R. Alshwede, N. Cai, S.-Y. R. Li, and R. W. Yeung, .Network Information Flow,. IEEE Transactions on Information Theory, vol. 46, No. 4, pp. 1204-1216, July, 2000.
• Note: This is the first paper in network coding theory.
• S.-Y. R. Li, H. Li, and G. M. Koo, .Fast Knockout Algorithm for Self-route Concentration,. Computer Communications, vol. 22, pp. 1574-1584, October, 1999.
• S.-Y. R. Li and W. Lam, .ATM Switching by Divide-and-Conquer Interconnection of Partial Sorters,. Microprocessors and Micro Systems, Vol. 22, pp. 579-587, May 1999.
• W. H. Mow and S.-Y. R. Li, "Aperiodic Autocorrelation and Cross-correlation of Polyphase Sequences,. IEEE Transactions on Information Theory, Vol.43, No.3, pp.1000-1007, May 1997.
• S.-Y. R. Li and C. M. Lau, "Concentrators in ATM Switching," International Journal of Computer System Science & Engineering, Vol.11, No.6, pp.335-342, Nov., 1996.
• S.-Y. R. Li, "A 100% Efficient Media-Access Protocol for Multi-Channel LAN,. IEEE Transactions on Communications, Vol.42, No.10, pp.2803-2814, Oct. 1994.
• Abs: Because of the multi-user collision, the throughput of access protocols of local-area networks is typically low with respect to the channel capacity. From a new approach of dynamic coding, a media-access protocol is constructed for multiple parallel channels that guarantees at least 100% efficiency.
• S.-Y. R. Li, "On Full Utilization of Multi-Channel Capacity with Priority Protocol,. Information Processing Letters, Vol.36, pp.129-133, 1990.
• S.-Y. R. Li, "Considerations of Periodic Traffic in Packet Switching,. IEEE Transactions on Communications, Vol.38, No. 9, pp. 1625-1629, 1990.
• Abs: This paper pioneers in the study of periodic traffic in broadband ISDN. The necessary and sufficient speed of a packet switch based on a self-route interconnection network is determined for avoiding the phenomenon of persistent blocking due to output contention among periodic Streams of packets.
• S.-Y. R. Li, "Dynamic Programming by Exchangeability,. SIAM Journal on Computing, Vol.18, No.3, pp.463-472, 1989.
• Abs: Based upon stochastic exchangeability, the computation speed of type of dynamic programming can be improved exponentially. Besides application to bin packing and random drawing of patterns, the application to casino blackjack is the only known technique for computing the exact odds of the game with today's computers.
• S.-Y. R. Li, "Reconstruction of Polygons from Projections,. Information Processing Letters, Vol.28, No.5, pp.235-240, 1988.
• S.-Y. R. Li, "Optimal Control of Premature Queueing,. IEEE Transactions on Automatic Control, Vol.33, No.4, pp.386-389, 1988.
• Abs: A special job in an M/G/1 queue can not be served if it reaches the server before an exponentially timed event occurs, such as a parallel job, an answer from a remote data base, an operating environmental change, etc. While in the queue, there is always the option of moving the special job to the back of the queue. It is proved that, if the queue is stable, then it is optimal never to voluntarily elect the option.
• S.-Y. R. Li, "Binary Trees and Uniform Distribution of Traffic Cutback,. Journal of Computer and Systems Sciences, Vol. 32, No.1, pp.1-14, 1986.
• Abs: A theory on binary trees is derived for analyzing the optimal smoothing of traffic cutback in data communication. Results are used in the volume control of CCIS queries of AT&T Calling Card Service. As a theoretic by-product, a close-form formula counts `l' bits in the binary representation of the first N integers.
• S.-Y. R. Li, "Fast Constant Division Routines,. IEEE Transactions on Computer, Vol. C-34, No.9, pp. 866-869, 1985.
• Abs: Fermat's Little Theorem is applied to the construction of fast division routines. Software applications to the Traffic Services Position System saved the Bell System $49M (by the calculation of Dr. J. T. Gruenwald, the Bell Labs manager in charge). The application also settled a long-term dispute between Bell Labs and Southern Bell in a win-win.
• W.-C. W. Li and S.-Y. R. Li, "On Generators of Ideals Associated with Unions of Linear Varieties,. Bulletin of London Mathematical Society, Vol.13, pp.59-65, 1981.
• D. J. Kleitman and S.-Y. R. Li, "On the Partial-Sums of the Rearrangement of a Complex Series,. Studies in Applied Mathematics, Vol.64, No.2, pp.177-182, 1981.
• H. Gerber and S.-Y. R. Li, "The Occurrence of Sequence Patterns in Repeated Experiments and Hitting Times in a Markov Chain,. Stochastic Processes and Their Applications, Vol.11, pp.101-108, 1981.
• S.-Y. R. Li and W.-C. W. Li, "Independence Numbers of Graphs and Generators of Ideals,. Combinatorica, Vol.1, No.1, pp. 55-61, 1981.
• Abs: This paper characterizes the ideal generators for a family of linear varieties. A corollary generalizes Turan's theorem relating the clique number of a graph to the number of edges. This paper is cited by Handbook of Combinatorics,. edited by Graham, Grotschel and Lovasz, 1995.
• A. Hedayat and S.-Y. R. Li, "Combinatorial Topology and the Trade-Off Method in BIB Designs,. Annals of Discrete Mathematics, Vol.6, pp.189-200, 1980.
• S.-Y. R. Li, "A Martingale Approach to the Study of Occurrence of Sequence Patterns in Repeated Experiments,. Annals of Probability, Vol.8, No.6, pp.1171-1176, 1980.
• Abs: This paper invents a martingale technique for the study of occurrence of sequence patterns. With a transparent proof, a general theorem computes the waiting time till the occurrence of any pattern in a given collection and also computes the probability for each pattern to be the first to appear. This result, when restricted to the Bernoulli process, unifies some well-known formulas of William Feller and the leading-number algorithm of John Conway. This martingale technique is widely applied in genetics where each pattern represents certain sequential events of DNA mutation. This technique and the main theorems are all cited in the martingale section of Sheldon Ross.s textbook .Stochastic Processes..
• R. L. Graham, S.-Y. R. Li and W.-C. W. Li, "On the Structure of T-Designs,. SIAM Journal of Algebraic and Discrete Methods, Vol.1, pp.8-14, 1980.
• Note: This paper is cited by .Handbook of Combinatorics,. of Graham, Grotschel and Lovasz, 1995.
• A. Hedayat and S.-Y. R. Li, "The Trade-Off Method in the Construction of BIB Designs,. Annals of Statistics, Vol. 7, No. 6, 1979, pp. 1277- 1287.
• Abs: For 7 varieties, any number of blocks of the size 3 counting repetitions, and any number of distinct blocks, the existence of balanced incomplete block designs is determined.
• S. D. Chaiken, D. J. Kleitman and S.-Y. R. Li, "Possible Degrees of Strongly 2-Connected Graphs,. Annals of New York Academy of Sciences, Vol.319, pp.119-129, 1979.
• S.-Y. R. Li, "Extremal Theorems on the Divisors of a Number,. Discrete Mathematics, Vol.24, pp.37-46, 1978.
• S.-Y. R. Li, "N-Person Nim and N-Person Moore's Game,. International Journal of Game Theory, Vol.7, No.1, pp.31-36, 1978.
• Note: This paper is cited by the book .Winning Ways. of Berlekamp, Conway and Guy, 1982.
• D. J. Kleitman, M. Koren and S.-Y. R. Li, "On the Existence of Simultaneous Edges Disjoint Realization of Degree Sequence with .Few. Edged,. SIAM Journal of Applied Mathematics, Vol.32, pp.619-626, 1977.
• A. Adler and S.-Y. R. Li, "Magic N-Cubes and Prouhet Sequences,. American Mathematical Monthly, Vol.84, pp.618-627, 1977.
• S.-Y. R. Li, "An Extremal Problem among Subsets of a Set,. Journal of Combinatorial Theory, Series A, Vol.23, No.3, pp.341-343, 1977.
• S.-Y. R. Li, "Sums of Zuchswang Games,. Journal of Combinatorial Theory, Series A, Vol.21, No.1, pp.52-67, 1976.
• Abs: Conway numbers give a complete theory on the class of perfect-information, finite-move Zugzwang games (Zugzwang means that it is a disadvantage to move.) This paper formulates the general perfect-information Zugzwang games with possible loops and derives the additive theory. The structure of Zugzwang games turns out to be isomorphic to the diadic rational points on a half plane with finite-move games corresponding to diagonal line on the boundary. This theory is cited by the book .Winning Ways. of Berlekamp, Conway and Guy, 1982.
• S.-Y. R. Li, "Annihilators in Nonrepetitive Semigroups,. Studies in Applied Mathematics, Vol.55, pp.83-85, 1976.
• D. J. Kleitman and S.-Y. R. Li, "A note on Unigraphic Sequences,. Studies in Applied Mathematics, Vol.54, No.4, pp. 283-287, 1975.
• S.-Y. R. Li, "Graphic Sequences with Unique Realization,. Journal of Combinatorial Theory, Series B, Vol.19, No.1, pp.42-68, 1975.
• Abs: A polynomial-time algorithm determines whether an integer sequence is the valence sequence of a unique graph up to isomorphisms.
• R. M. Karp and S.-Y. R. Li, "Two Special Cases of the Assignment Problem,. Discrete Mathematics, Vol.13, pp.129-142, 1975.
• Abs: With supply and demand located at points on a circle or a line, a linear-time algorithm yields the maximum matching with the smallest total distance of transportation. This is a paper in computational geometry before the term .computational geometry. becomes widely used.
• S.-Y. R. Li, "Generalized Impartial Games,. International Journal of Game Theory, Vol.3, No.3, pp.169-184, 1974.

• S.-Y. R. Li, .Algebraic Switching Theory and Broadband Applications,. Academic Press, 2001.

Note: The bulk of research findings of Bob Li during 1986-2000 is published through this book, which attempts to establish switching theory as a new branch of applied algebra. Following are examples of original and industrial contributions of the book.

• The concept of preservation of conditionally nonblocking switches under certain versions of 2-stage interconnection is introduced. The preservation theorems enable flexible recursive constructions of large switches. Sporadic discoveries in the previous literature often are instances of special cases of a preservation theorem disguised under different languages. A preservation theorem pinpoints the intrinsic issue, avoids the confusion of ad hoc settings, enhances the depth of understanding, unifies sporadic discoveries, and offers the flexibility needed in real applications.
• Often interstage exchanges in a multistage interconnection network (MIN) are induced by permutations of address bits. The trace/guide transform is a powerful algebraic analog to the Fourier/Laplace transform of functions. It converts a MIN into an integer sequence, which characterizes various attributes of the network including routability, routing control, network equivalence under intrastage rearrangement, and preservation of assorted conditionally nonblocking properties of switches.
• The switching/router industry has always relied on either the crossbar or the memory switch fabric, both having reached their limits of upscaling. To this problem, Bob.s algebraic switching theory provides a theoretically sophisticated but hardware compact solution, which is now called the algebraic switch fabric. In recent years, ITRI, a renowned semi-Taiwanese-governmental organization undertook the .Metro Switch. project and adopted the algebraic switch fabric. This futuristic technology will be transferred to manufacturers upon the next upturn of the industry

• “Mathematical Foundation of Switching Fabrics,” estimated completion time in 2011. Note: This book will relate group theory, topology, Boolean algebra, etc. to the cutting-edge industrial technology in switching.
• S.-Y. R. Li and Y. X. Yang, "Prime Factorization Theory of Networks,” estimated completion time in 2009. Note: This is a prime factorization theory on the switching network. It parallels the factorization theory of ideals in an integral domain. The goal is to optimize the inter-office configuration for interflow during night closing and contingency re-route.

(Papers not published in journals or conferences.)

• S.-Y. R. Li and H. Li, "Layout complexity of bit-permuting exchange in multi-stage interconnection networks,. published in the book "Switching Networks: Recent Advances" edited by Ding-Zhu Du and Hung Q. Ngo, Kluwer Academic Publishers, Boston, pp.259-276, 2001.
• S. Y. Kwok and S.-Y. R. Li, "Study on of Wide-sense Nonblocking Switching Networks from the Approach of Upper Ideals,. published in the book "Switching Networks: Recent Advances" edited by Ding-Zhu Du and Hung Q. Ngo, Kluwer Academic Publishers, Boston, pp.101-116, 2001.
• C. K. Kao, S.-Y. R. Li and R. Wu, "Information Technology,. a chapter in .Technology Road Maps for Hong Kong. edited by C. K. Kao and K. Young, The Chinese University Press, Hong Kong, 1991.

• Z. Shao, M. Chen, S. Avestimehr, and S.-Y. R. Li, “Cross-layer Optimization for Wireless Networks with Deterministic Channel Models,” submitted to Infocom 2010.
• S.-Y. R. Li, “Unified algebraic theory for sorting, routing, multicasting, and concentration networks,” submitted to Infocom 2010.
• S. Li, J. Huang, and S.-Y. R. Li, “Revenue Maximization for Communication Networks with Usage-Based Pricing,” to appear in Globecom 2009.
• L. M. Law, J. Huang, M. Liu, and S.-Y. R. Li, “Price of Anarchy for Cognitive MAC Games,” to appear in Globecom 2009.
• S.-Y. R. Li and Q. Sun, “Network Coding Theory via Commutative Algebra,” Workshop on Network Coding, Theory, and Applications, Lausanne, Switzerland, pp. 12-17, June, 2009.
• Z. Shao and S.-Y. R. Li, “The Promise of Network Coding,” International Conference on Ubiquitous and Future Networks (ICUFN) 2009, pp.148-152, June,   2009.
• Z. Shao and S.-Y. R. Li, “To Code or Not to Code: Rate Optimality in Node-Capacitated Networks,” IEEE International Symposium on Information Theory (ISIT’09), pp. 1779-1783, Seoul, Korea, June, 2009.
• Q. Sun, S. T. Ho, S.-Y. R. Li, "On Network Matroids and Linear Network Codes," Proceedings of IEEE International Symposium on Information Theory (ISIT’08), pp. 1833-1837, Toronto, Canada, July, 2008.
• S.-Y. R. Li and S. T. Ho, “Ring-theoretic foundation of convolutional network coding,” Proceedings of 4th Workshop on Network Coding, Theory, and Applications, pp. 56-61, Hong Kong, Jan., 2008.
• S.-Y. R. Li and X. J. Tan, .Fast control over fiber memory,. Proceedings of IEEE International Symposium on Information Theory, pp. 2411-2415, Nice, France, June 24-29, 2007.
• X. J. Tan and S.-Y. R. Li, .Mixed preservation of Conditionally Nonblocking Switches under 2-stage Interconnection,. Proceedings of PDCAT 2006, pp. 17-22, Taipei, Taiwan, Dec. 2006.
• S.-Y. R. Li and X. Tan, "Analog Memory by Recursive 2-Stage Switching,. Proceeding of the 2005 IEEE International Symposium on Information Theory (ISIT.06), pp. 2779-2783, Seattle, USA, July, 2006.
• S.-Y. R. Li and R. W. Yeung, "On Convolutional Network Coding,. Proceeding of the 2006 IEEE International Symposium on Information Theory (ISIT.06), pp. 1743-1747, Seattle, USA, July, 2006.
• Qian Z.; Lu G. and S.-Y. R. Li, "Efficient OXC Monitoring Based on Time Delay Recognition". Paper presented in the International Conference on Transparent Optical Networks: ICTON 2006, 4 pgs. Nottingham, United Kingdom, June 2006.
• S.-Y. R. Li and X. Tan, "Theory on Switching Preservation under 2-stage Interconnection,. Proceedings of 2005 International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT.05), Dalian, China, pp. 26-30, Dec. 2005.
• X. Tan, S.-Y. R. Li, and Y. Shen, .Rearrangeability of the Tandem Cascade of Banyan-type Networks,. Proceedings of 2005 International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT.05), Dalian, China, pp. 11-15, Dec. 2005.
• R. W. Yeung and S.-Y. R. Li, .Polynomial Time Construction of Generic Linear Network Codes," Proceedings of the 43rd Annual Allerton Conference on Communication, Control, and Computing, Paper No. 43_379, Sep. 2005.
• X. Tan and S.-Y. R. Li, .On Rearrangeability of Cascaded Banyan-type Networks,. Proceedings of the 18th international conference on Parallel Distributed Computing Systems (PDCS), Las Vegas, USA, pp. 79-84, Sep. 2005.
• S.-Y. R. Li, N. Cai, and R. W. Yeung, "On Theory of Linear Network Coding," Proceeding of the 2005 IEEE International Symposium on Information Theory (ISIT.05), pp. 273-277, Sep. 2005.
• S.-Y. R. Li and X. Tan, "Recursive construction of distributors by merging," Proceeding of the 23rd IASTED international conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, pp.680-685, Feb., 2005.
• W. Lam, K. T. So, and S.-Y. R. Li, .On Concentration networks based on iterative cells,. Proceedings of the First International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT.2000), Hong Kong, pp. 101-108, June, 2000.
• S.-Y. Kwok and S.-Y. R. Li, .Study of Wide-sense Nonblocking Switching Networks from the Approach of Upper Ideals,. Proceedings of the Second CTS Conference on Combinatorics and Algorithms, HsinChu, Taiwan: National Chiao Tung University, p. 17, May, 2000.
• S.-Y. R. Li and R. W. Yeung, "Single-source network information flow," Proceedings of the 1999 IEEE Information Theory Workshop, Metsovo, Greece, p. 25, June-July, 1999.
• S.-Y. R. Li, .Optimal Multi-stage Interconnection by Divide-and-Conquer Networks,. Proceedings of the Second International Conference on Parallel and Distributed Computing and Networks (PDCN.98), Brisbane, Australia, pp. 318-323, December 1998.
• S.-Y. R. Li and R. W. Yeung, .Network Multicast Flow via Linear Coding,. Proceedings of International Symposium on Operations Research and its Applications (ISORA.98), Kunming, China, pp. 197-211, August 1998.
• S.-Y. R. Li and H. Li, .Optimization in the Fast Knockout Algorithm for Self-Route Concentration,. Proceedings of ICC.98, Atlanta, pp. 630-634, July 1998.
• R. Alshwede, N. Cai, S.-Y. R. Li, and R. W. Yeung, .Network Information Flow,. Proceedings of 1st Pacific Rim Conference on Mathematics, Hong Kong, pp. 79-80, January 1998.
• S.-Y. R. Li, G. M. Koo, and H. Li, .An algorithm for the construction of concentrators from 2 x 2 sorters,. Series in Discrete Mathematics and Theoretical Computer Science 42: Advances in Switching Networks, AMS, Proceedings of DIMACS Workshop on Network Switching, Princeton, pp. 197-219, July 1997.
• K. H. Shum and S.-Y. R. Li, "Runtime Support for Replicated Parallel Simulators of an ATM Network on Workstation Clusters,. Lecture Notes of Computer Science 1123, Springer-Verlag, Proceedings of European Conference on Parallel Processing, Lyon, France, pp. 818-821, August 1996,
• S.-Y. R. Li and C. M. Lau, "Concentrators in ATM Switching," Proceedings of Globecom'95, Singapore, pp.1746-1750, Nov. 1995.
• T. K.-C. Chung, C.-F. Chan, S.-Y. R. Li, and C.-S. Choy, "A Self-routing Non-buffering ATM Switch,. Proceedings of the 4th International Conference on VLSI and CAD," Seoul, pp.83-86, October 1995.
• S.-Y. R. Li, "Partial Sorting Networks with Applications," Proceedings of International Workshop on Discrete Mathematics and Algorithms (IWDMA'94), Guangzhou, pp.27-43, Dec. 1994.
• S.-Y. R. Li, "Formalization of Self-route Networks and the Rotary Switch,. Proceedings of INFOCOM'94, Toronto, pp.438-446, June 1994.
• S.-Y. R. Li and K. H. Shum, "Distributed Algorithms for Flow Control and Call Set-up in a Broadband Network,. Proceedings of Twelfth Annual Conference on European Fibre Optic Communications and Networks, Heidelberg, pp.182-186, June 1994.
• S.-Y. R. Li, "The Concept of Prime Factorization Networks,. Proceedings of International Workshop on Discrete Mathematics and Algorithms (IWDMA'93), Hong Kong, pp.43-64, Dec. 1993.
• W. H. Mow and S.-Y. R. Li, "Aperiodic Autocorrelation Properties of Perfect Polyphase Sequences,. Proceedings of International Conference on Communication Systems / International Symposium on Information Theory and Its Application (ICCS/ISITA '92), Singapore, pp.1232-1234, 1992.
• S.-Y. R. Li and N. Zhang, "On the Maximum Correlation of Signals,. Second Int'l Conf. on Ind. and Appl. Math., Washington D. C., 1991.
• S.-Y. R. Li and N. Zhang, "Minimum Bound of Auto and Cross Correlations of Sequences,. 1990 SIAM Annual Meeting, Chicago, 1990.
• S.-Y. R. Li, "Algorithms for Flow Control and Call Set-up in Multi-Hop Broadband ISDN,. Proceedings of INFOCOM '90, pp.889-895, San Francisco, 1990.
• S.-Y. R. Li, "A Protocol for Multi-user Communication with 100% Throughput,. Proceedings of 1988 Beijing International Workshop on Information Theory, pp. BII 5.1-5.4, Beijing, China, July, 1988.

USA

• J. Zhu and S.-Y. R. Li , “Optimizing Switching Element for minimal Latency,” examination in progress, U.S. Patent application No. 7,609,695, Oct. 27, 2009

• S.-Y. R. Li, .Self-routing Device for Switching Packets of Different Lengths, U.S. Patent No. 7,292,570, November 6, 2007.
• S.-Y. R. Li, .Multicast Concentrators,. U.S. Patent No. 7,280,538, October 9, 2007.
• S.-Y. R. Li and J. Zhu, .U.S. Patent No. 7,274,689, September 25, 2007.
• S.-Y. R. Li and L. W. Chiang, .Configuring Equivalent Multistage Interconnection Networks in the Bit-permuting Style,. U.S. Patent No. 7,139,266, November 21, 2006.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Compressor Type,. U.S. Patent No. 7,136,380, November 14, 2006.
• S.-Y. R. Li, .Switching by Multistage Interconnection of Concentrators,. U.S. Patent No. 7,106,728, September 12, 2006.
• J. Zhu, S.-Y. R. Li and L. W. Chiang, .Scalable 2-stage Interconnections,. U.S. Patent No. 7,103,059, September 5, 2006.
• S.-Y. R. Li, .'General self-routing control mechanism over bit-permuting switching networks,. U.S. Patent No. 7,099,314, August 29, 2006.
• S.-Y. R. Li, .Multistage Interconnection Networks of Multicast Concentrators with Self-routing Control Mechanism,. U.S. Patent No. 7,079,532, July 18, 2006.
• S.-Y. R. Li, .Physical Implementation of Switching Fabrics Constructed from Recursive 2-Stage Interconnection,. U.S. Patent No. 7,072,334, July 4, 2006.
• S.-Y. R. Li, .Generalized Divide-and-conquer Networks,. U.S. Patent No. 7,065,074, June 20, 2006.
• S.-Y. R. Li, .Self-routing Control Mechanism over Multistage Interconnection Network of Concentrators,. U.S. Patent No. 7,065,073, June 20, 2006.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Decompressor Type,. U.S. Patent No. 7,050,429, May 23, 2006.
• S.-Y. R. Li, .General Self-routing Mechanism for Multicasting Control over Bit-permuting Switching Networks,. U.S. Patent No. 7,042,878, May 9, 2006.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Circular-unimodal Type,. U.S. Patent No. 7,042,873, May 9, 2006.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Upturned Compressor Type,. U.S. Patent No. 7,035,254, April 25, 2006.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Upturned Decompressor Type,. U.S. Patent No. 7,031,303, April 18, 2006.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Expander Type,. U.S. Patent No. 7,016,345, March 21, 2006.
• S.-Y. R. Li, .Switching Concentrator,. U.S. Patent No. 6,999,466, February 14, 2006.
• S.-Y. R. Li, J. Zhu, C. M. Lau, and W. Lam, .New Routing Schemes for Packet Switching Networks,. U.S. Patent No. 6,999,461, February 14, 2006.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Circular Expander Type,. U.S. Patent No. 6,954,457, October 11, 2005.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Upturned Expander Type,. U.S. Patent No. 6,952,418, October 4, 2005.
• S.-Y. R. Li, .Conditionally Nonblocking Switch of the Unimodal-circular Type,. U.S. Patent No. 6,657,998, December 2, 2003.
• S.-Y. R. Li, .Running-sum Adder Networks Determined by Recursive Construction of Multi-stage Networks,. U.S. Patent No. 6,591,285, July 8, 2003.
• S.-Y. R. Li, "Designs of Flow Control and Call Set-up in Broadband ISDN,. U.S. Patent No. 5,128,932, July 7, 1992.
• S.-Y. R. Li, "Quick-set Domino Arrangements Including Two-Person Domino Challenge Game,. U.S. Patent No. 4,988,109, January 29, 1991.
• S.-Y. R. Li, "Puzzles and Game on Geometric Shapes,. U.S. Patent No. 4,913,436, April 3, 1990.
• B. Gopinath and S.-Y. R. Li, "High Capacity Communication System Utilizing Collision-type Channels,. U.S. Patent No. 4,899,143, February 6, 1990.
• S.-Y. R. Li, "High Capacity Communication System Utilizing OR-type Channels,. U.S. Patent No. 4,852,091, July 25, 1989.
• B. Gopinath and S.-Y. R. Li, "High Capacity Communication Utilizing Static, Or-type Channels,. U.S. Patent No. 4,768,189, August 30, 1988.

China and Taiwan

• S.-Y. R. Li and J. Zhu, .Optimizing Switching Element for Minimal Latency (交换网络的封包路由方法与系统),. People.s Republic of China patent No. ZL03106082.X, November 26, 2006.
• H. Li, W. He, S.-Y. R. Li, and … “一种负载均衡分组交换结构及其构造方法,” People’s Republic of China patent application No. 200810217261.3, Nov. 4, 2008.
• H. Li, Y. Zheng, and S.-Y. R. Li, “基于自路由集线器的电路式分组交换方法,” People’s Republic of China patent application No. 200810141999.6, Aug. 26, 2008.
• J. Zhu, S.-Y. R. Li, W. Lam, and H. Li, “自路由集线器以分治网络构成交换结构的方法,” People’s Republic of China patent application No. 200610062454.7, Sep. 5, 2006.
• S.-Y. R. Li, H. Li, W. Lam, and J. Zhu, “可大规模并行访问的一站式缓冲存储分组交换结构及方法,” People’s Republic of China patent application No. 200610062453.2, Sep. 5, 2006.
• H. Li, S.-Y. R. Li, W. Lam, and J. Zhu, “自路由交换集线器及其方法,” People’s Republic of China patent application No. 200610062452.8, Sep. 5, 2006.
• S.-Y. R. Li and J. Zhu, "交換網路的封包路由方法與系統.(Optimizing Switching Element for Minimal Latency)," Republic of China (Taiwan) Patent No. I236814, July 21, 2005.

(As Principal Investigator) 

• UGC Area of Excellence, 2009, $103,670,000, One of the two Principal Investigators

• NSFC-RGC Joint Research Grant 2007, about $400,000
• RGC CERG, 2007, $343,200
• Microsoft Research Asia (MSRA), 2007, $120,000
• Research Committee Group Research Scheme 2007, $900,000
• RGC Central Allocation Grant, 2007, $2,900,000
• RGC CERG, 2006, $356,000
• Microsoft Research (USA), 2006, US$40,000
• RGC CERG, 2005, $692,480
• RGC CERG, 2004, $653,244
• MTK Computers Ltd., 1996, $100,000
• UPGC Earmarked Research Grant, 1995, $257,000
• UPGC Earmarked Research Grant, 1994, $612,000
• CUHK Direct Grant, around 1992, about $50,000
• NSF Grant (in USA), 1978, about US$15,000

• Prof. MOW Wai-ho, PhD 1992
• Mr. KO Wing Hoi, MSc 1992
• Prof. SHUM Kam Hong, MPhil 1993
• Mr. LAU Chi Ching, MSc 1993
• Mr. LAU Chu Man, MPhil 1995
• Mr. LAU Chi Ming, MSc 1995
• Prof. LI Hui, PhD 2000
• Mr. KWOK Siu Yu, MPhil 2000
• Mr. SO Kin Tai, MPhil 2000
• Dr. LAM Wan, MPhil 1998 and PhD 2001
• Dr. ZHU Jian, PhD 2002
• Mr. LEUNG Yiu Tong, MPhil 2003
• Mr. QIAN Zhengfeng, MPhil 2003
• Prof. TAN Xuesong, PhD 2004
• Dr. SUN Tyler Qifu, PhD 2009
• Dr. HO Siuting, PhD 2009
• 7 PhD students currently under supervision