Search the dblp DataBase
Jiazhen Cai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Jiazhen Cai, Robert Paige
Binding Performance at Language Design Time. [Citation Graph (3, 0)][DBLP]
POPL, 1987, pp:85-97 [Conf] - Jiazhen Cai, Robert Paige
Language Polynomial in the Input Plus Output. [Citation Graph (0, 0)][DBLP]
AMAST, 1991, pp:287-300 [Conf] - Jiazhen Cai, Robert Paige, Robert Endre Tarjan
More Efficient Bottom-Up Tree Pattern Matching. [Citation Graph (0, 0)][DBLP]
CAAP, 1990, pp:72-86 [Conf] - Jiazhen Cai, Robert Paige
``Look Ma, No Hashing, And No Arrays Neither''. [Citation Graph (0, 0)][DBLP]
POPL, 1991, pp:143-154 [Conf] - Jiazhen Cai, Robert Paige
Towards Increased Productivity of Algorithm Implementation. [Citation Graph (0, 0)][DBLP]
SIGSOFT FSE, 1993, pp:71-78 [Conf] - William Bouma, Ioannis Fudos, Christoph M. Hoffmann, Jiazhen Cai, Robert Paige
Geometric constraint solver. [Citation Graph (0, 0)][DBLP]
Computer-Aided Design, 1995, v:27, n:6, pp:487-501 [Journal] - Jiazhen Cai, Robert Paige
Program Derivation by Fixed Point Computation. [Citation Graph (0, 0)][DBLP]
Sci. Comput. Program., 1989, v:11, n:3, pp:197-261 [Journal] - Jiazhen Cai, Xiaofeng Han, Robert Endre Tarjan
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1993, v:22, n:6, pp:1142-1162 [Journal] - Jiazhen Cai
Counting Embeddings of Planar Graphs Using DFS Trees. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1993, v:6, n:3, pp:335-352 [Journal] - Jiazhen Cai
Counting Embeddings of Planar Graphs Using DFS Trees. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1993, v:6, n:3, pp:335-352 [Journal] - Jiazhen Cai, Robert Paige
Using Multiset Discrimination to Solve Language Processing Problems Without Hashing. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1995, v:145, n:1&2, pp:189-228 [Journal] - Jiazhen Cai, Robert Paige, Robert Endre Tarjan
More Efficient Bottom-Up Multi-Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1992, v:106, n:1, pp:21-60 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002