#### Writes About:

#### Filter Results:

- Full text PDF available (105)

#### Publication Year

1986

2018

- This year (4)
- Last 5 years (32)
- Last 10 years (77)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jin-Yi Cai, Martin FÃ¼rer, Neil Immerman
- FOCS
- 1989

In this paper we show that Î©(n) variables are needed for first-order logic with counting to identify graphs on n vertices. The k-variable language with counting is equivalent to the (k âˆ’â€¦ (More)

- Yuan Wang, David J. DeWitt, Jin-Yi Cai
- ICDE
- 2003

XML has become the de facto standard format for web publishing and data transportation. Since online information changes frequently, being able to quickly detect changes in XML documents is importantâ€¦ (More)

- Chen Zeng, Jeffrey F. Naughton, Jin-Yi Cai
- PVLDB
- 2012

We consider differentially private frequent itemset mining. We begin by exploring the theoretical difficulty of simultaneously providing good utility and good privacy in this task. While our analysisâ€¦ (More)

- Jin-Yi Cai, Thomas Gundermann, +4 authors Gerd Wechsung
- SIAM J. Comput.
- 1988

- Jin-Yi Cai, Martin FÃ¼rer, Neil Immerman
- Combinatorica
- 1992

In this paper we show that (n) variables are needed for rst-order logic with counting to identify graphs on n vertices. The k-variable language with counting is equivalent to the (k ? 1)-dimensionalâ€¦ (More)

- Jin-Yi Cai, Ajay Nerurkar
- FOCS
- 1997

We improve a connection of the worst-case complexity and the average-case complexity of some well-known lattice problems. This fascinating connection wasJirst discovered by Ajtai [ I ] in 1996, Weâ€¦ (More)

- Jin-Yi Cai, Pinyan Lu, Mingji Xia
- STOC
- 2009

We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant Problems. Compared to counting Constrained Satisfaction Problems (CSP), it is aâ€¦ (More)

- Jin-Yi Cai
- STOC
- 1986

abstract We consider how much error a fixed depth Boolean circuit has to make for computing the parity function. We show that with an exponential bound of the form exp(n,t) on the size of theâ€¦ (More)

- Jin-Yi Cai, Lane A. Hemaspaandra
- Mathematical systems theory
- 1989

This paper proves that the complexity class âŠ•P, parity polynomial time [PZ], contains the class of languages accepted byNP machines with few accepting paths. Indeed, âŠ•P contains a broad class ofâ€¦ (More)

- Jin-Yi Cai
- 1992

In this paper we show that (n) variables are needed for rst-order logic with counting to identify graphs on n vertices. The k-variable language with counting is equivalent to the (k ? 1)-dimensionalâ€¦ (More)