Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKe Chen 0011
Person information
- affiliation: Penn State University, PA, USA
- affiliation (former): University of Wisconsin-Milwaukee, Department of Computer Science, WI, USA
Other persons with the same name
- Ke Chen — disambiguation page
- Ke Chen 0001
![[0000-0001-9457-9364]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9457-9364")
— University of Manchester, Department of Computer Science, Manchester, UK (and 1 more) - Ke Chen 0002 — University of Liverpool, UK
- Ke Chen 0003 — Tiangong University, formerly Tianjin Polytechnic University, School of Computer Science and Software Engineering, China (and 1 more)
- Ke Chen 0004 — South China University of Technology, School of Electronic and Information Engineering, Guangzhou, China (and 3 more)
- Ke Chen 0005 — Zhejiang University, Database Laboratory, China (and 1 more)
- Ke Chen 0006 — Google (and 1 more)
- Ke Chen 0007 — University Perpignan
- Ke Chen 0008 — Xihua University, School of Computer and Software Engineering, Chengdu, China
- Ke Chen 0009 — Shanghai University of Engineering Science, College of Electronic and Electrical Engineering, China
- Ke Chen 0012 — Huazhong University of Science and Technology, Department of Construction Management, Wuhan, China (and 1 more)
- Ke Chen 0013 — Huazhong University of Science and Technology, Tongji Medical College, Wuhan, China (and 1 more)
- Ke Chen 0014 — Huazhong University of Science and Technology, School of Electronic Information and Communications, Science and Technology on Multi-Spectral Information Processing Laboratory, Wuhan, China
- Ke Chen 0015 — Nanjing University, School of Electronic Science and Engineering, Nanjing, China
- Ke Chen 0016 — Dalian University of Technology, School of Optoelectronic Engineering and Instrumentation Science, Dalian, China
- Ke Chen 0017 — Beijing University of Chemical Technology, College of Mechanical and Electrical Engineering, Beijing, China
- Ke Chen 0018 — Northeastern University, Department of Electrical and Computer Engineering, Boston, MA, USA
- Ke Chen 0019 — University of Hong Kong, Sau Po Centre on Ageing, Hong Kong (and 2 more)
- Ke Chen 0020 — University of Notre Dame, IN, USA
- Ke Chen 0021 — University of California San Diego, Music Department, CREL, San Diego, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j8]Ke Chen, Mingfu Shao:
Locality-sensitive bucketing functions for the edit distance. Algorithms Mol. Biol. 18(1): 7 (2023)- 2021
- [j7]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. SIAM J. Discret. Math. 35(3): 1592-1614 (2021) - 2020
- [j6]Ke Chen, Adrian Dumitrescu:
On Wegner's inequality for axis-parallel rectangles. Discret. Math. 343(12): 112091 (2020) - [j5]Ke Chen, Adrian Dumitrescu:
On the longest spanning tree with neighborhoods. Discret. Math. Algorithms Appl. 12(5): 2050067:1-2050067:16 (2020) - [j4]Ke Chen, Adrian Dumitrescu:
Selection Algorithms with Small Groups. Int. J. Found. Comput. Sci. 31(3): 355-369 (2020) - 2015
- [j3]Tian Zhao, Chuanrong Zhang, Luc Anselin, Weidong Li, Ke Chen:
A parallel approach for improving Geo-SPARQL query performance. Int. J. Digit. Earth 8(5): 383-402 (2015) - [j2]Chuanrong Zhang, Tian Zhao, Luc Anselin, Weidong Li, Ke Chen:
A Map-Reduce based parallel approach for improving query performance in a geospatial semantic web for disaster response. Earth Sci. Informatics 8(3): 499-509 (2015) - [j1]Ke Chen, Adrian Dumitrescu:
Nonconvex cases for carpenter's rulers. Theor. Comput. Sci. 586: 12-25 (2015)
Conference and Workshop Papers
- 2023
- [c8]Leran Ma, Ke Chen, Mingfu Shao:
On the Maximal Independent Sets of k-mers with the Edit Distance. BCB 2023: 42:1-42:6 - 2022
- [c7]Ke Chen, Mingfu Shao:
Locality-Sensitive Bucketing Functions for the Edit Distance. WABI 2022: 22:1-22:14 - 2020
- [c6]Ke Chen, Adrian Dumitrescu:
Multiparty Selection. ISAAC 2020: 42:1-42:13 - 2019
- [c5]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. MFCS 2019: 56:1-56:14 - 2018
- [c4]Ke Chen, Adrian Dumitrescu:
On the Longest Spanning Tree with Neighborhoods. FAW 2018: 15-28 - 2015
- [c3]Ke Chen, Adrian Dumitrescu:
Select with Groups of 3 or 4. WADS 2015: 189-199 - 2014
- [c2]Ke Chen, Adrian Dumitrescu:
Nonconvex Cases for Carpenter's Rulers. FUN 2014: 89-99 - 2013
- [c1]Ke Chen, Adrian Dumitrescu, Anirban Ghosh:
On Fence Patrolling by Mobile Agents. CCCG 2013
Informal and Other Publications
- 2023
- [i6]Leran Ma, Ke Chen, Mingfu Shao:
On the Maximal Independent Sets of k-mers with the Edit Distance. CoRR abs/2303.10926 (2023) - 2022
- [i5]Ke Chen, Mingfu Shao:
Locality-sensitive bucketing functions for the edit distance. CoRR abs/2206.03097 (2022) - 2020
- [i4]Ke Chen, Adrian Dumitrescu:
Multiparty Selection. CoRR abs/2004.05548 (2020) - 2019
- [i3]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. CoRR abs/1906.10217 (2019) - 2017
- [i2]Ke Chen, Adrian Dumitrescu:
On the Longest Spanning Tree with Neighborhoods. CoRR abs/1712.03297 (2017) - 2014
- [i1]Ke Chen, Adrian Dumitrescu:
Select with Groups of $3$ or $4$ Takes Linear Time. CoRR abs/1409.3600 (2014)
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-04-21 17:36 CEST 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:
