Results of a new analysis of the K+K− photoproduction at two photon energies Eγ = 4 GeV and 5.65 GeV with a particular emphasis on the S-wave production are presented. We show that the proper treatment of all the helicity components of the Sand P -waves enables one to eliminate the reported discrepancies in extraction of the S-wave photoproduction cross section from experimental data.

We study classic cake-cutting problems, but in discrete models rather than using infiniteprecision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and movingknife), we roughly partition the various fair-allocation problems into 3 classes: “easy” (constant number of rounds of logar...

Settling a conjecture of Shi and Zhang [ZS09], we determine the unbounded-error communication complexity of the symmetric XOR functions up to a poly-logarithmic factor. Our proof is by a simple reduction to an earlier result of Sherstov.

In this paper, we consider a vehicular network in which the wireless nodes are located on a system of roads. We model the roadways, which are predominantly straight and randomly oriented, by a Poisson line process (PLP) and the locations of nodes on each road as a homogeneous 1D Poisson point process (PPP). Assuming that each node transmits independently, the locations of transmitting and recei...

psychology is that, despite the overall impressive abilities of people to sense, remember, and reason about the world, our cognitive abilities are extremely limited in well-characterized ways. In particular, psychologists have found that people grapple with scarce attentional resources and limited working memory. Such limitations become salient when people are challenged with remembering more t...

We present a protocol for anonymous communication over the Internet. Our protocol, called P 5 (Peer-to-Peer Personal Privacy Protocol) provides sender-, receiver-, and sender-receiver anonymity. P 5 is designed to be implemented over the current Internet protocols, and does not require any special infrastructure support. A novel feature of P is that it allows individual participants to trade-of...

We prove that the PNP-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the PNP-type communication complexity of a lifted version of f . As an application, we show that a certain “product” lower bound method of Impagliazzo and Williams (CCC 2010) fails to capture PNP communication complexity up to polynomial factors, which answers a...

We prove that the P-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the P-type communication complexity of a lifted version of f . As an application, we show that a certain “product” lower bound method of Impagliazzo and Williams (CCC 2010) fails to capture P communication complexity up to polynomial factors, which answers a quest...