Danny Krizanc

TL;DR: This work introduces a sequence-based approach (“ecotype simulation”) to model the evolutionary dynamics of bacterial populations and to identify ecotypes within a natural community, focusing here on two Bacillus clades surveyed from the “Evolution Canyons” of Israel.

TL;DR: This work investigates the use of identical tokens to break symmetry so that the two mobile agents can run the same deterministic algorithm and derives the lower and upper bounds for the time and memory complexity of the rendezvous search problem with various parameter sets.

TL;DR: The asynchronous version of this well-studied rendezvous problem, which involves two mobile agents having distinct labels and located in nodes of an unknown anonymous connected graph, is considered and it is shown that rendezvous is feasible if an upper bound on the size of the graph is known and an optimal algorithm is given if the topology of thegraph and the initial positions are known to agents.

TL;DR: It is proved that the models commonly used for generating random CSP instances do not have an asymptotic threshold and, in the spirit of random k-SAT, a new model is presented and lower and upper bounds for its parameters are derived so that instances are "almost surely" underconstrained and over Constraint Satisfaction Problems.

TL;DR: The study shows that the model of Kleinberg can be simplified by using the ring rather than the mesh while preserving the main features of the model, and defines a probability distribution p and studies the performance of greedy routing in G augmented with p.