Tung-Wei Kuo

Orcid: 0000-0002-2518-4462

According to our database1, Tung-Wei Kuo authored at least 20 papers between 2012 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Amortized Cost in Graph Reordering: Why BFS Ordering Deserves More Attention.
Proceedings of the 37th International Conference on Scalable Scientific Data Management, 2025

Minimizing ℓ <sub>2</sub> Norm of Flow Time by Starvation Mitigation.
Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

2024
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line.
Proceedings of the Approximation and Online Algorithms - 22nd International Workshop, 2024

Better Clients, Less Conflicts: Hyperledger Fabric Conflict Avoidance.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2024

2023
Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information.
Proceedings of the Algorithmics of Wireless Networks - 19th International Symposium, 2023

2022
Competitive Analyses of Online Minimum Age of Information Transmission Scheduling.
Proceedings of the IEEE INFOCOM 2022, 2022

Optimistic Fast Rerouting.
Proceedings of the IEEE International Conference on Communications, 2022

2021
Online Starvation Mitigation to Balance Average Flow Time and Fairness.
CoRR, 2021

2020
Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results.
IEEE Trans. Inf. Theory, 2020

Fair VNF Provisioning in NFV Clusters via Node Labeling.
Proceedings of the IEEE Global Communications Conference, 2020

2019
No Need for Recovery: A Simple Two-Step Byzantine Consensus.
CoRR, 2019

Minimum Age TDMA Scheduling.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

2018
MSig-BFT: A Witness-Based Consensus Algorithm for Private Blockchains.
Proceedings of the 24th IEEE International Conference on Parallel and Distributed Systems, 2018

On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint.
Proceedings of the Algorithms for Sensor Systems, 2018

2016
Beam Configuration and Client Association for Access Points with Switched Beam Antennas.
IEEE Trans. Mob. Comput., 2016

On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms.
IEEE Trans. Computers, 2016

Deploying chains of virtual network functions: On the relation between link and server usage.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2014
Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks.
IEEE Trans. Wirel. Commun., 2014

2013
Maximizing submodular set function with connectivity constraint: Theory and application to networks.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012


  Loading...