Whether constant π (i.e., pi) is normal is a confusing problem without any strict theoretical demonstration except for some statistical proof. A new concept of pi series is introd...
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
We present an algorithm to compute a Delaunay mesh conforming to a polyhedron possibly with small input angles. The radius-edge ratio of most output tetrahedra are bounded by a co...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tath...
Abstract. A man walks into a men’s room and observes n empty urinals. Which urinal should he pick so as to maximize his chances of maintaining privacy, i.e., minimize the chance ...
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...