Jiazhen Cai - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2023

What you can read is what you can't executeYong-Gang Li, Jiazhen Cai, Yu Bao, Yeh-Ching Chung. compsec, 132:103377, September 2023. [doi]

1995

Geometric constraint solverWilliam Bouma, Ioannis Fudos, Christoph M. Hoffmann, Jiazhen Cai, Robert Paige. cad, 27(6):487-501, 1995. [doi]

Using Multiset Discrimination to Solve Language Processing Problems Without HashingJiazhen Cai, Robert Paige. TCS, 145(1&2):189-228, 1995. [doi]

1993

Towards Increased Productivity of Algorithm ImplementationJiazhen Cai, Robert Paige. ESEC/FSE 1993: 71-78 [doi]

Counting Embeddings of Planar Graphs Using DFS TreesJiazhen Cai. siamdm, 6(3):335-352, 1993.

Counting Embeddings of Planar Graphs Using DFS TreesJiazhen Cai. siamdm, 6(3):335-352, 1993.

An O(m log n)-Time Algorithm for the Maximal Planar Subgraph ProblemJiazhen Cai, Xiaofeng Han, Robert Endre Tarjan. SICOMP, 22(6):1142-1162, 1993.

1992

More Efficient Bottom-Up Multi-Pattern Matching in TreesJiazhen Cai, Robert Paige, Robert Endre Tarjan. TCS, 106(1):21-60, 1992.

1991

Look Ma, No Hashing, And No Arrays Neither Jiazhen Cai, Robert Paige. POPL 1991: 143-154

Language Polynomial in the Input Plus OutputJiazhen Cai, Robert Paige. amast 1992: 287-300

1990

More Efficient Bottom-Up Tree Pattern MatchingJiazhen Cai, Robert Paige, Robert Endre Tarjan. caap 1990: 72-86

1989

Program Derivation by Fixed Point ComputationJiazhen Cai, Robert Paige. SCP, 11(3):197-261, 1989.

1987

Binding Performance at Language Design TimeJiazhen Cai, Robert Paige. POPL 1987: 85-97

Sign in or sign up to see more results.

runs on WebDSL