Dr Tse Siu Hong Savio
Designation: Assistant Professor
Faculty / Institute / Centre : Faculty of Information and Communication Technology
Department / Unit: Department of Computer Science
Telephone No: +605-4688888 ext 4781
Fax: +605-4661672
Email Address: tsesh@utar.edu.my
Qualification: Doctor of Philosophy, University of Hong Kong ( Computer Science )
Bachelor of Science (Hons), University of Hong Kong ( Physics )
Postgraduate Certificate, University of Hong Kong ( Education )

Journal Publications

S.S.H. Tse, "Belated Analyses of Three Credit-Based Adaptive Polling Algorithms", International Journal of Foundations of Computer Science, Volume 27, No. 5, 2016, 579-594.

Orhan Dagdeviren, Kayhan Erciyes, and Savio Tse, "Semi-asynchronous and distributed weighted connected dominating set algorithms for wireless sensor networks" Computer Standards & Interfaces, Volume 42, November 2015, Pages 143-156.

S.S.H. Tse, "Online Balancing Two Independent Criteria upon Placements and Deletions", IEEE Transactions on Parallel and Distributed Systems, vol. 24, No. 8, August 2013, 1644-1650.

S.S.H. Tse, "Online Bounds on Balancing Two Independent Criteria with Replication and Reallocation", IEEE Transactions on Computers, vol. 61, No. 11, November 2012, 1601-1610.

S.S.H. Tse, "Online Bicriteria Load Balancing using Object Reallocation", IEEE Transactions on Parallel and Distributed Systems, vol. 20, No. 3, March 2009, 379-388.

Y. Shi, F.C.M. Lau, S.S.H. Tse, Z.H. Du, R.C. Tang, and S.L. Li, "Club Theory of the Grid", Concurrency and Computation: Practice and Experience, vol. 18, Issue 14, December 2006, 1759-1773.

S.S.H. Tse, "A short note on the Lower Bound of Dilation for O(log n)-label Interval Routing", Information Processing Letters, vol. 95, Issue 2, July 2005, 351-353.

S.S.H. Tse, "Approximate Algorithms for Document Placement in Distributed Web Servers", IEEE Transactions on Parallel and Distributed Systems, vol. 16, No. 6, June 2005, 489-496.

S.S.H. Tse and F.C.M. Lau, "New Bounds for Multi-Label Interval Routing", Theoretical Computer Science, Vol. 310, No. 1-3, 2004, 61-77.

F.C.M. Lau, P.K.W. Cheng and S.S.H. Tse, "An Algorithm for the 2-Median Problem on Two-Dimensional Meshes", The Computer Journal, vol. 44, No. 2, 2001, 101-108.

S.S.H. Tse and F.C.M. Lau, "On the Complexity of Some Adaptive Polling Algorithms in General Networks", International Journal of Foundations of Computer Science (Special Issue on Graph Algorithms and Applications), vol. 10, No. 2, 1999, 211-224.

S.S.H. Tse and F.C.M. Lau, "On the Space Requirement of Interval Routing", IEEE Transactions on Computers, vol. 48, No. 7, July 1999, 752-757.

S.S.H. Tse and F.C.M. Lau, "More on the Efficiency of Interval Routing", The Computer Journal , vol. 41, No. 4, 1998, 238-242.

S.S.H. Tse and F.C.M. Lau, "A Lower Bound for Interval Routing in General Networks", Networks, Vol. 29, No. 1, January 1997, 49-53.

Conference Papers after joining UTAR

S.S.H. Tse and M.C. Low, "Online Searching for 3-Dimensional Data in Sublinear Time", The 3rd International Conference on Electrical, Communication and Computer Engineering (ICECCE 2021), Kuala Lumpur, Malaysia, June 2021.

S.S.H. Tse and W.L. Chang, "Testing the Factorial Function for Large Numbers", The 2nd International Conference on Electrical, Communication and Computer Engineering (ICECCE 2020), Istanbul, Turkey, June 2020.

S.S.H. Tse, "Bicriteria Load Balancing for Online Placement in Heterogeneous Servers with Extreme Upper Bounds", The 14th International Symposium on Parallel and Distributed Processing with Applications (IEEE-ISPA-16), TianJin, China, August 2016.

Short Biography

Savio Tse graduated in 1997. After that, he had been a visiting assistant professor/guest lecturer for three years in The University of Hong Kong, and a lecturer in Polytechnic University for three years. During 2005-2014, he lived in Turkey and worked as an Assistant Professor in Bilkent University, Izmir University, and Istanbul University.  He has joined UTAR since 2015, and continues his career.  His research areas are around approximate, online, and distributed, algorithms, in the context of load balancing, and networks.