An optimal lower bound on the number of variables for graph identifications JY Cai, M Fürer, N Immerman Combinatorica 12 (4), 389-410, 1992 | 670 | 1992 |

X-Diff: An effective change detection algorithm for XML documents Y Wang, DJ DeWitt, JY Cai Proceedings 19th international conference on data engineering (Cat. No …, 2003 | 626 | 2003 |

Decoupling control QG Wang Springer Science & Business Media, 2002 | 454* | 2002 |

The boolean hierarchy I: Structural properties JY Cai, T Gundermann, J Hartmanis, LA Hemachandra, V Sewelson, ... SIAM Journal on Computing 17 (6), 1232-1252, 1988 | 260 | 1988 |

Circuit minimization problem V Kabanets, JY Cai Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 189 | 2000 |

The boolean hierarchy II: Applications JY Cai, T Gundermann, J Hartmanis, LA Hemachandra, V Sewelson, ... SIAM Journal on Computing 18 (1), 95-111, 1989 | 147 | 1989 |

With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy JY Cai Proceedings of the eighteenth annual ACM symposium on Theory of computing, 21-29, 1986 | 143 | 1986 |

On differentially private frequent itemset mining C Zeng, JF Naughton, JY Cai The VLDB journal: very large data bases: a publication of the VLDB Endowment …, 2012 | 135 | 2012 |

Graph homomorphisms with complex values: A dichotomy theorem JY Cai, X Chen, P Lu SIAM Journal on Computing 42 (3), 924-1029, 2013 | 132 | 2013 |

Holographic algorithms: From art to science JY Cai, P Lu Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 128 | 2007 |

An improved worst-case to average-case connection for lattice problems JY Cai, AP Nerurkar Proceedings 38th Annual Symposium on Foundations of Computer Science, 468-477, 1997 | 123 | 1997 |

The cyclic coloring problem and estimation of sparse Hessian matrices TF Coleman, JY Cai SIAM Journal on Algebraic Discrete Methods 7 (2), 221-235, 1986 | 118 | 1986 |

On the power of parity polynomial time JY Cai, LA Hemachandra Mathematical Systems Theory 23, 95-106, 1990 | 114 | 1990 |

Approximating the SVP to within a factor (1-1/dim/sup/spl epsiv//) is NP-hard under randomized conditions JY Cai, A Nerurkar Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity …, 1998 | 113 | 1998 |

Holant problems and counting CSP JY Cai, P Lu, M Xia Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 110 | 2009 |

SP/2 (Reflex Subset (contained in or Equals)) ZPP/NP JY Cai Journal of Computer and System Sciences 73 (1), 25-35, 2007 | 100* | 2007 |

The Boolean hierarchy: hardware over NP J Cai, L Hemachandra Structure in Complexity Theory: Proceedings of the Conference held at the …, 2005 | 99 | 2005 |

Multiplicative equations over commuting matrices L Babai, R Beals, J Cai, G Ivanyos, EM Luks Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms …, 1996 | 88 | 1996 |

Enumerative counting is hard JY Cai, LA Hemachandra Information and Computation 82 (1), 34-44, 1989 | 82 | 1989 |

On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line JY Cai, J Hartmanis Journal of Computer and System Sciences 49 (3), 605-619, 1994 | 78 | 1994 |