Dmitry Gavinsky

Available identifiers

zbMath Open gavinsky.dmitryMaRDI QIDQ2195574

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5091221	2022-07-21	Paper
Bare Quantum Simultaneity Versus Classical Interactivity in Communication Complexity	2022-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q5158502	2021-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q4988302	2021-05-14	Paper
Bare Quantum simultaneity versus classical interactivity in communication complexity	2021-01-19	Paper
A Composition Theorem for Randomized Query Complexity	2020-11-25	Paper
Entangled Simultaneity Versus Classical Interactivity in Communication Complexity	2020-09-29	Paper
Santha-Vazirani sources, deterministic condensers and very strong extractors	2020-08-26	Paper
Quantum Versus Classical Simultaneity in Communication Complexity	2020-01-28	Paper
Entangled simultaneity versus classical interactivity in communication complexity	2017-09-29	Paper
Correlation in Hard Distributions in Communication Complexity	2017-08-31	Paper
Partition expanders	2017-07-17	Paper
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation	2017-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q2965495	2017-03-03	Paper
On the joint entropy of $d$-wise-independent variables	2017-01-13	Paper
A tail bound for read-kfamilies of functions	2015-10-12	Paper
Equality, Revisited	2015-09-16	Paper
Toward better formula lower bounds	2015-06-26	Paper
Bounded-error quantum state identification and exponential separations in communication complexity	2014-11-25	Paper
En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations	2014-07-01	Paper
On the Role of Shared Randomness in Simultaneous Communication	2014-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q5414570	2014-05-06	Paper
Quantum predictive learning and communication complexity with single input	2012-09-05	Paper
Quantum Algorithm for the Boolean Hidden Shift Problem	2011-08-17	Paper
A separation of NP and conp in multiparty communication complexity	2011-05-24	Paper
Bounded-error quantum state identification and exponential separations in communication complexity	2010-03-17	Paper
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography	2009-11-06	Paper
Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's	2009-10-12	Paper
Quantum Algorithms for Evaluating Min-Max Trees	2009-01-13	Paper
https://portal.mardi4nfdi.de/entity/Q3549689	2009-01-05	Paper
On the role of shared entanglement	2008-11-24	Paper
Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups	2008-09-03	Paper
Learning Theory	2005-06-13	Paper
10.1162/153244304322765667	2004-11-01	Paper
10.1162/153244303321897708	2004-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4420743	2003-08-18	Paper
https://portal.mardi4nfdi.de/entity/Q3148822	2002-09-22	Paper

Research outcomes over time

This page was built for person: Dmitry Gavinsky