◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Shengyu Zhang

42 papers hereh-index 333.3k citations112 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author5
  • middle author8
  • last author28

Across the 41 of 42 papers where every author was matched, so the position is known.

fields
  • quant-ph23
  • cs.CC11
  • cs.LG3
  • cs.CV1
  • cs.DS1
  • cs.GT1
same name
  • Shengyu Zhang — 48 papers, h 22
  • Shengyu Zhang — 33 papers, h 20
  • Shengyu Zhang — 16 papers, h 6
  • Shengyu Zhang — 13 papers, h 3
  • Shengyu Zhang — 11 papers, h 6
  • Shengyu Zhang — 11 papers, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20032025
most citedNonlocality and conflicting interest games

71 citations · 455 across the 36 of their papers we have counts for

collaborators
Showing 2011Show all

4 papers · 1 filter

quant-ph2011★ 1 cited

On characterizing quantum correlated equilibria

Zhaohui Wei, Shengyu Zhang

Quantum game theory lays a foundation for understanding the interaction of people using quantum computers with conflicting interests. Recently Zhang proposed a simple yet rich mode…

cs.GT2011

A quantum protocol for sampling correlated equilibria unconditionally and without a mediator

Iordanis Kerenidis, Shengyu Zhang

A correlated equilibrium is a fundamental solution concept in game theory that enjoys many desirable properties. However, it requires a trusted mediator, which is a major drawback…

cs.CC2011★ 1 cited

The influence lower bound via query elimination

Rahul Jain, Shengyu Zhang

We give a simpler proof, via query elimination, of a result due to O'Donnell, Saks, Schramm and Servedio, which shows a lower bound on the zero-error randomized query complexity of…

cs.CC2011★ 14 cited

Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models

Ming Lam Leung, Yang Li, Shengyu Zhang

We study the communication complexity of symmetric XOR functions, namely functions f:{0,1}n×{0,1}n→{0,1} that can be formulated as $f(x,y)=D(|x\oplus…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.