default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Chen 0003
Person information
- affiliation: Carleton University, School of Computer Science, Ottawa, Canada
Other persons with the same name
- Dan Chen — disambiguation page
- Dan Chen 0001
![[0000-0001-8118-4443]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-8118-4443")
— Wuhan University, School of Computer, China (and 4 more) - Dan Chen 0002 — Zhejiang University City College, Department of Computer Science and Technology, Hangzhou, China
- Dan Chen 0004 — Shenzhen University, Research Institute of Wuhan, China
- Dan Chen 0005 — University of Posts and Telecommunications, Key Laboratory of Universal Wireless Communications Ministry of Education Beijing, China (and 1 more)
- Dan Chen 0006 — Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j6]Dan Chen, Pat Morin:
Reprint of: Approximating majority depth. Comput. Geom. 49: 2-7 (2015)- 2013
- [j5]Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin:
Oja centers and centers of gravity. Comput. Geom. 46(2): 140-147 (2013) - [j4]Dan Chen, Pat Morin, Uli Wagner:
Absolute approximation of Tukey depth: Theory and experiments. Comput. Geom. 46(5): 566-573 (2013) - [j3]Dan Chen, Pat Morin:
Approximating majority depth. Comput. Geom. 46(9): 1059-1064 (2013) - 2012
- [j2]Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom. 45(4): 178-185 (2012) - [c3]Dan Chen, Pat Morin:
Approximating Majority Depth. CCCG 2012: 229-234 - [i3]Dan Chen, Pat Morin:
Approximating Majority Depth. CoRR abs/1205.1524 (2012) - 2011
- [c2]Dan Chen, Pat Morin:
Algorithms for Bivariate Majority Depth. CCCG 2011 - 2010
- [c1]Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin:
Oja medians and centers of gravity. CCCG 2010: 147-150
2000 – 2009
- 2009
- [i2]David Bremner, Dan Chen:
A Branch and Cut Algorithm for the Halfspace Depth Problem. CoRR abs/0910.1923 (2009) - [i1]Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal. CoRR abs/0911.2484 (2009) - 2008
- [j1]David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin:
Output-sensitive algorithms for Tukey depth and related problems. Stat. Comput. 18(3): 259-266 (2008)
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 2024-12-10 21:46 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:
