Kian-Lee Tan

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Shuigeng Zhou

> Home > Persons > Kian-Lee Tan

Publications

2005
[j60]
- view
  authority control:
- export record
  dblp key:
  - journals/ijhpcn/CaiZQXTZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijhpcn/CaiZQXTZ05
Wenyuan Cai, Shuigeng Zhou, Weining Qian, Linhao Xu, Kian-Lee Tan, Aoying Zhou:
C²: a new overlay network based on CAN and Chord. Int. J. High Perform. Comput. Netw. 3(4): 248-261 (2005)
[c116]
- view
  authority control:
- export record
  dblp key:
  - conf/dexaw/ZhaoZTZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dexaw/ZhaoZTZ05
Keping Zhao, Shuigeng Zhou, Kian-Lee Tan, Aoying Zhou:
Supporting Ranked Join in Peer-to-Peer Networks. DEXA Workshops 2005: 796-800
2003
[j42]
- view
  authority control:
- export record
  dblp key:
  - journals/jcst/ZhouQZLXNOT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcst/ZhouQZLXNOT03
Aoying Zhou, Weining Qian, Shuigeng Zhou, Bo Ling, Linhao Xu, Wee Siong Ng, Beng Chin Ooi, Kian-Lee Tan:
Data Management in Peer-to-Peer Environment: A Perspective of BestPeer. J. Comput. Sci. Technol. 18(4): 452-461 (2003)
[c72]
- view
  authority control:
- export record
  dblp key:
  - conf/waim/QianZRZOT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waim/QianZRZOT03
Weining Qian, Shuigeng Zhou, Yi Ren, Aoying Zhou, Beng Chin Ooi, Kian-Lee Tan:
Dynamic Clustering-Based Query Answering in Peer-to-Peer Systems. WAIM 2003: 306-313

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.