Liang Zhu

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 Weiwei Sun 0008

> Home > Persons > Liang Zhu

Publications

2015
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/isci/SunCZCZLH15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/isci/SunCZCZLH15
Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang:
Fast optimal aggregate point search for a merged set on road networks. Inf. Sci. 310: 52-68 (2015)
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/jcst/SunCZGJL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcst/SunCZGJL15
Weiwei Sun, Chunan Chen, Liang Zhu, Yunjun Gao, Yinan Jing, Qing Li:
On Efficient Aggregate Nearest Neighbor Query Processing in Road Networks. J. Comput. Sci. Technol. 30(4): 781-798 (2015)
2013
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/cikm/SunCZCZLH13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cikm/SunCZCZLH13
Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang:
Merged aggregate nearest neighbor query processing in road networks. CIKM 2013: 2243-2248
2010
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/gis/ZhuJSML10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gis/ZhuJSML10
Liang Zhu, Yinan Jing, Weiwei Sun, Dingding Mao, Peng Liu:
Voronoi-based aggregate nearest neighbor query processing in road networks. GIS 2010: 518-521

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.