Weimin Chen

According to our database, Weimin Chen authored at least 11 papers between 1994 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2001

New Algorithm for Ordered Tree-to-Tree Correction Problem.

Weimin Chen

J. Algorithms, 2001

2000

Multi-subsequence searching.

Weimin Chen

Inf. Process. Lett., 2000

1999

On Regular Tree Embeddings.

Weimin Chen, Volker Turau

SIAM J. Comput., 1999

1998

More Efficient Algorithm for Ordered Tree Inclusion.

Weimin Chen

J. Algorithms, 1998

1997

Efficient Querying on Gnomic Databases by Using Metric Space Indexing Techniques.

Weimin Chen, Karl Aberer

Proceedings of the Eighth International Workshop on Database and Expert Systems Applications, 1997

1996

Efficient multiple dispatching based on automata.

Weimin Chen

PhD thesis, 1996

Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS.

Weimin Chen, Karl Aberer

Proceedings of the Atti del Quarto Convegno Nazionale su Sistemi Evoluti per Basi di Dati (4th National Conference on Advanced Database Systems), 1996

1995

Multiple-Dispatching Based on Automata.

Weimin Chen, Volker Turau

Theory Pract. Object Syst., 1995

1994

GLB-Closures in Directed Acyclic Graphs and Their Applications.

Volker Turau, Weimin Chen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Efficient Dynamic Look-Up Strategy for Multi-Methods.

Weimin Chen, Volker Turau, Wolfgang Klas

Proceedings of the Object-Oriented Programming, Proceedings of the 8th European Conference, 1994

An Optimized Implementation for VML Based on Pattern Matching and Dynamic Programming.

Weimin Chen, Volker Turau

Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), Gaithersburg, Maryland, USA, November 29, 1994