The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative versi...
Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisa...
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical diļ¬...
We develop a general theory of the swelling kinetics of polymer gels, with the view that a polymer gel is a two-phase ļ¬uid. The model we propose is a free boundary problem and ca...
James P. Keener, Sarthok Sircar, Aaron L. Fogelson
In wireless networks, the channels are often subject to random variations that limit the reliability of communications between any two radios. Geographic transmission strategies ca...
Murali Rao, Tathagata D. Goswami, Joseph Glover, J...
Discrete breathers are found in a nonlinear one dimensional axially loaded mechanical lattice consisting of rigid links supported laterally by linear springs. We ļ¬nd link centere...
The heterogeneity characterizing the systems populating the Ubiquitous Computing environment prevents their seamless interoperability. Heterogeneous protocols may be willing to coo...
Analyzing Border Gateway Protocol (BGP) instances is a crucial step in the design and implementation of safe BGP systems. Today, the analysis is a manual and tedious process. Resea...
Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Th...