default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLie-Quan Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j5]Xiaojuan Luo, Mark S. Shephard
, Lie-Quan Lee, Lixin Ge, Cho Ng:
Moving curved mesh adaptation for higher-order finite element simulations. Eng. Comput. 27(1): 41-50 (2011)- 2010
- [j4]Lie-Quan Lee, Arno Candel, Cho Ng, Kwok Ko:
On using moving windows in finite element time domain simulation for long accelerator structures. J. Comput. Phys. 229(24): 9235-9245 (2010)
2000 – 2009
- 2008
- [j3]Volkan Akcelik, Kwok Ko, Lie-Quan Lee, Zenghai Li, Cho-Kuen Ng, Liling Xiao:
Shape determination for deformed electromagnetic cavities. J. Comput. Phys. 227(3): 1722-1738 (2008) - [c9]Xiaojuan Luo, Mark S. Shephard, Lie-Quan Lee, Cho Ng, Lixin Ge:
Tracking Adaptive Moving Mesh Refinements in 3D Curved Domains for Large-Scale Higher Order Finite Element Simulations. IMR 2008: 585-601 - 2005
- [j2]Lie-Quan Lee, Andrew Lumsdaine:
Generic programming for high-performance scientific applications. Concurr. Pract. Exp. 17(7-8): 941-965 (2005) - [j1]Chao Yang, Weiguo Gao, Zhaojun Bai, Xiaoye S. Li, Lie-Quan Lee, Parry Husbands, Esmond G. Ng:
An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation. SIAM J. Sci. Comput. 27(3): 873-892 (2005) - 2004
- [c8]Lie-Quan Lee, Jeff Varner, Kwok Ko:
Parallel Extreme Pathway Computation for Metabolic Networks. CSB 2004: 636-639 - [c7]Lie-Quan Lee, Lixin Ge, Marc Kowalski, Zenghai Li, Cho-Kuen Ng, Gregory L. Schussman, Michael Wolf, Kwok Ko:
Solving Large Sparse Linear Systems in End-to-end Accelerator Structure Simulations. IPDPS 2004 - [c6]Chao Yang, Weiguo Gao, Zhaojun Bai, Xiaoye S. Li, Lie-Quan Lee, Parry Husbands, Esmond G. Ng:
Algebraic Sub-structuring for Electromagnetic Applications. PARA 2004: 364-373 - 2003
- [c5]Lie-Quan Lee, Andrew Lumsdaine:
The Generic Message Passing Framework. IPDPS 2003: 53 - 2002
- [b1]Jeremy G. Siek, Lie-Quan Lee, Andrew Lumsdaine:
The Boost Graph Library - User Guide and Reference Manual. C++ in-depth series, Pearson / Prentice Hall 2002, ISBN 978-0-201-72914-6, pp. I-XXIV, 1-321 - [c4]Sibylle Schupp, Douglas P. Gregor, B. Osman, David R. Musser, Jeremy G. Siek, Lie-Quan Lee, Andrew Lumsdaine:
Concept-Based Component Libraries and Optimizing Compilers. IPDPS 2002 - [c3]Lie-Quan Lee, Andrew Lumsdaine:
Generic programming for high performance scientific applications. Java Grande 2002: 112-121
1990 – 1999
- 1999
- [c2]Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine:
Generic Graph Algorithms for Sparse Matrix Ordering. ISCOPE 1999: 120-129 - [c1]Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine:
The Generic Graph Component Library. OOPSLA 1999: 399-414
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-10-07 21:18 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:
