Sinisa Jankovic

dblp:413/8613 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum games
nonlocal games
1.012026
Bounding the asymptotic quantum value of all multipartite compiled non-local games · SODA 2026

Methods — techniques the papers use, named apart from their topics

interactive proofs · 1.0cryptographic compilation · 1.0
YearPublicationVenuePosition
2026 Bounding the asymptotic quantum value of all multipartite compiled non-local games
abstract
Non-local games are a powerful tool to distinguish between correlations possible in classical and quantum worlds. Kalai et al. (STOC’23) proposed a compiler that converts multipartite non-local games into interactive protocols with a single prover, relying on cryptographic tools to remove the assumption of physical separation of the players. While quantum completeness and classical soundness of the construction have been established for all multipartite games, quantum soundness is known only in the special case of bipartite games.
Matilde Baroni, Dominik Leichtle, Sinisa Jankovic, Ivan Supic
SODA3