We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
r introduces an abstract framework for the specification of components with multiple require and provide interfaces that allows the specification of multiple access to a single ...
Abstract--Multicarrier multiple access with channel knowledge and prescribed power at the transmitters is shown to maximize the sum-rate for circulant intersymbol-interference (ISI...
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant...