Yelena Yuditsky

Learn More
The local search framework for obtaining PTASs for NP-hard geometric optimization problems was introduced, independently, by Chan and Har-Peled [6] and Mustafa and Ray [17]. In this paper, we generalize the framework by extending its analysis to additional families of graphs, beyond the family of planar graphs. We then present several applications of the(More)
We consider a distributed computation setting in which a party, whom we refer to as the dealer, has a finite state automaton (FSA) A with m states, which accepts an (a priori unbounded) stream of inputs x1, x2, . . . received from an external source. The dealer delegates the computation to agents A1, . . . , An, by furnishing them with an implementation of(More)
Let ES(n) be the minimal integer such that any set of ES(n) points in the plane in general position contains n points in convex position. The problem of estimating ES(n) was first formulated by Erdős and Szekeres (Compos Math 2: 463– 470, 1935), who proved that ES(n) ≤ (2n−4 n−2 ) + 1. The current best upper bound, lim supn→∞ ES(n) (2n−5 n−2 ) ≤ 29 32 , is(More)
In the problem of private “swarm” computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation. Recently, Dolev, Garay, Gilboa and Kolesnikov [ICS 2011] considered this problem in(More)
In the problem of swarm computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation. Recently, Dolev, Garay, Gilboa and Kolesnikov [ICS 2011] considered this problem in the(More)
  • 1