- {\displaystyle \Omega ({\sqrt {n}})} was
given by
Levcopoulos (1987), and the
matching upper bound is by
Levcopoulos &
Krznaric (1998). As with the approximation...
- root of the
treap and
speeding up ****ure
accesses for the same keys.
Levcopoulos &
Petersson (1989)
describe a
sorting algorithm based on
Cartesian trees...
- Due to its complexity,
smoothsort is
rarely used.[citation needed]
Levcopoulos and
Petersson describe a
variation of
heapsort based on a heap of Cartesian...
-
better when the data
contains existing order.
Published by
Christos Levcopoulos and Ola
Petersson in 1992, the
algorithm utilizes a new
measure of presortedness...
- (ALENEX) (pp. 201-213).
Society for
Industrial and
Applied Mathematics Levcopoulos, Christos; Petersson, Ola (1989), "Heapsort -
Adapted for
Presorted Files"...
- doi:10.1145/323233.323269. ISBN 978-0-89791-163-4. S2CID 12588297.
Levcopoulos, C (1986-08-01). "Fast
heuristics for
minimum length rectangular partitions...
- Virtue:
Revisiting Merge and Sort on
Modern Processors (PDF). SIGMOD/PODS.
Levcopoulos, Christos; Petersson, Ola (1989). "Heapsort -
Adapted for
Presorted Files"...
- 2006, Queen's University, Ontario, Canada, pp. 39–42 Krznaric, Drago;
Levcopoulos, Christos; Nilsson,
Bengt J. (1999), "Minimum
spanning trees in d {\displaystyle...
-
Computer and
System Sciences. 40: 19–48. doi:10.1016/0022-0000(90)90017-f.
Levcopoulos, C.; Gudmundsson, J. (1997). "Approximation
algorithms for
covering polygons...
- (3): 721–739, doi:10.1137/050631008, MR 2263009. Gudmundsson, Joachim;
Levcopoulos, Christos; Kamal, Lodaya; Meena,
Mahajan (2004), "Minimum
weight pseudo-triangulations"...
