Cheng-Shang Chang

Orcid: 0000-0002-5386-4756

According to our database1, Cheng-Shang Chang authored at least 149 papers between 1993 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Explainable, Stable, and Scalable Network Embedding Algorithms for Unsupervised Learning of Graph Representations.
IEEE Trans. Comput. Soc. Syst., October, 2023

Resource allocation for URLLC and eMBB traffic in uplink wireless networks.
Perform. Evaluation, September, 2023

On the Stability Regions of Coded Poisson Receivers With Multiple Classes of Users and Receivers.
IEEE/ACM Trans. Netw., February, 2023

A Generalized Configuration Model With Triadic Closure.
IEEE Trans. Netw. Sci. Eng., 2023

InterAct: Exploring the Potentials of ChatGPT as a Cooperative Agent.
CoRR, 2023

A Simple Explanation for the Phase Transition in Large Language Models with List Decoding.
CoRR, 2023

Degree-degree Correlated Low-density Parity-check Codes Over a Binary Erasure Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Upper Bounds for the Stability Regions of Coded Poisson Receivers.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Using Locality-Sensitive Hashing for Rendezvous Search.
Proceedings of the IEEE International Conference on Communications, 2023

2022
ALOHA Receivers: A Network Calculus Approach for Analyzing Coded Multiple Access With SIC.
IEEE/ACM Trans. Netw., 2022

Constructions and Comparisons of Pooling Matrices for Pooled Testing of COVID-19.
IEEE Trans. Netw. Sci. Eng., 2022

A Degree Based Approximation of an SIR Model with Contact Tracing and Isolation.
CoRR, 2022

Parallel Decoding of IRSA with Noise.
Proceedings of the 2022 IEEE 33rd Annual International Symposium on Personal, 2022

2021
Poisson Receivers: A Probabilistic Framework for Analyzing Coded Random Access.
IEEE/ACM Trans. Netw., 2021

On the Theoretical Gap of Channel Hopping Sequences With Maximum Rendezvous Diversity in the Multichannel Rendezvous Problem.
IEEE/ACM Trans. Netw., 2021

Positively Correlated Samples Save Pooled Testing Costs.
IEEE Trans. Netw. Sci. Eng., 2021

A Hierarchical Stitching Algorithm for Coded Compressed Sensing.
CoRR, 2021

A Configuration Model with Triadic Closure.
CoRR, 2021

PPoL: A Periodic Channel Hopping Sequence with Nearly Full Rendezvous Diversity.
Proceedings of the 30th Wireless and Optical Communications Conference, 2021

2020
A Time-Dependent SIR Model for COVID-19 With Undetectable Infected Persons.
IEEE Trans. Netw. Sci. Eng., 2020

Percolation Threshold for Competitive Influence in Random Networks.
IEEE Trans. Comput. Soc. Syst., 2020

Using Graph Convolutional Networks to Compute Approximations of Dominant Eigenvectors.
SIGMETRICS Perform. Evaluation Rev., 2020

Comparisons of Pooling Matrices for Pooled Testing of COVID-19.
CoRR, 2020

Explainable, Stable, and Scalable Graph Convolutional Networks for Learning Graph Representation.
CoRR, 2020

ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC.
CoRR, 2020

A Time-dependent SIR model for COVID-19.
CoRR, 2020

2019
Asynchronous Grant-Free Uplink Transmissions in Multichannel Wireless Networks With Heterogeneous QoS Guarantees.
IEEE/ACM Trans. Netw., 2019

Tracking Network Evolution and Their Applications in Structural Network Analysis.
IEEE Trans. Netw. Sci. Eng., 2019

Exponentially Twisted Sampling for Centrality Analysis and Community Detection in Attributed Networks.
IEEE Trans. Netw. Sci. Eng., 2019

Centrality Analysis in $d$ -Regular Directed Acyclic Random Networks and Its Applications in Top- $k$ Recommendations.
IEEE Trans. Comput. Soc. Syst., 2019

An Asymptotically Optimal Channel Hopping Sequence with Maximum Rendezvous Diversity.
CoRR, 2019

ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States.
CoRR, 2019

Generalized Modularity Embedding: a General Framework for Network Embedding.
CoRR, 2019

A Quasi-random Algorithm for Anonymous Rendezvous in Heterogeneous Cognitive Radio Networks.
CoRR, 2019

A generalized configuration model with degree correlations and its percolation analysis.
Appl. Netw. Sci., 2019

A Reinforcement Learning Approach for the Multichannel Rendezvous Problem.
Proceedings of the 2019 IEEE Globecom Workshops, Waikoloa, HI, USA, December 9-13, 2019, 2019

2018
Greenput: A Power-Saving Algorithm That Achieves Maximum Throughput in Wireless Networks.
IEEE/ACM Trans. Netw., 2018

A Probabilistic Framework for Structural Analysis and Community Detection in Directed Networks.
IEEE/ACM Trans. Netw., 2018

A Mathematical Theory for Multistage Battery Switching Networks.
IEEE Trans. Netw. Sci. Eng., 2018

Temporal Matrix Factorization for Tracking Concept Drift in Individual User Preferences.
IEEE Trans. Comput. Soc. Syst., 2018

An Enhanced Fast Multi-Radio Rendezvous Algorithm in Heterogeneous Cognitive Radio Networks.
IEEE Trans. Cogn. Commun. Netw., 2018

Nonadaptive Deterministic Asynchronous Conflict Resolution.
IEEE Commun. Lett., 2018

A Fast Multi-Radio Rendezvous Algorithm in Heterogeneous Cognitive Radio Networks.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

Exponentially Twisted Sampling for Centrality Analysis in Attributed Networks.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

2017
Efficient Encoding of User IDs for Nearly Optimal Expected Time-To-Rendezvous in Heterogeneous Cognitive Radio Networks.
IEEE/ACM Trans. Netw., 2017

Greedy Constructions of Optical Queues With a Limited Number of Recirculations.
IEEE Trans. Inf. Theory, 2017

Exponentially Twisted Sampling: a Unified Approach for Centrality Analysis in Attributed Networks.
CoRR, 2017

A Unified Framework for Sampling, Clustering and Embedding Data Points in Semi-Metric Spaces.
CoRR, 2017

K-sets+: a Linear-time Clustering Algorithm for Data Points with a Sparse Similarity Measure.
CoRR, 2017

Community detection in signed networks: An error-correcting code approach.
Proceedings of the 2017 IEEE SmartWorld, 2017

K-sets<sup>+</sup>: A linear-time clustering algorithm for data points with a sparse similarity measure.
Proceedings of the 2017 IEEE SmartWorld, 2017

2016
Tight Lower Bounds for Channel Hopping Schemes in Cognitive Radio Networks.
IEEE/ACM Trans. Netw., 2016

Coding Rate Analysis of Forbidden Overlap Codes in High-Speed Buses.
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2016

Analyses of the Clustering Coefficient and the Pearson Degree Correlation Coefficient of Chung's Duplication Model.
IEEE Trans. Netw. Sci. Eng., 2016

A Mathematical Theory for Clustering in Metric Spaces.
IEEE Trans. Netw. Sci. Eng., 2016

Consensus and Polarization of Binary Opinions in Structurally Balanced Networks.
IEEE Trans. Comput. Soc. Syst., 2016

A probabilistic framework for structural analysis in directed networks.
Proceedings of the 2016 IEEE International Conference on Communications, 2016

2015
Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed Switching.
IEEE Trans. Computers, 2015

Relative centrality and local community detection.
Netw. Sci., 2015

On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous.
Math. Oper. Res., 2015

Temporal Matrix Factorization for Tracking Concept Drift in Individual User Preferences.
CoRR, 2015

Predicting personality traits of Chinese users based on Facebook wall posts.
Proceedings of the 24th Wireless and Optical Communication Conference, 2015

A necessary and sufficient closure property for two-stage constructions of switching networks.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
Constructions of Memoryless Crosstalk Avoidance Codes Via ${\cal C}$ -Transform.
IEEE Trans. Very Large Scale Integr. Syst., 2014

A proximity measure for link prediction in social user-item networks.
Proceedings of the 15th IEEE International Conference on Information Reuse and Integration, 2014

CACH: Cycle-Adjustable Channel hopping for control channel establishment in cognitive radio networks.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Analysis of clustering coefficients of online social networks by duplication models.
Proceedings of the IEEE International Conference on Communications, 2014

Temporal bipartite projection and link prediction for online social networks.
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013
A Universal Stabilization Algorithm for Multicast Flows with Network Coding.
IEEE Trans. Commun., 2013

Load-balanced Birkhoff-von Neumann switches and fat-tree networks.
Proceedings of the IEEE 14th International Conference on High Performance Switching and Routing, 2013

2012
Anchored desynchronization.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
Quasi-Output-Buffered Switches.
IEEE Trans. Parallel Distributed Syst., 2011

Constructions of Optical Priority Queues With Multiple Inputs and Multiple Outputs.
IEEE Trans. Inf. Theory, 2011

Average Number of Recirculations in SDL Constructions of Optical Priority Queues.
IEEE Commun. Lett., 2011

Maximizing throughput in wireless networks with finite internal buffers.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

A general probabilistic framework for detecting community structure in networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Emulation of an Optical Flexible Delay Line by Parallel Variable Optical Delay Lines.
IEEE Commun. Lett., 2010

Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions
CoRR, 2010

Prototype design and implementation of a load-balanced Birkhoff-von Neumann switch.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2010), May 30, 2010

Twister Networks and Their Applications to Load-Balanced Switches.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

A Bit-Stuffing Algorithm for Crosstalk Avoidance in High Speed Switching.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Using Banyan Networks for Load-Balanced Switches with Incremental Update.
Proceedings of IEEE International Conference on Communications, 2010

2009
CR switch: a load-balanced switch with contention and reservation.
IEEE/ACM Trans. Netw., 2009

Optimal constructions of fault tolerant optical linear compressors and linear decompressors.
IEEE Trans. Commun., 2009

Generalized dynamic frame sizing algorithm for finite-internal-buffered networks.
IEEE Commun. Lett., 2009

Emulation and Approximation of a Flexible Delay Line by Parallel Non-Overtaking Delay Lines.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

A Dynamic Frame Sizing Algorithm for CICQ Switches with 100% Throughput.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

SDL Constructions of FIFO, LIFO and Absolute Contractors.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets.
IEEE Trans. Commun., 2008

Queueing Analysis of Loss Systems with Variable Optical Delay Lines.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

On Constructions of Optical Queues with a Limited Number of Recirculations.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines.
IEEE Trans. Inf. Theory, 2007

A simple proof for the constructions of optical priority queues.
Queueing Syst. Theory Appl., 2007

Using a Single Switch with O(M) Inputs/Outputs for the Construction of an Optical Priority Queue with O(M<sup>3</sup>) Buffer.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Constructions of Fault Tolerant Linear Compressors and Linear Decompressors.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Constructions of Multicast Flexible Delay Lines and Optical Multicast Switches with 100% Throughput.
Proceedings of the Global Communications Conference, 2007

2006
Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches.
IEEE/ACM Trans. Netw., 2006

A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines.
IEEE Trans. Inf. Theory, 2006

Constructions of optical FIFO queues.
IEEE Trans. Inf. Theory, 2006

From switching theory to "queueing" theory.
SIGMETRICS Perform. Evaluation Rev., 2006

Using switched delay lines for exact emulation of FIFO multiplexers with variable length bursts.
IEEE J. Sel. Areas Commun., 2006

Multistage Constructions of Linear Compressors, Non-Overtaking Delay Lines, and Flexible Delay Lines.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005
On the throughput of multicasting with incremental forward error correction.
IEEE Trans. Inf. Theory, 2005

PC co-chair's message.
Perform. Evaluation, 2005

Quasi-circuit switching and quasi-circuit switches.
Proceedings of the ITRE 2005, 2005

Optimal load-balancing.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Generalization of the Pollaczek-Khinchin formula for throughput analysis of input-buffered switches.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Design a simple and high performance switch using a two-stage architecture.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

2004
A bandwidth sharing theory for a large number of HTTP-like connections.
IEEE/ACM Trans. Netw., 2004

Recursive construction of FIFO optical multiplexers with switched delay lines.
IEEE Trans. Inf. Theory, 2004

Mailbox Switch: A Scalable Two-stage Switch Architecture for Conflict Resolution of Ordered Packets.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2002
A min, + system theory for constrained traffic regulation and dynamic service guarantees.
IEEE/ACM Trans. Netw., 2002

Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering.
Comput. Commun., 2002

Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering.
Comput. Commun., 2002

Cost analysis of optical networks with dynamic setup and release of λ-channels.
Proceedings of the Global Telecommunications Conference, 2002

2001
A novel scheme using the information of departure processes for delay guarantees of distributed VBR traffic.
IEEE/ACM Trans. Netw., 2001

Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services.
IEEE Trans. Commun., 2001

A general framework for deterministic service guarantees in telecommunication networks with variable length packets.
IEEE Trans. Autom. Control., 2001

Load balanced Birkhoff-von Neumann switches with resequencing.
SIGMETRICS Perform. Evaluation Rev., 2001

Large deviation analysis for multiplexing independent regulated inputs.
SIGMETRICS Perform. Evaluation Rev., 2001

Performance guarantees in communication networks.
Eur. Trans. Telecommun., 2001

On the performance of multiplexing independent regulated inputs.
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

2000
Birkhoff-von Neumann Input Buffered Crossbar Switches.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Performance Guarantees in Communication Networks
Telecommunication Networks and Computer Systems, Springer, ISBN: 978-1-4471-0459-9, 2000

1999
A Time Varying Filtering Theory for Constrained Traffic Regulation and Dynamic Service Guarantees.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Deterministic Traffic Specification via Projections under the Min-Plus Algebra.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998
On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering.
IEEE Trans. Inf. Theory, 1998

Matrix extensions of the filtering theory for deterministic traffic regulation and service guarantees.
IEEE J. Sel. Areas Commun., 1998

PGPS servers with time-varying capacities.
IEEE Commun. Lett., 1998

1997
Guaranteed Quality-of-Service Wireless Access to ATM Networks.
IEEE J. Sel. Areas Commun., 1997

Large Deviations for Large Capacity Loss Networks with Fixed Routing and Polyhedral Admission Sets.
Discret. Event Dyn. Syst., 1997

A Filtering Theory for Deterministic Traffic Regulation.
Proceedings of the Proceedings IEEE INFOCOM '97, 1997

1996
On the exponentiality of stochastic linear systems under the max-plus algebra.
IEEE Trans. Autom. Control., 1996

Resampling for wireless access.
Proceedings of the 7th IEEE International Symposium on Personal, 1996

Experiments of the Theory of Effective Bandwidth for Markov Sources and Video Trades.
Proceedings of the Proceedings IEEE INFOCOM '96, 1996

1995
Fast Simulation of Packet Loss Rates in a Shared Buffer Communications Switch.
ACM Trans. Model. Comput. Simul., 1995

Sample path large deviations and intree networks.
Queueing Syst. Theory Appl., 1995

Effective Bandwith in High-Speed Digital Networks.
IEEE J. Sel. Areas Commun., 1995

Smoothing Point Processes as a Means to Increase Throughput.
Oper. Res., 1995

Effective Bandwidths of Departure Processes from Queues with Time Varying Capacities.
Proceedings of the Proceedings IEEE INFOCOM '95, 1995

Computable Exponential Bounds for Intree Networks with Routing.
Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994
Stability, queue length, and delay of deterministic and stochastic queueing networks.
IEEE Trans. Autom. Control., 1994

On the stability of open networks: A unified approach by stochastic dominance.
Queueing Syst. Theory Appl., 1994

Optimal Task Scheduling on Distributed Parallel Processors.
Perform. Evaluation, 1994

Effective Bandwidth and Fast Simulation of ATM Intree Networks.
Perform. Evaluation, 1994

Huffman algebras for independent random variables.
Discret. Event Dyn. Syst., 1994

1993
Effective bandwidths for multiclass Markov fluids and other ATM sources.
IEEE/ACM Trans. Netw., 1993

Rearrangement, Majorization and Stochastic Scheduling.
Math. Oper. Res., 1993


  Loading...