The following pages link to Christos Levcopoulos (Q582112):
Displaying 50 items.
- (Q232410) (redirect page) (← links)
- A note on adaptive parallel sorting (Q582114) (← links)
- Shortcuts for the circle (Q670711) (← links)
- On 2-QBF truth testing in parallel (Q672737) (← links)
- Chips on wafers, or packing rectangles into grids (Q705545) (← links)
- Minimum spanning trees in \(d\) dimensions (Q826104) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- A sublogarithmic convex hull algorithm (Q911280) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- Algorithms for minimum length partitions of polygons (Q1102107) (← links)
- A balanced search tree O(1) worst-case update time (Q1114387) (← links)
- Splitsort -- an adaptive sorting algorithm (Q1182101) (← links)
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees (Q1194346) (← links)
- Fast algorithms for greedy triangulation (Q1196458) (← links)
- Matching parentheses in parallel (Q1208458) (← links)
- Heuristics for optimum binary search trees and minimum weight triangulation problems (Q1263993) (← links)
- Sorting shuffled monotone sequences (Q1327388) (← links)
- Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
- Fast algorithms for complete linkage clustering (Q1380795) (← links)
- A linear-time approximation scheme for minimum weight triangulation of convex polygons (Q1393070) (← links)
- Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) (← links)
- Optimal algorithms for complete linkage clustering in \(d\) dimensions (Q1608896) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- The greedy triangulation can be computed from the Delaunay triangulation in linear time (Q1969592) (← links)
- Close approximations of minimum rectangular coverings (Q1970337) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- Quickest path queries on transportation network (Q2249042) (← links)
- Pushing the online matrix-vector conjecture off-line and identifying its easy cases (Q2327098) (← links)
- Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
- Sublinear merging and natural mergesort (Q2366243) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- A note on a QPTAS for maximum weight triangulation of planar point sets (Q2448113) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
- (Q2721991) (← links)
- (Q2748154) (← links)
- Efficiently Correcting Matrix Products (Q2942613) (← links)
- 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
- On parallel complexity of planar triangulations (Q2956699) (← links)
- Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time (Q2956702) (← links)
- Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) (Q2971137) (← links)
- (Q3046480) (← links)
- Space-efficient parallel merging (Q3142264) (← links)
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners (Q3149878) (← links)
- (Q3217601) (← links)
- (Q3339306) (← links)
- (Q3359741) (← links)
- (Q3359785) (← links)
