Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
— Using real mechanical controls, this experiment studied strength and reversibility of direction-of-motion stereotypes and response times for different configurations of digital...
Hidden Markov chains (HMC) are widely applied in various problems occurring in different areas like Biosciences, Climatology, Communications, Ecology, Econometrics and Finances, ...