Soma Chaudhuri

Learn More
In the paper, we describe a polynomial time algorittma that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d-~3, all sufficiently large n and all(More)
We define the k-set consensus problem as an extension of the consensus problem, where each processor decides on a single value such that the set of decided values in any run is of size at most k. We study variations of this problem by adding the agreement condition, which requires that any decided value must be an initial value of some processor, and the(More)
We give a path integral prescription for the pair correlation function of Wilson loop observables on the worldvolume of a Dbrane in the bosonic string theory in flat spacetime. We determine the coefficient of the 1/R term in the static heavy quark potential from the static pair correlation function of Wilson lines at small spatial separation in the critical(More)
To enhartce performance on shared memory multiprocessors, various techniques have been proposed to reduce the latency of memory accesses, including pipelining of accesses, out-of-order execution of accesses, and branch prediction with speculative execution, These optimisations however can complicate the user’s model of memory. Thn paper attacks the problem(More)
We study the round complexity of problems in a synchronous, message-passing system with crash failures. We show that if processors start in order-equivalent states, then a logarithmic number of rounds is both necessary and sufficient for them to reach order-inequivalent states. These upper and lower bounds are significant because they establish a complexity(More)
Much of modern systems programming involves designing algorithms for distributed systems in which the nodes have access to information about time. Time information can be used to estimate the time at which system or environment events occur, to detect process failures, to schedule the use of resources, and to synchronize activities of different system(More)
A software obfuscator is a program O to transform a source program <i>P</i> for protection against malicious reverse engineering. O should be <i>correct</i> (O(<i>P</i>) has same functionality with <i>P</i>), <i>resilient</i> (O(<i>P</i>) is resilient against attacks), and <i>effective</i> (O(<i>P</i>) is not too much slower than <i>P</i>). In this paper we(More)