We give an algorithm for bichromatic line segment intersection counting that runs in O(n √ log n) time under the word RAM model via a reduction to dynamic predecessor search, offline point location, and offline dynamic ranking. This algorithm is the first to solve bichromatic line segment intersection counting in o(n log n) time.

In the transient receptor potential (trp) mutant of Drosophila, the receptor potential appears almost normal in response to a flash but quickly decays to baseline during prolonged illumination. Photometric and early receptor potential measurements of the pigment suggest that the pigment is normal and that the decay of the trp response during illumination does not arise from a reduction in the a...

The effects of freeze-thaw, freezing and sediment geochemistry on terminal anaerobic processes occurring in sediments taken from below cyanobacterial mats in meltwater ponds of the McMurdo Ice Shelf in Antarctica were investigated. Depending on the geochemical and physical status of the sediments (i.e., frozen or thawed), as well as passage of sediment through a freeze-thaw cycle, terminal carb...

We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(22 poly(n) , O(n)). Providing a matching lower bound, we show that there is a fixed ground tree rewrite graph whose first-order theory is hard for ATIME(22 poly(n) , poly(n)) with respect to logspace reductions. Finally, we prove that there is a fixed ground tree rewrite graph together with ...

Designing efficient signature scheme based on the standard assumption such as the Computational Diffie-Hellman (CDH) assumption is important both from a practical and a theoretical point of view. Currently, there are only three standard model CDH-based signature schemes with short signatures due to Waters (EUROCRYPT 2005), and Seo and Böhl et al. (the merged paper in EUROCRYPT 2013). The Waters...

We show that the modified log-Sobolev constant for a natural Markov chain which converges to an $r$-homogeneous strongly log-concave distribution is at least $1/r$. Applications include sharp mixing time bound bases-exchange walk matroids, and concentration Lipschitz functions over these distributions.