Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Pr...