Search the dblp DataBase
Savio S. H. Tse: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Savio S. H. Tse, Hong Va Leong
Mobile Data Management in Ad hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
AINA (2), 2004, pp:428-431 [Conf] - Savio S. H. Tse, Francis Chi-Moon Lau
An Approximation Solution for the 2-Median Problem on Two-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
AINA, 2005, pp:457-460 [Conf] - Savio S. H. Tse
Approximate Algorithms for Document Placement in Distributed Web Servers. [Citation Graph (0, 0)][DBLP]
ISPAN, 2004, pp:61-66 [Conf] - Savio S. H. Tse, Francis C. M. Lau
An Upper Bound Result for Multi-label Interval Routing on Planar Graphs. [Citation Graph (0, 0)][DBLP]
SIROCCO, 2002, pp:293-308 [Conf] - Savio S. H. Tse, Francis C. M. Lau
Lower Bounds for Multi-label Interval Routing. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1995, pp:123-134 [Conf] - Savio S. H. Tse, Francis C. M. Lau
An Optimal Lower Bound for Interval Routing in General Networks. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1997, pp:112-124 [Conf] - Savio S. H. Tse, Francis C. M. Lau
Adaptive broadcast-confirm algorithms in general networks and their analysis. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1998, pp:20-35 [Conf] - Savio S. H. Tse, Francis C. M. Lau
Some Results on the Space Requirement of Interval Routing. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1999, pp:264-279 [Conf] - Francis C. M. Lau, Philip K. W. Cheng, Savio S. H. Tse
An Algorithm for the 2-Median Problem on Two-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
Comput. J., 2001, v:44, n:2, pp:101-108 [Journal] - Savio S. H. Tse, Francis C. M. Lau
More on the Efficiency of Interval Routing. [Citation Graph (0, 0)][DBLP]
Comput. J., 1998, v:41, n:4, pp:238-242 [Journal] - Yao Shi, Francis Chi-Moon Lau, Savio S. H. Tse, Zhihui Du, Rui-Chun Tang, Sanli Li
Club theory of the Grid. [Citation Graph (0, 0)][DBLP]
Concurrency and Computation: Practice and Experience, 2006, v:18, n:14, pp:1759-1773 [Journal] - Savio S. H. Tse, Francis C. M. Lau
On the Complexity of Some Adaptive Polling Algorithms in General Networks. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:211-224 [Journal] - Savio S. H. Tse
A short note on the lower bound of dilation for O(logn)-label interval routing. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:95, n:2, pp:351-353 [Journal] - Savio S. H. Tse, Francis C. M. Lau
A lower bound for interval routing in general networks. [Citation Graph (0, 0)][DBLP]
Networks, 1997, v:29, n:1, pp:49-53 [Journal] - Savio S. H. Tse, Francis C. M. Lau
On the Space Requirement of Interval Routing. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1999, v:48, n:7, pp:752-757 [Journal] - Savio S. H. Tse, Francis C. M. Lau
New bounds for multi-label interval routing. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2004, v:310, n:1-3, pp:61-77 [Journal] - Savio S. H. Tse
Approximate Algorithms for Document Placement in Distributed Web Servers. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Parallel Distrib. Syst., 2005, v:16, n:6, pp:489-496 [Journal]
Online Balancing Two Independent Criteria. [Citation Graph (, )][DBLP]
Online solutions for scalable file server systems. [Citation Graph (, )][DBLP]
Search in 0.063secs, Finished in 0.064secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002