default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZheng Sun 0002
Person information
- affiliation: Google Inc., Mountain View, CA, USA
- affiliation: Hong Kong Baptist University, Department of Computer Science, Hong Kong
- affiliation (PhD 2003): Duke University, Department of Computer Science, Durham, NC, USA
Other persons with the same name
- Zheng Sun — disambiguation page
- Zheng Sun 0001
![[0000-0002-5671-936X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5671-936X")
— Tokyo Institute of Technology, Department of Electrical and Electronic Engineering, Tokyo, Japan - Zheng Sun 0003 — Carnegie Mellon University, Department of Electrical and Computer Engineering, Pittsburgh, PA, USA (and 1 more)
- Zheng Sun 0004 — University of Alabama, Department of Mathematics, Tuscaloosa, AL, USA (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j13]Xiang-Yang Li, Zheng Sun, Weizhao Wang, Wei Lou:
Cost sharing and strategyproof mechanisms for set cover games. J. Comb. Optim. 20(3): 259-284 (2010)- [j12]Xiang-Yang Li, Zheng Sun, Weizhao Wang, Xiaowen Chu, Shaojie Tang, Ping Xu:
Mechanism design for set cover games with selfish element agents. Theor. Comput. Sci. 411(1): 174-187 (2010)
2000 – 2009
- 2008
- [j11]Weizhao Wang, Xiang-Yang Li, Yu Wang, Zheng Sun:
Designing Multicast Protocols for Non-Cooperative Networks. IEEE J. Sel. Areas Commun. 26(7): 1238-1249 (2008) - 2007
- [j10]Zheng Sun, John H. Reif:
On Robotic Optimal Path Planning in Polygonal Regions With Pseudo-Euclidean Metrics. IEEE Trans. Syst. Man Cybern. Part B 37(4): 925-936 (2007) - 2006
- [j9]Zheng Sun, Tian-Ming Bu:
On discretization methods for approximating optimal paths in regions with direction-dependent costs. Inf. Process. Lett. 97(4): 146-152 (2006) - [j8]Zheng Sun, John H. Reif:
On finding approximate optimal paths in weighted regions. J. Algorithms 58(1): 1-32 (2006) - [j7]Weizhao Wang, Xiang-Yang Li, Zheng Sun:
Design differentiated service multicast with selfish agents. IEEE J. Sel. Areas Commun. 24(5): 1061-1073 (2006) - [j6]John H. Reif, Zheng Sun:
On boundaries of highly visible spaces and applications. Theor. Comput. Sci. 354(3): 379-390 (2006) - 2005
- [j5]Zheng Sun, John H. Reif:
On finding energy-minimizing paths on terrains. IEEE Trans. Robotics 21(1): 102-114 (2005) - [j4]Zheng Sun, David Hsu, Tingting Jiang, Hanna Kurniawati, John H. Reif:
Narrow passage sampling for probabilistic roadmap planning. IEEE Trans. Robotics 21(6): 1105-1115 (2005) - [c17]Weizhao Wang, Xiang-Yang Li, Zheng Sun:
Design DiffServ Multicast with Selfish Agents. AAIM 2005: 214-223 - [c16]Zheng Sun, Xiang-Yang Li, Weizhao Wang, Xiaowen Chu:
Mechanism Design for Set Cover Games When Elements Are Agents. AAIM 2005: 360-369 - [c15]Weizhao Wang, Xiang-Yang Li, Zheng Sun:
Share the Multicast Payment Fairly. COCOON 2005: 210-219 - [c14]Weizhao Wang, Xiang-Yang Li, Zheng Sun, Yu Wang:
Design multicast protocols for non-cooperative networks. INFOCOM 2005: 1596-1607 - [c13]Tian-Ming Bu, Zhen-Jian Li, Zheng Sun:
Adaptive and relaxed visibility-based PRM. ROBIO 2005: 174-179 - [c12]Zheng Sun, Tian-Ming Bu, Li-fen Zhang:
On discretization methods for generalized weighted region shortest path problems. ROBIO 2005: 180-185 - [c11]Zheng Sun, Philip S. Yu, Xiang-Yang Li:
Iterative Mining for Rules with Constrained Antecedents. SDM 2005: 551-555 - [c10]Xiang-Yang Li, Zheng Sun, Weizhao Wang:
Cost Sharing and Strategyproof Mechanisms for Set Cover Games. STACS 2005: 218-230 - 2004
- [j3]John H. Reif, Zheng Sun:
Movement Planning in the Presence of Flows. Algorithmica 39(2): 127-153 (2004) - [c9]Zheng Sun:
Randomized sampling with fixed and dynamic space decomposition methods. RAM 2004: 124-129 - 2003
- [j2]John H. Reif, Zheng Sun:
On Frictional Mechanical Systems and Their Computational Power. SIAM J. Comput. 32(6): 1449-1474 (2003) - [c8]Zheng Sun, John H. Reif:
Adaptive and Compact Discretization for Weighted Region Optimal Path Finding. FCT 2003: 258-270 - [c7]John H. Reif, Zheng Sun:
On Boundaries of Highly Visible Spaces and Applications. FCT 2003: 271-283 - [c6]Zheng Sun, John H. Reif:
On energy-minimizing paths on terrains for a mobile robot. ICRA 2003: 3782-3788 - [c5]David Hsu, Tingting Jiang, John H. Reif, Zheng Sun:
The bridge test for sampling narrow passages with probabilistic roadmap planners. ICRA 2003: 4420-4426 - 2002
- [j1]Charu C. Aggarwal, Zheng Sun, Philip S. Yu:
Fast Algorithms for Online Generation of Profile Association Rules. IEEE Trans. Knowl. Data Eng. 14(5): 1017-1028 (2002) - 2001
- [c4]Zheng Sun, John H. Reif:
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. ISAAC 2001: 160-171 - [c3]John H. Reif, Zheng Sun:
Movement Planning in the Presence of Flows. WADS 2001: 450-461
1990 – 1999
- 1998
- [c2]Charu C. Aggarwal, Zheng Sun, Philip S. Yu:
Online Algorithms for Finding Profile Association Rules. CIKM 1998: 86-95 - [c1]Charu C. Aggarwal, Zheng Sun, Philip S. Yu:
Online Generation of Profile Association Rules. KDD 1998: 129-133
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-14 02:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
