Shengyu Zhang

Available identifiers

zbMath Open zhang.shengyuMaRDI QIDQ496890

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147309	2024-01-15	Paper
On the cut dimension of a graph	2023-07-12	Paper
Sensitivity Conjecture and Log-rank Conjecture for functions with small alternating numbers	2020-05-27	Paper
Efficient quantum protocols for XOR functions	2019-06-20	Paper
Efficient protocols for generating bipartite classical distributions and quantum states	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4633839	2019-05-06	Paper
Contextual dependent click bandit algorithm for web recommendation	2018-10-04	Paper
Measurement-device-independent semiquantum key distribution	2018-09-03	Paper
Linear-Time Algorithm for Quantum 2SAT	2018-06-15	Paper
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems	2018-03-21	Paper
Linear Time Algorithm for Quantum 2SAT	2017-12-19	Paper
Quantum game players can have advantage without discord	2017-09-28	Paper
Multipartite quantum correlation and communication complexities	2017-07-28	Paper
On The I/O Complexity of Dynamic Distinct Counting	2017-06-13	Paper
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States	2017-06-08	Paper
Quantum strategic game theory	2016-10-07	Paper
Fourier Sparsity of GF(2) Polynomials	2016-07-25	Paper
A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator	2015-12-03	Paper
Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine	2015-11-12	Paper
Solving Linear Programming with Constraints Unknown	2015-10-27	Paper
Quantum game players can have advantage without discord	2015-09-30	Paper
Semiquantum key distribution without invoking the classical party's measurement capability	2015-09-23	Paper
New upper and lower bounds for randomized and quantum local search	2014-11-25	Paper
On the complexity of trial and error	2014-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q2913796	2012-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q2913817	2012-09-27	Paper
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity	2011-07-06	Paper
Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer	2011-01-17	Paper
Composition Theorems in Communication Complexity	2010-09-07	Paper
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas	2010-07-20	Paper
Tight Bounds for Randomized and Quantum Local Search	2010-07-07	Paper
The communication complexity of the Hamming distance problem	2010-01-29	Paper
On the Tightness of the Buhrman-Cleve-Wigderson Simulation	2009-12-17	Paper
New bounds on classical and quantum one-way communication complexity	2009-07-10	Paper
Streaming Algorithms Measured in Terms of the Computed Quantity	2009-03-06	Paper
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks	2008-08-19	Paper
Computing and Combinatorics	2006-01-11	Paper
Automata, Languages and Programming	2005-08-24	Paper
On the power of Ambainis lower bounds	2005-06-30	Paper
Universal and original-preserving quantum copying is impossible	2002-05-14	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Shengyu Zhang