default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLin Chen 0001
Person information
- affiliation: Fundamental Research Laboratory, Los Angeles, CA, USA
- affiliation: Ohio State University, Columbus, OH, USA
Other persons with the same name
- Lin Chen — disambiguation page
- Lin Chen 0002
![[0000-0002-2605-749X]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-2605-749X")
— Sun Yat-sen (Zhongshan) University, China (and 3 more) - Lin Chen 0003 — Yale University, New Haven, Connecticut, USA (and 1 more)
- Lin Chen 0004 — Research Center Jülich, Germany
- Lin Chen 0005 — Xi'an Institute of Post & Telecommunications, China
- Lin Chen 0006 — University of Illinois at Chicago, Natural Language Processing Lab, Chicago, IL, USA
- Lin Chen 0007 — Elizabeth City State University, Department of Mathematics and Computer Science, Elizabeth City, NC, USA (and 1 more)
- Lin Chen 0008 — Ministry of Education, Hunan University, Changsha, China
- Lin Chen 0009 — Zhejiang University, Hangzhou, China (and 6 more)
- Lin Chen 0010 — Arizona State University, Tempe, AZ, USA
- Lin Chen 0012 — Queensland University of Technology, Brisbane, QLD, Australia
- Lin Chen 0013 — Nankai University, Center for Combinatorics and LPMC-TJKLC, Tianjin, China
- Lin Chen 0014 — Jiangxi University of Finance and Economics, School of Statistics, China (and 1 more)
- Lin Chen 0015 — Nanjing University, Department of Computer Science and Technology, State Key Laboratory for Novel Software Technology, China (and 1 more)
- Lin Chen 0016 — Guangxi University, Department of Mechatronics Engineering, College of Mechanical Engineering, Nanning, China (and 1 more)
- Lin Chen 0017 — China Meteorological Administration, National Satellite Meteorological Center, Beijing, China (and 1 more)
- Lin Chen 0018 — Chinese Academy of Sciences, Northeast Institute of Geography and Agroecology, Changchun, China (and 1 more)
- Lin Chen 0019 — Shanghai Jiao Tong University, Institute of Image Processing and Network Engineering, China
- Lin Chen 0020 — IBM China Research Lab, Beijing, China (and 1 more)
- Lin Chen 0021 — Wyze Labs, Inc., Kirkland, WA, USA (and 2 more)
- Lin Chen 0022 — Leipzig University, Germany
- Lin Chen 0023 — Chinese Academy of Sciences, Chongqing Institute of Green and Intelligent Technology, China (and 1 more)
- Lin Chen 0024 — University of Hanover, Hannover, Germany
- Lin Chen 0025 — University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j16]Lin Chen:
A selected tour of the theory of identification matrices. Theor. Comput. Sci. 240(2): 299-318 (2000)
1990 – 1999
- 1999
- [j15]Lin Chen:
Graph Isomorphism and Identification Matrices: Sequential Algorithms. J. Comput. Syst. Sci. 59(3): 450-475 (1999) - [j14]Selim G. Akl, Lin Chen:
On the Power of some Pram Models. Parallel Algorithms Appl. 13(4): 307-319 (1999) - [j13]Lin Chen, Julius Y. Jiang, Maung T. Nyeu:
Provably Fastest Parallel Algorithms for Bipartite Permutation Graphs. Parallel Process. Lett. 9(3): 385-390 (1999) - 1998
- [j12]Lin Chen:
Optimal Circular Arc Representations: Properties, Recognition, and Construction. J. Comput. Syst. Sci. 56(3): 320-331 (1998) - 1997
- [j11]Lin Chen:
Efficient Parallel Recognition of Some Circular Arc Graphs, II. Algorithmica 17(3): 266-280 (1997) - [j10]Lin Chen:
Optimal Bucket Sorting and Overlap Representations. Parallel Algorithms Appl. 10(3-4): 249-269 (1997) - [c13]Lin Chen:
A Selected Tour of the Theory of Identification Matrices. COCOON 1997: 222-231 - [c12]Lin Chen:
A Provably Fastest Parallel Algorithm for the Recognition of the Consecutive Ones Property with Selected Applications. ICPADS 1997: 594-601 - [c11]Lin Chen:
Optimal Computation of Shortest Paths on Doubly Convex Bipartite Graphs. ICPADS 1997: 618-623 - [c10]Lin Chen:
Tight Lower Bounds for Computing Shortest Paths on Proper Interval and Bipartite Permutation Graphs. PaCT 1997: 7-12 - 1996
- [j9]Lin Chen, René Schott:
Optimal Operations on Red-Black Trees. Int. J. Found. Comput. Sci. 7(3): 227-240 (1996) - [j8]Lin Chen:
Improving Space Efficiency for a Family of Operations. Inf. Sci. 95(1): 49-57 (1996) - [j7]Lin Chen:
Partitioning Graphs Into Hamiltonian Ones. Parallel Comput. 22(4): 607-618 (1996) - [j6]Lin Chen:
Graph Isomorphism and Identification Matrices: Parallel Algorithms. IEEE Trans. Parallel Distributed Syst. 7(3): 308-319 (1996) - [c9]Lin Chen:
Optimal overlap representations. ISPAN 1996: 8-14 - 1995
- [j5]Lin Chen:
Solving the Shortest-Paths Problem on Bipartite Permutation Graphs Efficiently. Inf. Process. Lett. 55(5): 259-264 (1995) - [c8]Lin Chen:
Optimal Circular Arc Representations. Euro-Par 1995: 255-266 - [c7]Selim G. Akl, Lin Chen:
Efficient Parallel Algorithms on Proper Circular Arc Graphs. PDPTA 1995: 71-80 - 1994
- [c6]Lin Chen:
Revisiting Circular Arc Graphs. ISAAC 1994: 559-566 - [c5]Lin Chen:
Parallel graph isomorphism detection with identification matrices. ISPAN 1994: 105-112 - 1993
- [j4]Lin Chen:
Efficient Parallel Recognition of Some Circular Arc Graphs, I. Algorithmica 9(3): 217-238 (1993) - [j3]Lin Chen, Yaacov Yesha:
Efficient parallel algorithms for bipartite permutation graphs. Networks 23(1): 29-39 (1993) - [c4]Lin Chen, René Schott:
Optimal Operations on Red-Black Trees. ICCI 1993: 529-533 - 1992
- [j2]Lin Chen:
Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals. Inf. Process. Lett. 42(4): 197-201 (1992) - 1991
- [j1]Lin Chen, Yaacov Yesha:
Parallel Recognition of the Consecutive Ones Property with Applications. J. Algorithms 12(3): 375-392 (1991) - [c3]Lin Chen:
Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs. ICCI 1991: 383-394 - 1990
- [c2]Lin Chen:
Efficient Deterministic Parallel Algorithms for Integer Sorting. ICCI 1990: 433-442
1980 – 1989
- 1989
- [c1]Lin Chen:
NC Algorithms for Circular-Arc Graphs. WADS 1989: 291-302
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-11-11 21:32 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:
