Yangjun Chen

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the string matching with \(k\) mismatches Theoretical Computer Science	2018-04-16	Paper
An efficient method to evaluate intersections on big data sets Theoretical Computer Science	2016-09-01	Paper
On the cost of searching signature trees Information Processing Letters	2010-01-29	Paper
A new tree inclusion algorithm Information Processing Letters	2010-01-18	Paper
Signature files and signature trees. Information Processing Letters	2003-01-21	Paper
Arc consistency revisited Information Processing Letters	2002-07-25	Paper
scientific article; zbMATH DE number 1755625 (Why is no real title available?)	2002-06-16	Paper
On the graph traversal method for evaluating linear binary-chain programs Science in China. Series E	2001-03-07	Paper
scientific article; zbMATH DE number 1406216 (Why is no real title available?)	2000-02-24	Paper
scientific article; zbMATH DE number 1304662 (Why is no real title available?)	2000-01-25	Paper
OLDTNF-based evaluation method for handling recursive queries in deductive databases Science in China. Series E	1999-07-28	Paper
Graph traversal and top-down evaluation of logic queries Journal of Computer Science and Technology	1998-08-20	Paper
Magic sets revisited Journal of Computer Science and Technology	1998-02-16	Paper
Counting and topological order Journal of Computer Science and Technology	1998-01-14	Paper
scientific article; zbMATH DE number 993474 (Why is no real title available?)	1997-11-18	Paper
On the bottom-up evaluation of recursive queries	1996-01-01	Paper

Research outcomes over time

This page was built for person: Yangjun Chen