Lie-Quan Lee

According to our database1, Lie-Quan Lee authored at least 14 papers between 1999 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Moving curved mesh adaptation for higher-order finite element simulations.
Eng. Comput., 2011

2010
On using moving windows in finite element time domain simulation for long accelerator structures.
J. Comput. Phys., 2010

2008
Shape determination for deformed electromagnetic cavities.
J. Comput. Phys., 2008

Tracking Adaptive Moving Mesh Refinements in 3D Curved Domains for Large-Scale Higher Order Finite Element Simulations.
Proceedings of the 17th International Meshing Roundtable, 2008

2005
An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation.
SIAM J. Sci. Comput., 2005

Generic programming for high-performance scientific applications.
Concurr. Pract. Exp., 2005

2004
Algebraic Sub-structuring for Electromagnetic Applications.
Proceedings of the Applied Parallel Computing, 2004

Solving Large Sparse Linear Systems in End-to-end Accelerator Structure Simulations.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Parallel Extreme Pathway Computation for Metabolic Networks.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

2003
The Generic Message Passing Framework.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002
Concept-Based Component Libraries and Optimizing Compilers.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

The Boost Graph Library - User Guide and Reference Manual.
C++ in-depth series, Pearson / Prentice Hall, ISBN: 978-0-201-72914-6, 2002

1999
The Generic Graph Component Library.
Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1999

Generic Graph Algorithms for Sparse Matrix Ordering.
Proceedings of the Computing in Object-Oriented Parallel Environments, 1999


  Loading...