Kuan-Chou Lai

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 Ssu-Hsuan Lu

> Home > Persons > Kuan-Chou Lai

Publications

2014
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/jnca/LuLLC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jnca/LuLLC14
Ssu-Hsuan Lu, Kuan-Ching Li, Kuan-Chou Lai, Yeh-Ching Chung:
Effectiveness of a replica mechanism to improve availability with Arrangement Graph-Based Overlay. J. Netw. Comput. Appl. 41: 441-450 (2014)
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/ppna/LuLLC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ppna/LuLLC14
Ssu-Hsuan Lu, Kuan-Ching Li, Kuan-Chou Lai, Yeh-Ching Chung:
A scalable P2P overlay based on arrangement graph with minimized overhead. Peer-to-Peer Netw. Appl. 7(4): 497-510 (2014)
2013
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/music/LuLLC13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/music/LuLLC13
Ssu-Hsuan Lu, Kuan-Ching Li, Kuan-Chou Lai, Yeh-Ching Chung:
An Overlay Network Based on Arrangement Graph with Fault Tolerance. MUSIC 2013: 577-583
2011
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/globecom/LuLLC11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/globecom/LuLLC11
Ssu-Hsuan Lu, Kuan-Chou Lai, Kuan-Ching Li, Yeh-Ching Chung:
Design and analysis of arrangement graph-based overlay systems for information sharing. GLOBECOM Workshops 2011: 668-672

a service of

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.