4315 search results - page 9 / 863 » Sorting in linear time |
ESA
2007
Springer
14 years 1 months ago
2007
Springer
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
CADE
2006
Springer
13 years 11 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
FOCS
1996
IEEE
13 years 11 months ago
1996
IEEE
CAIP
2007
Springer
14 years 1 months ago
2007
Springer
Chazelle’s triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon)...