Yuan-Hsun Lo

Orcid: 0000-0001-5510-8842

According to our database1, Yuan-Hsun Lo authored at least 49 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Dynamic Random Access Without Observation Under Deadline-Constrained Periodic Traffic.
IEEE Trans. Veh. Technol., January, 2024

2023
Achieving Maximum Urgency-Dependent Throughput in Random Access.
IEEE Trans. Commun., November, 2023

Age of Information for Periodic Status Updates Under Sequence Based Scheduling.
IEEE Trans. Commun., October, 2023

Improving Age of Information in Large-Scale Energy Harvesting Networks.
Proceedings of the IEEE International Conference on Communications, 2023

Deterministic Grant-Free Access Based on the Chinese Remainder Theorem.
Proceedings of the IEEE International Conference on Communications, 2023

Deadline-Constrained Opportunistic Spectrum Access with Spectrum Handoff.
Proceedings of the IEEE Global Communications Conference, 2023

2022
Combining attention with spectrum to handle missing values on time series data without imputation.
Inf. Sci., 2022

Gamma-Positivity for a Refinement of Median Genocchi Numbers.
Electron. J. Comb., 2022

Signed Mahonian on parabolic quotients of colored permutation groups.
Adv. Appl. Math., 2022

2021
Multichannel Conflict-Avoiding Codes of Weights Three and Four.
IEEE Trans. Inf. Theory, 2021

Signed Euler-Mahonian identities.
Eur. J. Comb., 2021

New Results on Optimal Multichannel Conflict-Avoiding Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Achieving Zero-Packet-Loss Throughput 1 for a Collision Channel Without Feedback and With Arbitrary Time Offsets.
IEEE Trans. Inf. Theory, 2020

The undirected optical indices of complete m-ary trees.
Discret. Appl. Math., 2020

2019
New CRT sequence sets for a collision channel without feedback.
Wirel. Networks, 2019

Protocol Sequences for Asynchronous Multiple Access With Physical-Layer Network Coding.
IEEE Wirel. Commun. Lett., 2019

Achieving Maximum Reliability in Deadline-Constrained Random Access With Multiple-Packet Reception.
IEEE Trans. Veh. Technol., 2019

Generalized p-Persistent CSMA for Asynchronous Multiple-Packet Reception.
IEEE Trans. Commun., 2019

Optimal Multichannel Slotted ALOHA for Deadline-Constrained Unicast Systems.
IEEE Syst. J., 2019

2018
On Channel Hopping Sequences With Full Rendezvous Diversity for Cognitive Radio Networks.
IEEE Wirel. Commun. Lett., 2018

Coding-Based Slotted ALOHA for Broadcasting Multislot Messages With Delivery Deadline.
IEEE Trans. Veh. Technol., 2018

CRT Sequences With Applications to Collision Channels Allowing Successive Interference Cancellation.
IEEE Trans. Inf. Theory, 2018

Protocol Sequences With Carrier Sensing for Wireless Sensor Networks.
IEEE Internet Things J., 2018

On the number of rainbow spanning trees in edge-colored complete graphs.
Discret. Math., 2018

Forwarding and Optical Indices in an All-Optical BCube Network.
CoRR, 2018

Forwarding and Optical Indices in an All-Optical BCube Networks.
Proceedings of the 37th IEEE International Performance Computing and Communications Conference, 2018

2017
The Global Packing Number of a Fat-Tree Network.
IEEE Trans. Inf. Theory, 2017

Codes with the identifiable parent property for multimedia fingerprinting.
Des. Codes Cryptogr., 2017

Optimal Slotted ALOHA under Delivery Deadline Constraint for Multiple-Packet Reception.
CoRR, 2017

Protocol-sequence-based media-access control with successive interference cancellation (invited paper).
Proceedings of the 9th International Conference on Wireless Communications and Signal Processing, 2017

The zero-error capacity of a collision channel with successive interference cancellation.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Completely Irrepressible Sequences for Multiple-Packet Reception.
IEEE Trans. Veh. Technol., 2016

Protocol Sequences for the Multiple-Packet Reception Channel Without Feedback.
IEEE Trans. Commun., 2016

Optimal strongly conflict-avoiding codes of even length and weight three.
Des. Codes Cryptogr., 2016

Partially user-irrepressible sequence sets and conflict-avoiding codes.
Des. Codes Cryptogr., 2016

Channel Hopping Sequences for Maximizing Rendezvous Diversity in Cognitive Radio Networks.
CoRR, 2016

New User-Irrepressible Protocol Sequences.
CoRR, 2016

A hybrid wavelength reservation scheme for large-scale optical networks.
Proceedings of the 25th Wireless and Optical Communication Conference, 2016

2015
Weighted maximum matchings and optimal equi-difference conflict-avoiding codes.
Des. Codes Cryptogr., 2015

New bounds on 2-separable codes of length 2.
Des. Codes Cryptogr., 2015

The Global Packing Number for an Optical Network.
CoRR, 2015

Multicolored Isomorphic Spanning Trees in Complete Graphs.
Ars Comb., 2015

The sorting index on colored permutations and even-signed permutations.
Adv. Appl. Math., 2015

2014
Optimal conflict-avoiding codes of odd length and weight three.
Des. Codes Cryptogr., 2014

Protocol Sequences for Multiple-Packet Reception.
CoRR, 2014

Sign imbalances of snakes and valley-signed permutations.
Adv. Appl. Math., 2014

Protocol sequences for multiple-packet reception: Throughput invariance and user irrepressibility.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2009
Multicolored parallelisms of Hamiltonian cycles.
Discret. Math., 2009

2006
Multicolored Parallelisms of Isomorphic Spanning Trees.
SIAM J. Discret. Math., 2006


  Loading...