◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Palazuelos

42 papers hereh-index 221.6k citations67 works total

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

author position
  • sole author3
  • first author5
  • middle author22
  • last author10

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

fields
  • quant-ph30
  • math.OA5
  • math.FA3
  • math-ph2
  • cs.CC1
  • math.PR1

identity via Semantic Scholar / OpenAlex

activity
20072026
most citedConnes' embedding problem and Tsirelson's problem

186 citations · 1.3k across the 37 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2010★ 1 cited

The communication complexity of XOR games via summing operators

C. Palazuelos, D. Perez-Garcia, I. Villanueva

The discrepancy method is widely used to find lower bounds for communication complexity of XOR games. It is well known that these bounds can be far from optimal. In this context Di…

◍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.