Shuo-Yen Robert Li

According to our database1, Shuo-Yen Robert Li authored at least 78 papers between 1976 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Unified theory on preservation of conditionally non-blocking switches by the two-stage interconnection network.
IET Networks, 2018

2017
Repair Tree: Fast Repair for Single Failure in Erasure-Coded Distributed Storage Systems.
IEEE Trans. Parallel Distributed Syst., 2017

Concurrent regenerating codes.
IET Commun., 2017

Detect differentially methylated regions using non-homogeneous hidden Markov model for methylation array data.
Bioinform., 2017

General Fractional Repetition Codes From Combinatorial Designs.
IEEE Access, 2017

Minimum Storage Regenerating Codes for Scalable Distributed Storage.
IEEE Access, 2017

2016
On Base Field of Linear Network Coding.
IEEE Trans. Inf. Theory, 2016

Multicast Switching Fabric Based on Network Coding and Algebraic Switching Theory.
IEEE Trans. Commun., 2016

Timeslot interchanging by efficient optical switches.
IET Commun., 2016

Concurrent Regenerating Codes and Scalable Application in Network Storage.
CoRR, 2016

2015
HFR code: a flexible replication scheme for cloud storage systems.
IET Commun., 2015

On decoding of DVR-based linear network codes.
Appl. Algebra Eng. Commun. Comput., 2015

Towards minimizing the within-packet redundancy in wireless network coding.
Proceedings of the IEEE International Conference on Communication, 2015

LB-MSNC: A load-balanced multicast switching fabric with network coding.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
Dynamic Profit Maximization of Cognitive Mobile Virtual Network Operator.
IEEE Trans. Mob. Comput., 2014

Erratum to: Lattice Classification by Cut-through Coding.
Order, 2014

Lattice Classification by Cut-through Coding.
Order, 2014

Emulation of multistage interconnection networks by fibre memory.
IET Commun., 2014

On low repair complexity storage codes via group divisible designs.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

2013
Improved short adjacent repeat identification using three evolutionary Monte Carlo schemes.
Int. J. Data Min. Bioinform., 2013

Matroidal Characterization of Optimal Linear Network Codes over Cyclic Networks.
IEEE Commun. Lett., 2013

Flying against lossy light-load hybrid networks.
Proceedings of the 2013 9th International Wireless Communications and Mobile Computing Conference, 2013

Distributed optimization for wireless networks with inter-session network coding.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Profit maximization of cognitive virtual network operator in a dynamic wireless network.
Proceedings of IEEE International Conference on Communications, 2012

2011
Cross-Layer Optimization for Wireless Networks With Deterministic Channel Models.
IEEE Trans. Inf. Theory, 2011

Mux/Demux Queues, FIFO Queues, and Their Construction by Fiber Memories.
IEEE Trans. Inf. Theory, 2011

Network Coding Theory Via Commutative Algebra.
IEEE Trans. Inf. Theory, 2011

To Code or Not to Code: Rate Optimality of Network Coding versus Routing in Peer-to-Peer Networks.
IEEE Trans. Commun., 2011

Linear Network Coding: Theory and Algorithms.
Proc. IEEE, 2011

An MCMC algorithm for detecting short adjacent repeats shared by multiple sequences.
Bioinform., 2011

Binary error correcting network codes.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Delay invariant convolutional network codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Unified algebraic theory of sorting, routing, multicasting, and concentration networks.
IEEE Trans. Commun., 2010

Bayesian Approach for Identifying Short Adjacent Repeats in Multiple Sequences.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2010

An Evolutionary Monte Carlo algorithm for identifying short adjacent repeats in multiple sequences.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

An automatic procedure to search highly repetitive sequences in genome as fluorescence in situ hybridization probes and its application on Brachypodium distachyon.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009
Hybrid preservation of conditionally nonblocking switches under 2-stage interconnection.
IEEE Trans. Commun., 2009

On rearrangeability of tandem connection of banyan-type networks.
IEEE Trans. Commun., 2009

Fast Graph Laplacian Regularized Kernel Learning via Semidefinite-Quadratic-Linear Programming.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

To code or not to code: Rate optimality in node-capacitated networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Revenue Maximization for Communication Networks with Usage-Based Pricing.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

Price of Anarchy for Cognitive MAC Games.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2008
On network matroids and linear network codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Preservation of Conditionally Nonblocking Switches Under Two-Stage Interconnection.
IEEE Trans. Commun., 2007

Recursive construction of parallel distribution networks.
J. Parallel Distributed Comput., 2007

Rearrangeability of Tandem Cascade of Banyan-Type Networks.
IEICE Trans. Inf. Syst., 2007

Fast Control over Fiber Memory.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Mixed Preservation of Conditionally Nonblocking Switches under 2-stage Interconnection.
Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

On Convolutional Network Coding.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Analog memory by recursive 2-stage switching.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Network Coding Theory - Part II: Multiple Source.
Found. Trends Commun. Inf. Theory, 2005

Network Coding Theory - Part I: Single Source.
Found. Trends Commun. Inf. Theory, 2005

Recursive Construction of Distributors by Merging.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2005

Rearrangeability of the Tandem Cascade of Banyan-type Networks.
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

Theory on Switch Preservation under 2-stage Interconnection.
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

On theory of linear network coding.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On Rearrangeability of Cascaded Banyan-type Networks.
Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

2003
Linear network coding.
IEEE Trans. Inf. Theory, 2003

2000
Network information flow.
IEEE Trans. Inf. Theory, 2000

1999
Fast knockout algorithm for self-route concentration.
Comput. Commun., 1999

1998
Optimization in the fast knockout algorithm for self-route concentration.
Proceedings of the 1999 IEEE International Conference on Communications, 1998

1997
Aperiodic autocorrelation and crosscorrelation of polyphase sequences.
IEEE Trans. Inf. Theory, 1997

An algorithm for the construction of concentrators from 2 x 2 sorters.
Proceedings of the Advances in Switching Networks, 1997

1996
Runtime Support for Replicated Parallel Simulators of an ATM Network on Workstation Clusters.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1994
A 100% efficient media-access protocol for multichannel LAN.
IEEE Trans. Commun., 1994

Formalization of Self-route Networks and the Rotary Switch.
Proceedings of the Proceedings IEEE INFOCOM '94, 1994

1990
Considerations of periodic traffic in packet switching.
IEEE Trans. Commun., 1990

On Full Utilization of Multi-Channel Capacity with Priority Protocol.
Inf. Process. Lett., 1990

Algorithms for Flow Control and Call Set-Up in Multi-Hop Broadband ISDN.
Proceedings of the Proceedings IEEE INFOCOM '90, 1990

1989
Dynamic Programming by Exchangeability.
SIAM J. Comput., 1989

1988
Reconstruction of Polygons from Projections.
Inf. Process. Lett., 1988

1986
Binary Trees and Uniform Distribution of Traffic Cutback.
J. Comput. Syst. Sci., 1986

1985
Fast Constant Division Routines.
IEEE Trans. Computers, 1985

1981
Independence numbers of graphs and generators of ideals.
Comb., 1981

1980
On the Structure of t-Designs.
SIAM J. Matrix Anal. Appl., 1980

1978
Extremal theorems on divisors of a number.
Discret. Math., 1978

1977
An Extremal Problem Among Subsets of a Set.
J. Comb. Theory, Ser. A, 1977

1976
Sums of Zuchswang Games.
J. Comb. Theory, Ser. A, 1976


  Loading...