Dmitry Gavinsky

2008
23	EE	Dmitry Gavinsky, Pavel Pudlák: Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity. IEEE Conference on Computational Complexity 2008: 332-339
22	EE	Dmitry Gavinsky: Classical interaction cannot replace a quantum message. STOC 2008: 95-102
21	EE	Richard Cleve, Dmitry Gavinsky, D. L. Yonge-Mallo: Quantum Algorithms for Evaluating Min-MaxTrees. TQC 2008: 11-15
20	EE	Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf: Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM J. Comput. 38(5): 1695-1708 (2008)
2007
19	EE	Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf: Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC 2007: 516-525
18	EE	Dmitry Gavinsky: Classical Interaction Cannot Replace a Quantum Message CoRR abs/quant-ph/0703215: (2007)
17	EE	Dmitry Gavinsky: Classical Interaction Cannot Replace a Quantum Message. Electronic Colloquium on Computational Complexity (ECCC) 14(058): (2007)
16	EE	Dmitry Gavinsky, Pavel Pudlák: Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 14(074): (2007)
2006
15	EE	Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting. IEEE Conference on Computational Complexity 2006: 288-298
14	EE	Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-error quantum state identification and exponential separations in communication complexity. STOC 2006: 594-603
13	EE	Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting CoRR abs/quant-ph/0603173: (2006)
12	EE	Dmitry Gavinsky: On the Role of Shared Entanglement CoRR abs/quant-ph/0604052: (2006)
11	EE	Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function CoRR abs/quant-ph/0607174: (2006)
10	EE	Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. Electronic Colloquium on Computational Complexity (ECCC) 13(086): (2006)
2005
9	EE	Dmitry Gavinsky: A Note on Shared Randomness and Shared Entanglement in Communication CoRR abs/quant-ph/0505088: (2005)
8	EE	Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity CoRR abs/quant-ph/0511013: (2005)
2004
7	EE	Dmitry Gavinsky, Avi Owshanko: PExact = Exact Learning. COLT 2004: 200-209
6	EE	Dmitry Gavinsky, Julia Kempe, Ronald de Wolf: Quantum Communication Cannot Simulate a Public Coin CoRR quant-ph/0411051: (2004)
2003
5	EE	Dmitry Gavinsky: Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning. Journal of Machine Learning Research 4: 101-117 (2003)
2002
4	EE	Dmitry Gavinsky: Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning. ALT 2002: 98-112
3	EE	Nader H. Bshouty, Dmitry Gavinsky: PAC = PAExact and Other Equivalent Models in Learning. FOCS 2002: 167-176
2	EE	Nader H. Bshouty, Dmitry Gavinsky: On Boosting with Polynomially Bounded Distributions. Journal of Machine Learning Research 3: 483-506 (2002)
2001
1	EE	Nader H. Bshouty, Dmitry Gavinsky: On Boosting with Optimal Poly-Bounded Distributions. COLT/EuroCOLT 2001: 490-506

Coauthor Index

1	Nader H. Bshouty	[1] [2] [3]
2	Richard Cleve	[21]
3	Julia Kempe	[6] [8] [10] [11] [13] [14] [15] [19] [20]
4	Iordanis Kerenidis	[19] [20]
5	Avi Owshanko	[7]
6	Pavel Pudlák	[16] [23]
7	Ran Raz	[19] [20]
8	Oded Regev	[8] [14]
9	Ronald de Wolf	[6] [8] [10] [11] [13] [14] [15] [19] [20]
10	D. L. Yonge-Mallo	[21]

Colors in the list of coauthors