143 search results - page 3 / 29 » Sorting and Selection in Posets |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Let X[0..n - 1] and Y [0..m - 1] be two sorted arrays, and define the m
CCS
2010
ACM
14 years 1 months ago
2010
ACM
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
TCS
2011
13 years 1 months ago
2011
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...