default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJin-Yi Cai
Jin-yi Cai
Refine list
refinements active!
zoomed in on 309 of 309 records
view refined list in
export refined list as
showing all 309 records
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2025
[j105]Yin Liu, Austen Z. Fan, Jin-Yi Cai:
Restricted holant dichotomy on domain sizes 3 and 4. Theor. Comput. Sci. 1023: 114931 (2025)- [i69]Young Wu, Yancheng Zhu, Jin-Yi Cai, Xiaojin Zhu:
The Battling Influencers Game: Nash Equilibria Structure of a Potential Game and Implications to Value Alignment. CoRR abs/2502.01127 (2025) - [i68]Jin-Yi Cai, Jin Soo Ihm:
Holant* Dichotomy on Domain Size 3: A Geometric Perspective. CoRR abs/2504.14074 (2025) - 2024
- [j104]Jin-Yi Cai, Ashwin Maran:
Counting Cycles on Planar Graphs in Subexponential Time. Algorithmica 86(2): 656-693 (2024) - [j103]Jin-Yi Cai:
Shor's algorithm does not factor large integers in the presence of noise. Sci. China Inf. Sci. 67(7) (2024) - [j102]Jin-Yi Cai, Daniel P. Szabo
:
Bounded Degree Nonnegative Counting CSP. ACM Trans. Comput. Theory 16(2): 5:1-5:18 (2024) - [j101]Jin-Yi Cai, Ben Young:
Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint. ACM Trans. Comput. Theory 16(3): 18:1-18:41 (2024) - [i67]Jin-Yi Cai, Jacob Kruse, Kenneth Mayer, Daniel P. Szabo:
A Uniformly Random Solution to Algorithmic Redistricting. CoRR abs/2402.13868 (2024) - [i66]Jin-Yi Cai, Ashwin Maran:
Polynomial and analytic methods for classifying complexity of planar graph homomorphisms. CoRR abs/2412.17122 (2024) - 2023
- [j100]Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, Michael Kowalczyk:
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory. Comput. Complex. 32(1): 4 (2023) - [j99]Jin-Yi Cai, Zhiguo Fu:
Complexity classification of the eight-vertex model. Inf. Comput. 293: 105064 (2023) - [j98]Artem Govorov, Jin-Yi Cai, Martin E. Dyer:
A dichotomy for bounded degree graph homomorphisms with nonnegative weights. J. Comput. Syst. Sci. 132: 1-15 (2023) - [j97]Jin-Yi Cai, Austen Z. Fan, Yin Liu:
Bipartite 3-regular counting problems with mixed signs. J. Comput. Syst. Sci. 135: 15-31 (2023) - [j96]Zhiguo Fu, Jin-Yi Cai:
Holographic Algorithms on Domains of General Size. Theory Comput. Syst. 67(3): 417-436 (2023) - [j95]Austen Z. Fan, Jin-Yi Cai:
Dichotomy result on 3-regular bipartite non-negative functions. Theor. Comput. Sci. 949: 113745 (2023) - [c126]Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski, Austen Z. Fan, Lukasz Janeczko, Andrzej Kaczmarczyk, Tomasz Was:
Properties of Position Matrices and Their Elections. AAAI 2023: 5507-5514 - [c125]Yin Liu, Austen Z. Fan, Jin-Yi Cai:
Restricted Holant Dichotomy on Domains 3 and 4. COCOA (2) 2023: 83-96 - [c124]Jin-Yi Cai, Ben Young:
Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint. ICALP 2023: 33:1-33:17 - [c123]Jin-Yi Cai, Ashwin Maran:
The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3. STOC 2023: 1285-1297 - [i65]Jin-Yi Cai, Ashwin Maran:
The complexity of counting planar graph homomorphisms of domain size 3. CoRR abs/2302.08570 (2023) - [i64]Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski, Austen Z. Fan, Lukasz Janeczko, Andrzej Kaczmarczyk, Tomasz Was:
Properties of Position Matrices and Their Elections. CoRR abs/2303.02538 (2023) - [i63]Jin-Yi Cai, Austen Z. Fan:
Planar 3-way Edge Perfect Matching Leads to A Holant Dichotomy. CoRR abs/2303.16705 (2023) - [i62]Jin-Yi Cai:
Shor's Algorithm Does Not Factor Large Integers in the Presence of Noise. CoRR abs/2306.10072 (2023) - [i61]Yin Liu, Austen Z. Fan, Jin-Yi Cai:
Restricted Holant Dichotomy on Domains 3 and 4. CoRR abs/2307.16078 (2023) - 2022
- [j94]Jin-Yi Cai, Artem Govorov:
Perfect matchings, rank of connection tensors and graph homomorphisms. Comb. Probab. Comput. 31(2): 268-303 (2022) - [j93]Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints. Theory Comput. Syst. 66(1): 143-308 (2022) - [j92]Jin-Yi Cai, Zhiguo Fu:
Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain. SIAM J. Comput. 51(2): 17-50 (2022) - [c122]Jin-Yi Cai, Ashwin Maran:
Counting Cycles on Planar Graphs in Subexponential Time. COCOON 2022: 268-279 - [c121]Jin-Yi Cai, Daniel P. Szabo:
Bounded Degree Nonnegative Counting CSP. MFCS 2022: 27:1-27:16 - [i60]Jin-Yi Cai, Ashwin Maran:
Counting Cycles on Planar Graphs in Subexponential Time. CoRR abs/2208.09948 (2022) - [i59]Jin-Yi Cai, Ben Young:
Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint. CoRR abs/2212.03335 (2022) - 2021
- [j91]Jin-Yi Cai, Artem Govorov:
The complexity of counting edge colorings for simple graphs. Theor. Comput. Sci. 889: 14-24 (2021) - [j90]Jin-yi Cai, Artem Govorov:
On a Theorem of Lovász that (&sdot, H) Determines the Isomorphism Type of H. ACM Trans. Comput. Theory 13(2): 11:1-11:25 (2021) - [c120]Austen Z. Fan, Jin-Yi Cai:
Dichotomy Result on 3-Regular Bipartite Non-negative Functions. CSR 2021: 102-115 - [c119]Jin-Yi Cai, Austen Z. Fan, Yin Liu:
Bipartite 3-Regular Counting Problems with Mixed Signs. FCT 2021: 135-148 - [c118]Jin-Yi Cai, Tianyu Liu:
An FPTAS for the square lattice six-vertex and eight-vertex models at low temperatures. SODA 2021: 1520-1534 - [c117]Jin-Yi Cai, Zhiguo Fu, Shuai Shao:
New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification. SODA 2021: 1535-1547 - [i58]Jin-Yi Cai, Austen Z. Fan, Yin Liu:
Bipartite 3-Regular Counting Problems with Mixed Signs. CoRR abs/2110.01173 (2021) - 2020
- [j89]Jin-Yi Cai, Zhiguo Fu, Shuai Shao:
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS. Inf. Comput. 275: 104589 (2020) - [j88]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Holant∗ Problems on the Boolean Domain. Theory Comput. Syst. 64(8): 1362-1391 (2020) - [c116]Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu:
Approximability of the Eight-Vertex Model. CCC 2020: 4:1-4:18 - [c115]Shuai Shao, Jin-Yi Cai:
A Dichotomy for Real Boolean Holant Problems. FOCS 2020: 1091-1102 - [c114]Jin-Yi Cai, Artem Govorov:
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs. FOCS 2020: 1103-1111 - [c113]Jin-Yi Cai, Zhiguo Fu, Shuai Shao:
From Holant to Quantum Entanglement and Back. ICALP 2020: 22:1-22:16 - [c112]Jin-Yi Cai, Tianyu Liu:
Counting Perfect Matchings and the Eight-Vertex Model. ICALP 2020: 23:1-23:18 - [c111]Artem Govorov, Jin-Yi Cai, Martin E. Dyer:
A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights. ICALP 2020: 66:1-66:18 - [c110]Jin-Yi Cai, Artem Govorov:
On a Theorem of Lovász that hom(⋅, H) Determines the Isomorphism Type of H. ITCS 2020: 17:1-17:15 - [i57]Artem Govorov, Jin-Yi Cai, Martin E. Dyer:
A dichotomy for bounded degree graph homomorphisms with nonnegative weights. CoRR abs/2002.02021 (2020) - [i56]Jin-Yi Cai, Zhiguo Fu, Shuai Shao:
From Holant to Quantum Entanglement and Back. CoRR abs/2004.05706 (2020) - [i55]Jin-Yi Cai, Artem Govorov:
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs. CoRR abs/2004.06620 (2020) - [i54]Shuai Shao, Jin-Yi Cai:
A Dichotomy for Real Boolean Holant Problems. CoRR abs/2005.07906 (2020) - [i53]Jin-Yi Cai, Artem Govorov:
The Complexity of Counting Edge Colorings for Simple Graphs. CoRR abs/2010.04910 (2020) - [i52]Jin-Yi Cai, Tianyu Liu:
FPRAS via MCMC where it mixes torpidly (and very little effort). CoRR abs/2010.05425 (2020) - [i51]Austen Z. Fan, Jin-Yi Cai:
Dichotomy Result on 3-Regular Bipartite Non-negative Functions. CoRR abs/2011.09110 (2020) - no results
2010 – 2019
- 2019
- [j87]Jin-Yi Cai, Xi Chen:
A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights. Comput. Complex. 28(3): 345-408 (2019) - [j86]Jin-Yi Cai, Michael Kowalczyk, Tyson Williams:
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy. ACM Trans. Comput. Theory 11(2): 7:1-7:26 (2019) - [c109]Jin-Yi Cai, Artem Govorov:
Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms. SODA 2019: 476-495 - [c108]Jin-Yi Cai, Tianyu Liu, Pinyan Lu:
Approximability of the Six-vertex Model. SODA 2019: 2248-2261 - [i50]Jin-Yi Cai, Zhiguo Fu, Shuai Shao:
Complexity of Counting Weighted Eulerian Orientations with ARS. CoRR abs/1904.02362 (2019) - [i49]Jin-Yi Cai, Tianyu Liu:
Counting perfect matchings and the eight-vertex model. CoRR abs/1904.10493 (2019) - [i48]Jin-Yi Cai, Artem Govorov:
Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms. CoRR abs/1909.03179 (2019) - [i47]Jin-Yi Cai, Artem Govorov:
On a Theorem of Lovász that hom(·, H) Determines the Isomorhphism Type of H. CoRR abs/1909.03693 (2019) - 2018
- [j85]Jin-Yi Cai, Heng Guo, Tyson Williams:
Holographic algorithms beyond matchgates. Inf. Comput. 259(1): 102-129 (2018) - [j84]Jin-Yi Cai, Zhiguo Fu, Mingji Xia:
Complexity classification of the six-vertex model. Inf. Comput. 259(Part): 130-141 (2018) - [j83]Jin-Yi Cai, Heng Guo, Tyson Williams:
Clifford gates in the Holant framework. Theor. Comput. Sci. 745: 163-171 (2018) - [c107]Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, Michael Kowalczyk:
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory. ITCS 2018: 2:1-2:22 - [c106]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Real Holantc Problems. SODA 2018: 1802-1821 - [i46]Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu:
Approximability of the Eight-vertex Model. CoRR abs/1811.03126 (2018) - 2017
- [j82]Jin-Yi Cai, Xi Chen:
Complexity of Counting CSP with Complex Weights. J. ACM 64(3): 19:1-19:39 (2017) - [j81]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. SIAM J. Comput. 46(3): 853-889 (2017) - [c105]Jin-Yi Cai, Zhiguo Fu:
Holographic algorithm with matchgates is universal for planar #CSP over boolean domain. STOC 2017: 842-855 - [i45]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Real Holantc Problems. CoRR abs/1702.02693 (2017) - [i44]Jin-Yi Cai, Zhiguo Fu, Mingji Xia:
Complexity Classification Of The Six-Vertex Model. CoRR abs/1702.02863 (2017) - [i43]Jin-Yi Cai, Zhiguo Fu:
Complexity Classification of the Eight-Vertex Model. CoRR abs/1702.07938 (2017) - [i42]Jin-Yi Cai, Zhiguo Fu, Shuai Shao:
A Complexity Trichotomy for the Six-Vertex Model. CoRR abs/1704.01657 (2017) - [i41]Jin-Yi Cai, Heng Guo, Tyson Williams:
Clifford Gates in the Holant Framework. CoRR abs/1705.00942 (2017) - [i40]Jin-Yi Cai, Tianyu Liu, Pinyan Lu:
Approximability of the Six-vertex Model. CoRR abs/1712.05880 (2017) - 2016
- [j80]Jin-Yi Cai, Pinyan Lu:
Erratum to: Signature Theory in Holographic Algorithms. Algorithmica 74(4): 1473-1476 (2016) - [j79]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda:
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82(5): 690-711 (2016) - [j78]Michael Kowalczyk, Jin-Yi Cai:
Holant Problems for 3-Regular Graphs with Complex Edge Functions. Theory Comput. Syst. 59(1): 133-158 (2016) - [j77]Jin-Yi Cai, Heng Guo, Tyson Williams:
A Complete Dichotomy Rises from the Capture of Vanishing Signatures. SIAM J. Comput. 45(5): 1671-1728 (2016) - [j76]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy. SIAM J. Comput. 45(6): 2177-2198 (2016) - [r3]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Complexity Dichotomies for Counting Graph Homomorphisms. Encyclopedia of Algorithms 2016: 366-369 - [r2]Jin-Yi Cai, Heng Guo, Tyson Williams:
Holant Problems. Encyclopedia of Algorithms 2016: 918-921 - [r1]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms. Encyclopedia of Algorithms 2016: 921-926 - [i39]Jin-Yi Cai, Zhiguo Fu:
Holographic Algorithm with Matchgates Is Universal for Planar $\#$CSP Over Boolean Domain. CoRR abs/1603.07046 (2016) - 2015
- [c104]Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
A Holant Dichotomy: Is the FKT Algorithm Universal? FOCS 2015: 1259-1276 - [i38]Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams:
A Holant Dichotomy: Is the FKT Algorithm Universal? CoRR abs/1505.02993 (2015) - 2014
- [j75]Jin-Yi Cai, Zhiguo Fu:
A collapse theorem for holographic algorithms with matchgates on domain size at most 4. Inf. Comput. 239: 149-169 (2014) - [j74]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
The complexity of complex weighted Boolean #CSP. J. Comput. Syst. Sci. 80(1): 217-236 (2014) - [j73]Jin-Yi Cai, Aaron Gorenstein:
Matchgates Revisited. Theory Comput. 10: 167-197 (2014) - [c103]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda:
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM 2014: 582-595 - [c102]Jin-Yi Cai, Heng Guo, Tyson Williams:
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems. FOCS 2014: 601-610 - [c101]Jin-Yi Cai, Heng Guo, Tyson Williams:
Holographic Algorithms Beyond Matchgates. ICALP (1) 2014: 271-282 - [i37]Jin-Yi Cai, Heng Guo, Tyson Williams:
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems. CoRR abs/1404.4020 (2014) - 2013
- [j72]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. SIAM J. Comput. 42(3): 924-1029 (2013) - [j71]Jin-Yi Cai, Michael Kowalczyk:
Partition functions on kk-regular graphs with {0, 1}{0, 1}-vertex assignments and real edge functions. Theor. Comput. Sci. 494: 63-74 (2013) - [j70]Byron J. Gao, Martin Ester, Hui Xiong, Jin-Yi Cai, Oliver Schulte:
The Minimum Consistent Subset Cover Problem: A Minimization View of Data Mining. IEEE Trans. Knowl. Data Eng. 25(3): 690-703 (2013) - [c100]Chen Zeng, Jin-Yi Cai, Pinyan Lu, Jeffrey F. Naughton:
On optimal differentially private mechanisms for count-range queries. ICDT 2013: 261-271 - [c99]Jin-Yi Cai:
Complexity Dichotomy for Counting Problems. LATA 2013: 1-11 - [c98]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Holant* Problems with Domain Size 3. SODA 2013: 1278-1295 - [c97]Jin-Yi Cai, Heng Guo, Tyson Williams:
A complete dichotomy rises from the capture of vanishing signatures: extended abstract. STOC 2013: 635-644 - [i36]Jin-Yi Cai, Aaron Gorenstein:
Matchgates Revisited. CoRR abs/1303.6729 (2013) - [i35]Jin-Yi Cai, Zhiguo Fu:
A Collapse Theorem for Holographic Algorithms with Matchgates on Domain Size at Most 4. CoRR abs/1305.1409 (2013) - [i34]Jin-Yi Cai, Heng Guo, Tyson Williams:
Holographic Algorithms Beyond Matchgates. CoRR abs/1307.7430 (2013) - [i33]Jin-Yi Cai, Leslie Ann Goldberg, Heng Guo, Mark Jerrum:
Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. CoRR abs/1311.4451 (2013) - [i32]Jin-Yi Cai, Aaron Gorenstein:
Matchgates Revisited. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j69]Jin-Yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holant c Problems. Algorithmica 64(3): 511-533 (2012) - [j68]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Holographic reduction, interpolation and hardness. Comput. Complex. 21(4): 573-604 (2012) - [j67]Chen Zeng, Jeffrey F. Naughton, Jin-Yi Cai:
On differentially private frequent itemset mining. Proc. VLDB Endow. 6(1): 25-36 (2012) - [j66]Jin-Yi Cai, Michael Kowalczyk:
Spin systems on k-regular graphs with complex edge functions. Theor. Comput. Sci. 461: 2-16 (2012) - [c96]Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu:
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. COCOA 2012: 336-347 - [c95]Jin-yi Cai, Michael Kowalczyk, Tyson Williams:
Gadgets and anti-gadgets leading to a complexity dichotomy. ITCS 2012: 452-467 - [c94]Jin-Yi Cai, Xi Chen:
Complexity of counting CSP with complex weights. STOC 2012: 909-920 - [c93]Zhiguo Fu, Jin-Yi Cai:
Holographic Algorithms on Domain Size k > 2. TAMC 2012: 346-359 - [i31]Jin-Yi Cai, Heng Guo, Tyson Williams:
A Complete Dichotomy Rises from the Capture of Vanishing Signatures. CoRR abs/1204.6445 (2012) - [i30]Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu:
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems. CoRR abs/1205.2934 (2012) - [i29]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Holant* Problems with a Function on Domain Size 3. CoRR abs/1207.2354 (2012) - 2011
- [j65]Jin-yi Cai, Pinyan Lu:
Signature Theory in Holographic Algorithms. Algorithmica 61(4): 779-816 (2011) - [j64]Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao:
Approximation and hardness results for label cut and related problems. J. Comb. Optim. 21(2): 192-208 (2011) - [j63]Jin-yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford:
Honeynet games: a game theoretic approach to defending network monitors. J. Comb. Optim. 22(3): 305-324 (2011) - [j62]Jin-yi Cai, Alan L. Selman:
Foreword. J. Comput. Syst. Sci. 77(1): 1-2 (2011) - [j61]Jin-yi Cai, Pinyan Lu:
Holographic algorithms: From art to science. J. Comput. Syst. Sci. 77(1): 41-61 (2011) - [j60]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Computational Complexity of Holant Problems. SIAM J. Comput. 40(4): 1101-1132 (2011) - [j59]Jin-yi Cai, Pinyan Lu, Mingji Xia:
A computational proof of complexity of some restricted counting problems. Theor. Comput. Sci. 412(23): 2468-2485 (2011) - [c92]Jin-yi Cai:
Progress in Complexity of Counting Problems. FAW-AAIM 2011: 1-3 - [c91]Jin-yi Cai, Xi Chen, Pinyan Lu:
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy. CCC 2011: 45-54 - [c90]Jin-yi Cai, Michael Kowalczyk:
Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities. COCOON 2011: 146-157 - [c89]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Holant* Problems of Boolean Domain. SODA 2011: 1714-1728 - [i28]Jin-yi Cai, Michael Kowalczyk, Tyson Williams:
Gadgets and Anti-gadgets Leading to a Complexity Dichotomy. CoRR abs/1108.3383 (2011) - [i27]Jin-yi Cai, Xi Chen:
Complexity of Counting CSP with Complex Weights. CoRR abs/1111.2384 (2011) - 2010
- [j58]Jin-yi Cai, Xi Chen, Dong Li:
Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristic. Comput. Complex. 19(1): 37-56 (2010) - [j57]Jin-yi Cai, Pinyan Lu:
On Symmetric Signatures in Holographic Algorithms. Theory Comput. Syst. 46(3): 398-415 (2010) - [j56]Jin-yi Cai, Pinyan Lu:
On blockwise symmetric signatures for matchgates. Theor. Comput. Sci. 411(4-5): 739-750 (2010) - [c88]Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu:
On Tractable Exponential Sums. FAW 2010: 148-159 - [c87]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP. FOCS 2010: 427-436 - [c86]Jin-yi Cai, Xi Chen:
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights. FOCS 2010: 437-446 - [c85]Jin-yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. ICALP (1) 2010: 275-286 - [c84]Jin-yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holantc Problems. ISAAC (1) 2010: 253-265 - [c83]Michael Kowalczyk, Jin-yi Cai:
Holant Problems for Regular Graphs with Complex Edge Functions. STACS 2010: 525-536 - [c82]Jin-yi Cai, Michael Kowalczyk:
A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions. TAMC 2010: 328-339 - [i26]Michael Kowalczyk, Jin-yi Cai:
Holant Problems for Regular Graphs with Complex Edge Functions. CoRR abs/1001.0464 (2010) - [i25]Jin-yi Cai, Sangxia Huang, Pinyan Lu:
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems. CoRR abs/1004.0803 (2010) - [i24]Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu:
On Tractable Exponential Sums. CoRR abs/1005.2632 (2010) - [i23]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. CoRR abs/1008.0683 (2010) - [i22]Jin-yi Cai, Xi Chen:
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights. CoRR abs/1008.0915 (2010) - [i21]Jin-yi Cai, Xi Chen, Pinyan Lu:
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy. CoRR abs/1012.5659 (2010) - no results
2000 – 2009
- 2009
- [j55]Eric Bach, Jin-Yi Cai:
A Novel Information Transmission Problem and its Optimal Solution. Commun. Inf. Syst. 9(2): 141-162 (2009) - [j54]Jin-yi Cai, S. Barry Cooper, Angsheng Li:
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC). Math. Struct. Comput. Sci. 19(1): 5-7 (2009) - [j53]Jin-yi Cai, Vinay Choudhary, Pinyan Lu:
On the Theory of Matchgate Computations. Theory Comput. Syst. 45(1): 108-132 (2009) - [j52]Jin-yi Cai, Pinyan Lu:
Holographic algorithms: The power of dimensionality resolved. Theor. Comput. Sci. 410(18): 1618-1628 (2009) - [c81]Jin-yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford:
An Attacker-Defender Game for Honeynets. COCOON 2009: 7-16 - [c80]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holant problems and counting CSP. STOC 2009: 715-724 - [c79]Jin-yi Cai, Pinyan Lu, Mingji Xia:
A Computational Proof of Complexity of Some Restricted Counting Problems. TAMC 2009: 138-149 - [c78]Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao:
Approximation and Hardness Results for Label Cut and Related Problems. TAMC 2009: 460-469 - [i20]Jin-yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. CoRR abs/0903.4728 (2009) - 2008
- [j51]Jin-yi Cai, Pinyan Lu:
Basis Collapse in Holographic Algorithms. Comput. Complex. 17(2): 254-281 (2008) - [j50]Jin-yi Cai:
Holographic algorithms: guest column. SIGACT News 39(2): 51-81 (2008) - [c77]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. FOCS 2008: 644-653 - [c76]Jin-yi Cai, Pinyan Lu:
Signature Theory in Holographic Algorithms. ISAAC 2008: 568-579 - [c75]Jin-yi Cai, Pinyan Lu:
Holographic algorithms with unsymmetric signatures. SODA 2008: 54-63 - [c74]Jin-yi Cai, Xi Chen, Dong Li:
A quadratic lower bound for the permanent and determinant problem over any characteristic != 2. STOC 2008: 491-498 - [i19]Jin-yi Cai, Pinyan Lu, Mingji Xia:
A Family of Counter Examples to an Approach to Graph Isomorphism. CoRR abs/0801.1766 (2008) - 2007
- [j49]Jin-yi Cai, Vinay Choudhary:
Some Results on Matchgates and Holographic Algorithms. Int. J. Softw. Informatics 1(1): 3-36 (2007) - [j48]Jin-yi Cai:
S2p is subset of ZPPNP. J. Comput. Syst. Sci. 73(1): 25-35 (2007) - [j47]Jin-yi Cai, Vinay Choudhary:
Valiant's Holant Theorem and matchgate tensors. Theor. Comput. Sci. 384(1): 22-32 (2007) - [c73]Jin-yi Cai, Pinyan Lu:
Bases Collapse in Holographic Algorithms. CCC 2007: 292-304 - [c72]Jin-yi Cai, Vinay Choudhary, Pinyan Lu:
On the Theory of Matchgate Computations. CCC 2007: 305-318 - [c71]Eric Bach, Jin-yi Cai:
A Novel Information Transmission Problem and Its Optimal Solution. FCT 2007: 64-75 - [c70]Jin-yi Cai, Pinyan Lu:
On Block-Wise Symmetric Signatures for Matchgates. FCT 2007: 187-198 - [c69]Jin-yi Cai, Pinyan Lu:
Holographic Algorithms: The Power of Dimensionality Resolved. ICALP 2007: 631-642 - [c68]Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Schulte, Hui Xiong:
The minimum consistent subset cover problem and its applications in data mining. KDD 2007: 310-319 - [c67]Jin-yi Cai, Pinyan Lu:
On Symmetric Signatures in Holographic Algorithms. STACS 2007: 429-440 - [c66]Jin-yi Cai, Pinyan Lu:
Holographic algorithms: from art to science. STOC 2007: 401-410 - [e5]Jin-yi Cai, S. Barry Cooper, Hong Zhu:
Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings. Lecture Notes in Computer Science 4484, Springer 2007, ISBN 978-3-540-72503-9 [contents] - [i18]Jin-yi Cai, Pinyan Lu:
Bases Collapse in Holographic Algorithms. Electron. Colloquium Comput. Complex. TR07 (2007) - [i17]Jin-yi Cai, Pinyan Lu:
On Block-wise Symmetric Signatures for Matchgates. Electron. Colloquium Comput. Complex. TR07 (2007) - [i16]Jin-yi Cai, Pinyan Lu:
Holographic Algorithms: The Power of Dimensionality Resolved. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j46]Jin-yi Cai, Osamu Watanabe:
Random Access to Advice Strings and Collapsing Results. Algorithmica 46(1): 43-57 (2006) - [j45]Jin-yi Cai, Venkatesan T. Chakaravarthy:
On zero error algorithms having oracle access to one query. J. Comb. Optim. 11(2): 189-202 (2006) - [j44]Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace. Theory Comput. Syst. 39(1): 189-208 (2006) - [c65]Jin-yi Cai, Vinay Choudhary:
Some Results on Matchgates and Holographic Algorithms. ICALP (1) 2006: 703-714 - [c64]Jin-yi Cai, Vinay Choudhary:
Valiant's Holant Theorem and Matchgate Tensors. TAMC 2006: 248-261 - [e4]Jin-yi Cai, S. Barry Cooper, Angsheng Li:
Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings. Lecture Notes in Computer Science 3959, Springer 2006, ISBN 3-540-34021-1 [contents] - [i15]Jin-yi Cai, Vinay Choudhary:
Some Results on Matchgates and Holographic Algorithms. Electron. Colloquium Comput. Complex. TR06 (2006) - [i14]Jin-yi Cai, Pinyan Lu:
On Symmetric Signatures in Holographic Algorithms. Electron. Colloquium Comput. Complex. TR06 (2006) - [i13]Jin-yi Cai, Pinyan Lu:
Holographic Algorithms: From Art to Science. Electron. Colloquium Comput. Complex. TR06 (2006) - [i12]Jin-yi Cai, Vinay Choudhary:
On the Theory of Matchgate Computations. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j43]Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara:
Competing provers yield improved Karp-Lipton collapse results. Inf. Comput. 198(1): 1-23 (2005) - [j42]Jin-yi Cai, Hong Zhu:
Progress in Computational Complexity Theory. J. Comput. Sci. Technol. 20(6): 735-750 (2005) - [c63]Jin-yi Cai, Venkatesan T. Chakaravarthy:
A Note on Zero Error Algorithms Having Oracle Access to One NP Query. COCOON 2005: 339-348 - [c62]Pinyan Lu, Jialin Zhang, Chung Keung Poon, Jin-yi Cai:
Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs. ISAAC 2005: 767-776 - [i11]Jin-yi Cai, Vinay Choudhary:
Valiant's Holant Theorem and Matchgate Tensors. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j41]Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta:
On Higher Arthur-Merlin Classes. Int. J. Found. Comput. Sci. 15(1): 3-19 (2004) - [j40]Jin-yi Cai, Osamu Watanabe:
Relativized collapsing between BPP and PH under stringent oracle access. Inf. Process. Lett. 90(3): 147-154 (2004) - [j39]Jin-yi Cai, Robert A. Threlfall:
A note on quadratic residuosity and UP. Inf. Process. Lett. 92(3): 127-131 (2004) - [j38]Jin-yi Cai, Osamu Watanabe:
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy. SIAM J. Comput. 33(4): 984-1009 (2004) - [c61]Zheng Huang, Lei Chen, Jin-yi Cai, Deborah S. Gross, David R. Musicant, Raghu Ramakrishnan, James J. Schauer, Stephen J. Wright:
Mass Spectrum Labeling: Theory and Practice. ICDM 2004: 122-129 - [c60]Jin-yi Cai, Osamu Watanabe:
Random Access to Advice Strings and Collapsing Results. ISAAC 2004: 209-220 - [c59]Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace. STACS 2004: 571-583 - 2003
- [j37]Jin-yi Cai:
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor. Discret. Appl. Math. 126(1): 9-31 (2003) - [j36]Jin-yi Cai:
Essentially Every Unimodular Matrix Defines an Expander. Theory Comput. Syst. 36(2): 105-135 (2003) - [j35]Jin-yi Cai, Eric Bach:
On testing for zero polynomials by a set of points with bounded precision. Theor. Comput. Sci. 296(1): 15-25 (2003) - [c58]Jin-yi Cai, Osamu Watanabe:
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results. COCOON 2003: 202-211 - [c57]Jin-yi Cai, Osamu Watanabe:
Stringent Relativization. FSTTCS 2003: 408-419 - [c56]Yuan Wang, David J. DeWitt, Jin-yi Cai:
X-Diff: An Effective Change Detection Algorithm for XML Documents. ICDE 2003: 519-530 - [c55]Micah Adler, Jin-yi Cai, Jonathan K. Shapiro, Donald F. Towsley:
Estimation of Congestion Price Using Probabilistic Packet Marking. INFOCOM 2003: 2068-2078 - [c54]Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara:
Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS 2003: 535-546 - 2002
- [c53]Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta:
On Higher Arthur-Merlin Classes. COCOON 2002: 18-27 - [c52]Jin-yi Cai:
On the Minimum Volume of a Perturbed Unit Cube. ISAAC 2002: 67-78 - 2001
- [c51]Jin-yi Cai, Eric Bach:
On Testing for Zero Polynomials by a Set of Points with Bounded Precision. COCOON 2001: 473-482 - [c50]Jin-yi Cai:
On the Average-Case Hardness of CVP. FOCS 2001: 308-317 - [c49]Jin-yi Cai:
Sp2 subseteq ZPPNP. FOCS 2001: 620-629 - [c48]Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton:
On the Complexity of Join Predicates. PODS 2001 - [i10]Jin-yi Cai:
Essentially every unimodular matrix defines an expander. Electron. Colloquium Comput. Complex. TR01 (2001) - [i9]Jin-yi Cai:
S_2p \subseteq ZPPNP. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j34]Jin-yi Cai, Ajay Nerurkar:
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. Inf. Process. Lett. 76(1-2): 61-66 (2000) - [j33]Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein:
The Complexity of the A B C Problem. SIAM J. Comput. 29(6): 1878-1888 (2000) - [j32]Jin-yi Cai, D. Sivakumar:
Resolution of Hartmanis' conjecture for NL-hard sparse sets. Theor. Comput. Sci. 240(2): 257-269 (2000) - [c47]Jin-yi Cai:
The Complexity of Some Lattice Problems. ANTS 2000: 1-32 - [c46]Jin-yi Cai:
Essentially Every Unimodular Matrix Defines and Expander. ISAAC 2000: 2-22 - [c45]Valentine Kabanets, Jin-yi Cai:
Circuit minimization problem. STOC 2000: 73-79 - no results
1990 – 1999
- 1999
- [j31]Jin-yi Cai, C. K. Wong:
Foreword. Algorithmica 23(4): 277 (1999) - [j30]Jin-yi Cai, Thomas W. Cusick:
A Lattice-Based Public-Key Cryptosystem. Inf. Comput. 151(1-2): 17-31 (1999) - [j29]Jin-yi Cai:
A Classification of the Probabilistic Polynomial Time Hierarchy Under Fault Tolerant Access to Oracle Classes. Inf. Process. Lett. 69(4): 167-174 (1999) - [j28]Jin-yi Cai, D. Sivakumar:
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis. J. Comput. Syst. Sci. 58(2): 280-296 (1999) - [j27]Jin-yi Cai, Ajay Nerurkar:
Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard under Randomized Reductions. J. Comput. Syst. Sci. 59(2): 221-239 (1999) - [j26]Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
Robust Reductions. Theory Comput. Syst. 32(6): 625-647 (1999) - [j25]Jin-yi Cai, Alan L. Selman:
Fine Separation of Average-Time Complexity Classes. SIAM J. Comput. 28(4): 1310-1325 (1999) - [c44]Jin-yi Cai:
Some Recent Progress on the Complexity of Lattice Problems. CCC 1999: 158- - [c43]Jin-yi Cai:
Applications of a New Transference Theorem to Ajtai's Connection Factor. CCC 1999: 205-214 - [c42]Jin-yi Cai:
A New Transference Theorem in the Geometry of Numbers. COCOON 1999: 113-122 - [c41]Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski:
On Routing in Circulant Graphs. COCOON 1999: 360-369 - [c40]Jin-yi Cai, Aduri Pavan, D. Sivakumar:
On the Hardness of Permanent. STACS 1999: 90-99 - [c39]Jin-yi Cai, Ajay Nerurkar, D. Sivakumar:
Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC 1999: 726-735 - [i8]Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
Robust Reductions. CoRR cs.CC/9906033 (1999) - [i7]Jin-yi Cai:
Some Recent Progress on the Complexity of Lattice Problems. Electron. Colloquium Comput. Complex. TR99 (1999) - [i6]Valentine Kabanets, Jin-yi Cai:
Circuit Minimization Problem. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j24]Jin-yi Cai, Pu Cai, Yixin Zhu:
On A Scheduling Problem of Time Deteriorating Jobs. J. Complex. 14(2): 190-209 (1998) - [j23]Pu Cai, Jin-yi Cai, Ashish V. Naik:
Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns. J. Comb. Optim. 1(4): 367-376 (1998) - [j22]Jin-yi Cai:
Frobenius's Degree Formula and Toda's Polynomials. Theory Comput. Syst. 31(1): 67-75 (1998) - [j21]Jin-yi Cai:
A Relation of Primal-Dual Lattices and the Complexity of Shortest Lattice Vector Problem. Theor. Comput. Sci. 207(1): 105-116 (1998) - [c38]Jin-yi Cai, Ajay Nerurkar:
Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions. CCC 1998: 46- - [c37]Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
Robust Reductions. COCOON 1998: 174-183 - [c36]Jin-yi Cai, Thomas W. Cusick:
A Lattice-Based Public-Key Cryptosystem. Selected Areas in Cryptography 1998: 219-233 - [i5]Jin-yi Cai:
A new transference theorem and applications to Ajtai's connection factor. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c35]Jin-yi Cai, D. Sivakumar:
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. COCOON 1997: 62-71 - [c34]Pu Cai, Jin-yi Cai:
On the 100% Rule of Sensivity Analzsis in Linear Programming. COCOON 1997: 460-469 - [c33]Jin-yi Cai, Ajay Nerurkar:
An Improved Worst-Case to Average-Case Connection for Lattice Problems. FOCS 1997: 468-477 - [c32]Jin-yi Cai, D. Sivakumar, Martin Strauss:
Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997: 595-604 - [i4]Jin-yi Cai, Ajay Nerurkar:
Approximating the SVP to within a factor (1 + 1/dimepsilon) is NP-hard under randomized reductions. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j20]Jin-yi Cai, Frederic Green, Thomas Thierauf:
On the Correlation of Symmetric Functions. Math. Syst. Theory 29(3): 245-258 (1996) - [j19]Jin-yi Cai, Zicheng Liu:
The Bounded Membership Problem of the Monoid SL_2(N). Math. Syst. Theory 29(6): 573-587 (1996) - [c31]László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks:
Multiplicative Equations over Commuting Matrices. SODA 1996: 498-507 - [c30]Jin-yi Cai, Ashish V. Naik, D. Sivakumar:
On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996: 307-318 - [c29]Jin-yi Cai, Alan L. Selman:
Fine Separation of Average Time Complexity Classes. STACS 1996: 331-343 - [e3]Steven Homer, Jin-Yi Cai:
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996. IEEE Computer Society 1996, ISBN 0-8186-7386-9 [contents] - [e2]Jin-yi Cai, C. K. Wong:
Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings. Lecture Notes in Computer Science 1090, Springer 1996, ISBN 3-540-61332-3 [contents] - 1995
- [j18]Jin-yi Cai, Suresh Chari:
On the Impossibility of Amplifying the Independence of Random Variables. Random Struct. Algorithms 7(4): 301-310 (1995) - [c28]Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. FOCS 1995: 26-35 - [c27]Jin-yi Cai, D. Sivakumar:
The Resolution of a Hartmanis Conjecture. FOCS 1995: 362-371 - [c26]Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar:
Communication Complexity of Key Agreement on Small Ranges. STACS 1995: 38-49 - [i3]Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. Electron. Colloquium Comput. Complex. TR95 (1995) - [i2]Jin-yi Cai, Alan L. Selman:
Average Time Complexity Classes. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j17]Jin-yi Cai:
Computing Jordan Normal Forms Exactly for Commuting Matrices in Polynomial Time. Int. J. Found. Comput. Sci. 5(3/4): 293-302 (1994) - [j16]Jin-yi Cai, Anne Condon, Richard J. Lipton:
PSPACE Is Provable by Two Provers in One Round. J. Comput. Syst. Sci. 48(1): 183-193 (1994) - [j15]Jin-yi Cai, Juris Hartmanis:
On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line. J. Comput. Syst. Sci. 49(3): 605-619 (1994) - [j14]Jin-yi Cai, Richard J. Lipton:
Subquadratic Simulations of Balanced Formulae by Branching Programs. SIAM J. Comput. 23(3): 563-572 (1994) - [c25]Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein:
The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices. FOCS 1994: 135-142 - [c24]Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu:
Efficient Average-Case Algorithms for the Modular Group. FOCS 1994: 143-152 - [c23]Jin-yi Cai, Michael D. Hirsch:
Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry. ISAAC 1994: 172-180 - [c22]Sigal Ar, Jin-yi Cai:
Reliable Benchmarks Using Numerical Instability. SODA 1994: 34-43 - [i1]Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu:
Efficient Average-Case Algorithms for the Modular Group. Electron. Colloquium Comput. Complex. TR94 (1994) - 1993
- [j13]Sandeep N. Bhatt, Jin-yi Cai:
Taking Random Walks to Grow Trees in Hypercubes. J. ACM 40(3): 741-764 (1993) - [c21]Jin-yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao:
Towards Uncheatable benchmarks. SCT 1993: 2-11 - [e1]Jin-Yi Cai:
Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 13, DIMACS/AMS 1993, ISBN 978-0-8218-6597-2 [contents] - 1992
- [j12]Jin-yi Cai, Martin Fürer, Neil Immerman:
An optimal lower bound on the number of variables for graph identification. Comb. 12(4): 389-410 (1992) - [j11]Jin-yi Cai, Anne Condon, Richard J. Lipton:
On Games of Incomplete Information. Theor. Comput. Sci. 103(1): 25-38 (1992) - [c20]Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc:
Promise Problems and Guarded Access to Unambiguous Computation. Complexity Theory: Current Research 1992: 101-146 - [c19]Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc:
Promise Problems and Access to Unambiguous Computation. MFCS 1992: 162-171 - [c18]Jin-yi Cai:
Parallel Computation Over Hyperbolic Groups. STOC 1992: 106-115 - 1991
- [j10]Jin-yi Cai, Merrick L. Furst:
PSPACE Survives Constant-Width Bottlenecks. Int. J. Found. Comput. Sci. 2(1): 67-76 (1991) - [j9]Jin-yi Cai, Lane A. Hemachandra:
A Note on Enumarative Counting. Inf. Process. Lett. 38(4): 215-219 (1991) - [c17]Jin-yi Cai, Anne Condon, Richard J. Lipton:
PSPACE Is Provable By Two Provers In One Round. SCT 1991: 110-115 - [c16]Jin-yi Cai:
Computations Over Infinite Groups. FCT 1991: 22-32 - 1990
- [j8]Jin-yi Cai:
A Note on the Determinant and Permanent Problem. Inf. Comput. 84(1): 119-127 (1990) - [j7]Jin-yi Cai:
Lower Bounds for Constant-Depth Circuits in the Presence of Help Bits. Inf. Process. Lett. 36(2): 79-83 (1990) - [j6]Jin-yi Cai, Lane A. Hemachandra:
On the Power of Parity Polynomial Time. Math. Syst. Theory 23(2): 95-106 (1990) - [c15]Jin-yi Cai, Anne Condon, Richard J. Lipton:
On Bounded Round Multi-Prover Interactive Proof Systems. SCT 1990: 45-54 - [c14]Jin-yi Cai, Anne Condon, Richard J. Lipton:
Playing Games of Incomplete Information. STACS 1990: 58-69 - no results
1980 – 1989
- 1989
- [j5]Jin-yi Cai, Lane A. Hemachandra:
Enumerative Counting Is Hard. Inf. Comput. 82(1): 34-44 (1989) - [j4]Jin-yi Cai:
With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy. J. Comput. Syst. Sci. 38(1): 68-85 (1989) - [j3]Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung:
The Boolean Hierarchy II: Applications. SIAM J. Comput. 18(1): 95-111 (1989) - [c13]Jin-yi Cai, Juris Hartmanis:
The Complexity Of The Real Line Is A Fractal. SCT 1989: 138-146 - [c12]Jin-yi Cai:
Lower Bounds for Constant Depth Circuits in the Presence of Help Bits. FOCS 1989: 532-537 - [c11]Jin-yi Cai, Richard J. Lipton:
Subquadratic Simulations of Circuits by Branching Programs. FOCS 1989: 568-573 - [c10]Jin-yi Cai, Martin Fürer, Neil Immerman:
An Optimal Lower Bound on the Number of Variables for Graph Identification. FOCS 1989: 612-617 - [c9]Jin-yi Cai, Lane A. Hemachandra:
On the Power of Parity Polynomial Time. STACS 1989: 229-239 - 1988
- [j2]Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung:
The Boolean Hierarchy I: Structural Properties. SIAM J. Comput. 17(6): 1232-1252 (1988) - [c8]Jin-Yi Cai, Lane A. Hemachandra:
Enumerative counting is hard. SCT 1988: 194-203 - [c7]Sandeep N. Bhatt, Jin-yi Cai:
Take a Walk, Grow a Tree (Preliminary Version). FOCS 1988: 469-478 - 1987
- [j1]Jin-yi Cai, Gabriele E. Meyer:
Graph Minimal Uncolorability is D^P-Complete. SIAM J. Comput. 16(2): 259-277 (1987) - [c6]Jin-Yi Cai, Merrick L. Furst:
PSPACE survives three-bit bottlenecks. SCT 1987: 94-102 - [c5]Jin-yi Cai, Gabriele E. Meyer:
On the Complexity of Graph Critical Uncolorability. ICALP 1987: 394-403 - [c4]Jin-yi Cai:
Probability One Separation of the Boolean Hierarchy. STACS 1987: 148-158 - 1986
- [b1]Jin-Yi Cai:
On Some Most Probable Separations of Complexity Classes. Cornell University, USA, 1986 - [c3]Jin-yi Cai:
With Probability One, A Random Oracle Separates PSPACE from the Polynomial- Time Hierarchy. SCT 1986: 104-104 - [c2]Jin-yi Cai, Lane A. Hemachandra:
The Boolean Hierarchy: Hardware over NP. SCT 1986: 105-124 - [c1]Jin-yi Cai:
With Probability One, A Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy. STOC 1986: 21-29 - no results
Coauthor Index
Lane A. Hemaspaandra
aka: Lane A. Hemachandra
aka: Lane A. Hemachandra
[j88] [c116] [c108] [c106] [i46] [j81] [i45] [i40] [j80] [j76] [r3] [r1] [j74] [j72] [c100] [c98] [j69] [j68] [c96] [i30] [i29] [j65] [j61] [j60] [j59] [c91] [c89] [j57] [j56] [c88] [c87] [c85] [c84] [i25] [i24] [i23] [i21] [j53] [j52] [c80] [c79] [i20] [j51] [c77] [c76] [c75] [i19] [c73] [c72] [c70] [c69] [c67] [c66] [i18] [i17] [i16] [i14] [i13] [c62]
no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
