Abstract: Let B be standard Brownian motion. Fix an interval (a,b). Condition on B(t) to be in (a,b). Look at B(u) for u<.=t and B(u) u>.=t. We show that this converges weakly to a proper probability measure on C(R).
Abstract: Propp and Wilson showed how to generate a Markov chain which in a finite number of steps gives a sample from the stationary distribution supported by a countable set.
Arithmetic Complexity is a central topic of interest in theoretical computer science. The famous $P$ vs. $NP$ question that seeks to understand the limits of efficient computation has its natural arithmetic analogue.
Abstract: Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency.
Abstract: Most of the achievability proofs in Information theory are based on the concept of typicality. However, this typicality technique does not seem to be good enough to give achievability bounds in the most general settings, i.e.
Abstract: Differentiated service is typically provided to customers by offering different grades of service at different prices. We first consider a simple system with heterogeneous customers that are type indexed by $v$.
Abstract: We consider three different parameters measuring (non-)convexity of subsets of the plane or, more generally, of an Euclidean space. In particular, we are interested in mutual relations of these parameters.
Abstract: In recent years, an online adaptation of the classical primal-dual paradigm has been successfully used to obtain new online algorithms for node-weighted network design problems, and simplify existing ones fo
