Jin-yi Cai - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

ForewordJin-yi Cai, Alan L. Selman. jcss, 77(1):1-2, 2011. [doi]

A computational proof of complexity of some restricted counting problemsJin-yi Cai, Pinyan Lu, Mingji Xia. TCS, 412(23):2468-2485, 2011. [doi]

Dichotomy for Holant* Problems of Boolean DomainJin-yi Cai, Pinyan Lu, Mingji Xia. soda 2011: 1714-1728 [doi]

Computational Complexity of Holant ProblemsJin-yi Cai, Pinyan Lu, Mingji Xia. siamcomp, 40(4):1101-1132, 2011. [doi]

Progress in Complexity of Counting ProblemsJin-yi Cai. AAIM 2011: 1-3 [doi]

Holographic algorithms: From art to scienceJin-yi Cai, Pinyan Lu. jcss, 77(1):41-61, 2011. [doi]

Spin Systems on Graphs with Complex Edge Functions and Specified Degree RegularitiesJin-yi Cai, Michael Kowalczyk. cocoon 2011: 146-157 [doi]

Approximation and hardness results for label cut and related problemsPeng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao. jco, 21(2):192-208, 2011. [doi]

2010

On Symmetric Signatures in Holographic AlgorithmsJin-yi Cai, Pinyan Lu. mst, 46(3):398-415, 2010. [doi]

On blockwise symmetric signatures for matchgatesJin-yi Cai, Pinyan Lu. TCS, 411(4-5):739-750, 2010. [doi]

On Tractable Exponential SumsJin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu. faw 2010: 148-159 [doi]

Quadratic Lower Bound for Permanent Vs. Determinant in any CharacteristicJin-yi Cai, Xi Chen, Dong Li. cc, 19(1):37-56, 2010. [doi]

Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSPJin-yi Cai, Pinyan Lu, Mingji Xia. focs 2010: 427-436 [doi]

A Dichotomy for ::::k::::-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge FunctionsJin-yi Cai, Michael Kowalczyk. tamc 2010: 328-339 [doi]

A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative WeightsJin-yi Cai, Xi Chen. focs 2010: 437-446 [doi]

Graph Homomorphisms with Complex Values: A Dichotomy TheoremJin-yi Cai, Xi Chen, Pinyan Lu. icalp 2010: 275-286 [doi]

From Holant to #CSP and Back: Dichotomy for Holant:::::::c::::::: ProblemsJin-yi Cai, Sangxia Huang, Pinyan Lu. isaac 2010: 253-265 [doi]

Holant Problems for Regular Graphs with Complex Edge FunctionsMichael Kowalczyk, Jin-yi Cai. STACS 2010: 525-536 [doi]

2009

Holant problems and counting CSPJin-yi Cai, Pinyan Lu, Mingji Xia. stoc 2009: 715-724 [doi]

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC)Jin-yi Cai, S. Barry Cooper, Angsheng Li. mscs, 19(1):5-7, 2009. [doi]

A Computational Proof of Complexity of Some Restricted Counting ProblemsJin-yi Cai, Pinyan Lu, Mingji Xia. tamc 2009: 138-149 [doi]

Holographic algorithms: The power of dimensionality resolvedJin-yi Cai, Pinyan Lu. TCS, 410(18):1618-1628, 2009. [doi]

On the Theory of Matchgate ComputationsJin-yi Cai, Vinay Choudhary, Pinyan Lu. mst, 45(1):108-132, 2009. [doi]

An Attacker-Defender Game for HoneynetsJin-yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford. cocoon 2009: 7-16 [doi]

Approximation and Hardness Results for Label Cut and Related ProblemsPeng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao. tamc 2009: 460-469 [doi]

2008

2007

A Novel Information Transmission Problem and Its Optimal SolutionEric Bach, Jin-yi Cai. fct 2007: 64-75 [doi]

Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, ProceedingsJin-yi Cai, S. Barry Cooper, Hong Zhu, editors, Volume 4484 of Lecture Notes in Computer Science, Springer, 2007.

Holographic Algorithms: The Power of Dimensionality ResolvedJin-yi Cai, Pinyan Lu. icalp 2007: 631-642 [doi]

On the Theory of Matchgate ComputationsJin-yi Cai, Vinay Choudhary, Pinyan Lu. cocoon 2007: 305-318 [doi]

Bases Collapse in Holographic AlgorithmsJin-yi Cai, Pinyan Lu. cocoon 2007: 292-304 [doi]

On Block-Wise Symmetric Signatures for MatchgatesJin-yi Cai, Pinyan Lu. fct 2007: 187-198 [doi]

On Symmetric Signatures in Holographic AlgorithmsJin-yi Cai, Pinyan Lu. STACS 2007: 429-440 [doi]

Holographic Algorithms: The Power of Dimensionality ResolvedJin-yi Cai, Pinyan Lu. eccc, 14(020), 2007. [doi]

On Block-wise Symmetric Signatures for MatchgatesJin-yi Cai, Pinyan Lu. eccc, 14(019), 2007. [doi]

Bases Collapse in Holographic AlgorithmsJin-yi Cai, Pinyan Lu. eccc, 14(003), 2007. [doi]

Valiant s Holant Theorem and matchgate tensorsJin-yi Cai, Vinay Choudhary. TCS, 384(1):22-32, 2007. [doi]

S::2:::::p::: is subset of ZPP:::NP:::Jin-yi Cai. jcss, 73(1):25-35, 2007. [doi]

Holographic algorithms: from art to scienceJin-yi Cai, Pinyan Lu. stoc 2007: 401-410 [doi]

The minimum consistent subset cover problem and its applications in data miningByron J. Gao, Martin Ester, Jin-yi Cai, Oliver Schulte, Hui Xiong. kdd 2007: 310-319 [doi]

2006

Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, ProceedingsJin-yi Cai, S. Barry Cooper, Angsheng Li, editors, Volume 3959 of Lecture Notes in Computer Science, Springer, 2006.

Time-Space Tradeoff in Derandomizing Probabilistic LogspaceJin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek. mst, 39(1):189-208, 2006. [doi]

On the Theory of Matchgate ComputationsJin-yi Cai, Vinay Choudhary. eccc, (018), 2006. [doi]

On Symmetric Signatures in Holographic AlgorithmsJin-yi Cai, Pinyan Lu. eccc, 13(135), 2006. [doi]

Random Access to Advice Strings and Collapsing ResultsJin-yi Cai, Osamu Watanabe. algorithmica, 46(1):43-57, 2006. [doi]

On zero error algorithms having oracle access to one queryJin-yi Cai, Venkatesan T. Chakaravarthy. jco, 11(2):189-202, 2006. [doi]

Valiant s Holant Theorem and Matchgate TensorsJin-yi Cai, Vinay Choudhary. tamc 2006: 248-261 [doi]

Some Results on Matchgates and Holographic AlgorithmsJin-yi Cai, Vinay Choudhary. icalp 2006: 703-714 [doi]

Some Results on Matchgates and Holographic AlgorithmsJin-yi Cai, Vinay Choudhary. eccc, 13(048), 2006. [doi]

Holographic Algorithms: From Art to ScienceJin-yi Cai, Pinyan Lu. eccc, 13(145), 2006. [doi]

2005

2004

On Higher Arthur-Merlin ClassesJin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta. ijfcs, 15(1):3-19, 2004. [doi]

Time-Space Tradeoff in Derandomizing Probabilistic LogspaceJin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek. STACS 2004: 571-583 [doi]

Random Access to Advice Strings and Collapsing ResultsJin-yi Cai, Osamu Watanabe. isaac 2004: 209-220 [doi]

Relativized collapsing between BPP and PH under stringent oracle accessJin-yi Cai, Osamu Watanabe. ipl, 90(3):147-154, 2004. [doi]

A note on quadratic residuosity and UPJin-yi Cai, Robert A. Threlfall. ipl, 92(3):127-131, 2004. [doi]

On Proving Circuit Lower Bounds against the Polynomial-Time HierarchyJin-yi Cai, Osamu Watanabe. siamcomp, 33(4):984-1009, 2004. [doi]

Mass Spectrum Labeling: Theory and PracticeZheng Huang, Lei Chen 0003, Jin-yi Cai, Deborah S. Gross, David R. Musicant, Raghu Ramakrishnan, James J. Schauer, Stephen J. Wright. icdm 2004: 122-129 [doi]

2003

Estimation of Congestion Price Using Probabilistic Packet MarkingMicah Adler, Jin-yi Cai, Jonathan K. Shapiro, Donald F. Towsley. infocom 2003: [doi]

A new transference theorem in the geometry of numbers and new bounds for Ajtai s connection factorJin-yi Cai. DAM, 126(1):9-31, 2003.

Competing Provers Yield Improved Karp-Lipton Collapse ResultsJin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara. STACS 2003: 535-546 [doi]

Essentially Every Unimodular Matrix Defines an ExpanderJin-yi Cai. mst, 36(2):105-135, 2003. [doi]

Stringent RelativizationJin-yi Cai, Osamu Watanabe. fsttcs 2003: 408-419 [doi]

On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative ResultsJin-yi Cai, Osamu Watanabe. cocoon 2003: 202-211 [doi]

On testing for zero polynomials by a set of points with bounded precisionJin-yi Cai, Eric Bach. TCS, 296(1):15-25, 2003. [doi]

X-Diff: An Effective Change Detection Algorithm for XML DocumentsYuan Wang, David J. DeWitt, Jin-yi Cai. icde 2003: 519-530 [doi]

2002

On the Minimum Volume of a Perturbed Unit CubeJin-yi Cai. isaac 2002: 67-78 [doi]

On Higher Arthur-Merlin ClassesJin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta. cocoon 2002: 18-27 [doi]

2001

2000

1999

Robust ReductionsJin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung. mst, 32(6):625-647, 1999. [doi]

Approximating the SVP to within a Factor (1+1/dim:::xi:::) Is NP-Hard under Randomized ReductionsJin-yi Cai, Ajay Nerurkar. jcss, 59(2):221-239, 1999.

Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial TimeJin-yi Cai, Ajay Nerurkar, D. Sivakumar. stoc 1999: 726-735 [doi]

Some Recent Progress on the Complexity of Lattice ProblemsJin-yi Cai. cocoon 1999: 158 [doi]

Applications of a New Transference Theorem to Ajtai s Connection FactorJin-yi Cai. cocoon 1999: 205-214 [doi]

Some Recent Progress on the Complexity of Lattice ProblemsJin-yi Cai. eccc, 6(6), 1999. [doi]

Fine Separation of Average-Time Complexity ClassesJin-yi Cai, Alan L. Selman. siamcomp, 28(4):1310-1325, 1999.

On the Hardness of PermanentJin-yi Cai, Aduri Pavan, D. Sivakumar. STACS 1999: 90-99 [doi]

A New Transference Theorem in the Geometry of NumbersJin-yi Cai. cocoon 1999: 113-122 [doi]

Sparse Hard Sets for P: Resolution of a Conjecture of HartmanisJin-yi Cai, D. Sivakumar. jcss, 58(2):280-296, 1999.

Circuit Minimization ProblemValentine Kabanets, Jin-yi Cai. eccc, (45), 1999. [doi]

PreviousNext