4315 search results - page 96 / 863 » Sorting in linear time |
116
Voted
CIAC
1997
Springer
15 years 7 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
136
Voted
PRDC
2007
IEEE
15 years 9 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
129
Voted
SIGMOD
1996
ACM
15 years 7 months ago
1996
ACM
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
127
Voted
BIRTHDAY
2008
Springer
15 years 4 months ago
2008
Springer
e [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented severa...
104
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper we present a structure theory for generalized linear dynamic factor models (GDFM’s). Emphasis is laid on the so-called zeroless case. GDFM’s provide a way of ...