Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Tung-Wei Kuo
Observed name:
Kuo, Tung-Wei
Institution:
National Chengchi University
Observed institutions:
National Tsing Hua University,
Research Center for Information Technology Innovation, Academia Sinica,
Academia Sinica,
National Chengchi University
ORCID:
0000-0002-2518-4462
Observed ORCID:
0000-0002-2518-4462
OpenAlex ID:
A5039779896
Deploying Chains of Virtual Network Functions: On the Relation Between Link and Server Usage
2018
·
Tung-Wei Kuo
, Bang-Heng Liou
, et al.
·
IEEE/ACM Transactions on Networking
·
182
Deploying chains of virtual network functions: On the relation between link and server usage
2016
·
Tung-Wei Kuo
, Bang-Heng Liou
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
180
Maximizing Submodular Set Function With Connectivity Constraint: Theory and Application to Networks
2014
·
Tung-Wei Kuo
, Kate Ching-Ju Lin
, et al.
·
IEEE/ACM Transactions on Networking
·
55
Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks
2014
·
Tung-Wei Kuo
, Kuang-Che Lee
, et al.
·
IEEE Transactions on Wireless Communications
·
35
PDF
Minimum Age TDMA Scheduling
2019
·
Tung-Wei Kuo
·
IEEE Conference on Computer Communications (INFOCOM)
·
27
PDF
Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results
2020
·
Tung-Wei Kuo
·
IEEE Transactions on Information Theory
·
13
MSig-BFT: A Witness-Based Consensus Algorithm for Private Blockchains
2018
·
Chun-Wei Chen
, Jian-Wei Su
, et al.
·
IEEE International Conference on Parallel and Distributed Systems (ICPADS)
·
11
Maximizing submodular set function with connectivity constraint: Theory and application to networks
2013
·
Tung-Wei Kuo
, Kate Ching-Ju Lin
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
11
On the approximability and hardness of the minimum connected dominating set with routing cost constraint
2019
·
Tung-Wei Kuo
·
Theoretical Computer Science
·
7
Optimistic Fast Rerouting
2022
·
Hai-Khun Tan
, Tung-Wei Kuo
·
International Conference on Communications
·
6
Beam Configuration and Client Association for Access Points with Switched Beam Antennas
2015
·
Kate Ching-Ju Lin
, Tung-Wei Kuo
, et al.
·
IEEE Transactions on Mobile Computing
·
6
Better Clients, Less Conflicts: Hyperledger Fabric Conflict Avoidance
2024
·
Bing-Jie Ji
, Tung-Wei Kuo
·
IEEE International Conference on Blockchain and Cryptocurrency (ICBC)
·
4
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
2025
·
Tung-Wei Kuo
·
Lecture notes in computer science
·
2
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
2024
·
Kuo, Tung-Wei
·
arXiv (Cornell University)
·
2
PDF
Competitive Analyses of Online Minimum Age of Information Transmission Scheduling
2022
·
Tung-Wei Kuo
·
IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
·
2
Fair VNF Provisioning in NFV Clusters via Node Labeling
2020
·
Tzu-Wen Chang
, Tung-Wei Kuo
, et al.
·
Globecom
·
2
No Need for Recovery: A Simple Two-Step Byzantine Consensus
2019
·
Kuo, Tung-Wei
, Chen, Kung
·
arXiv (Cornell University)
·
1
PDF
A Deterministic O(log m)-Competitive Algorithm for Online Minimum Cost Bipartite Matching with Delays
2026
·
Kuo, Tung-Wei
·
arXiv (Cornell University)
PDF
Minimizing $$\ell _2$$ norm of flow time by starvation mitigation
2026
·
Tung-Wei Kuo
·
Acta Informatica
PDF
Online age of information scheduling: The power of packet management and fairness
2026
·
Chen-Rui Jien
, Tung-Wei Kuo
·
Computer Networks
Amortized Cost in Graph Reordering: Why BFS Ordering Deserves More Attention
2025
·
Shang-Lin Li
, Tung-Wei Kuo
·
International Conference on Scalable Scientific Data Management (SSDBM)
Minimizing $$\ell _2$$ Norm of Flow Time by Starvation Mitigation
2025
·
Tung-Wei Kuo
·
Lecture notes in computer science
Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information
2023
·
Chen-Rui Jien
, Tung-Wei Kuo
·
Lecture notes in computer science
On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
2019
·
Tung-Wei Kuo
·
Lecture notes in computer science
無線センサネットワークにおける最小エネルギーコストを持つデータ集約木の構成について:NP完全性および近似アルゴリズム【Powered by NICT】
2016
·
Tung-Wei Kuo
, Lin Kate Ching-Ju
, et al.
·
IEEE Transactions on Computers
Show more works
View as search
Works count:
25
Citation count:
546
H-index:
8
I10-index:
8
Year
Topic
Type
