3 citations · 5 across the 5 of their papers we have counts for
6 papers
On the Approximation Ratio of Ordered Parsings
Gonzalo Navarro, Carlos Ochoa, Nicola Prezza
Shannon's entropy is a clear lower bound for statistical compression. The situation is not so well understood for dictionary-based compression. A plausible lower bound is , the…
Synergistic Computation of Planar Maxima and Convex Hull
Jérémy Barbay, Carlos Ochoa
Refinements of the worst case complexity over instances of fixed input size consider the input order or the input structure, but rarely both at the same time. Barbay et al. [2016]…
Synergistic Sorting, MultiSelection and Deferred Data Structures on MultiSets
Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti
Karp et al. (1988) described Deferred Data Structures for Multisets as "lazy" data structures which partially sort data to support online rank and select queries, with the minimum…
Refining the Analysis of Divide and Conquer: How and When
Jeremy Barbay, Carlos Ochoa, Pablo Perez-Lantero
Divide-and-conquer is a central paradigm for the design of algorithms, through which some fundamental computational problems, such as sorting arrays and computing convex hulls, are…
Matching colored points with rectangles
L. E. Caraballo, C. Ochoa, P. Pérez-Lantero +1
Let be a point set in the plane such that each of its elements is colored either red or blue. A matching of with rectangles is any set of pairwise-disjoint axis-aligned rec…
Extremal antipodal polygons and polytopes
O. Aichholzer, L. E. Caraballo, J. M. Díaz-Báñez +3
Let be a set of points on a circle such that for each point also its antipodal (mirrored with respect to the circle center) point belongs to . A polygon…