Jiazhen Cai

	1995
12		William Bouma, Ioannis Fudos, Christoph M. Hoffmann, Jiazhen Cai, Robert Paige: Geometric constraint solver. Computer-Aided Design 27(6): 487-501 (1995)
11		Jiazhen Cai, Robert Paige: Using Multiset Discrimination to Solve Language Processing Problems Without Hashing. Theor. Comput. Sci. 145(1&2): 189-228 (1995)
	1993
10		Jiazhen Cai, Robert Paige: Towards Increased Productivity of Algorithm Implementation. SIGSOFT FSE 1993: 71-78
9		Jiazhen Cai, Xiaofeng Han, Robert Endre Tarjan: An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem. SIAM J. Comput. 22(6): 1142-1162 (1993)
8		Jiazhen Cai: Counting Embeddings of Planar Graphs Using DFS Trees. SIAM J. Discrete Math. 6(3): 335-352 (1993)
7		Jiazhen Cai: Counting Embeddings of Planar Graphs Using DFS Trees. SIAM J. Discrete Math. 6(3): 335-352 (1993)
	1992
6		Jiazhen Cai, Robert Paige, Robert Endre Tarjan: More Efficient Bottom-Up Multi-Pattern Matching in Trees. Theor. Comput. Sci. 106(1): 21-60 (1992)
	1991
5		Jiazhen Cai, Robert Paige: Language Polynomial in the Input Plus Output. AMAST 1991: 287-300
4		Jiazhen Cai, Robert Paige: ``Look Ma, No Hashing, And No Arrays Neither''. POPL 1991: 143-154
	1990
3		Jiazhen Cai, Robert Paige, Robert Endre Tarjan: More Efficient Bottom-Up Tree Pattern Matching. CAAP 1990: 72-86
	1989
2		Jiazhen Cai, Robert Paige: Program Derivation by Fixed Point Computation. Sci. Comput. Program. 11(3): 197-261 (1989)
	1987
1		Jiazhen Cai, Robert Paige: Binding Performance at Language Design Time. POPL 1987: 85-97

Coauthor Index

1	William Bouma	[12]
2	Ioannis Fudos	[12]
3	Xiaofeng Han	[9]
4	Christoph M. Hoffmann	[12]
5	Robert Paige	[1] [2] [3] [4] [5] [6] [10] [11] [12]
6	Robert Endre Tarjan	[3] [6] [9]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page