The following pages link to Alejandro López-Ortiz (Q255273):
Displayed 50 items.
- Item:Q255273 (redirect page) (← links)
- Online scheduling FIFO policies with admission and push-out (Q255276) (← links)
- Online bin packing with advice (Q261387) (← links)
- List update with probabilistic locality of reference (Q436596) (← links)
- Optimal strategies for the list update problem under the MRM alternative cost model (Q437676) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- On the list update problem with advice (Q515679) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- Efficient view point selection for silhouettes of convex polyhedra (Q634248) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- An efficient bounds consistency algorithm for the global cardinality constraint (Q816677) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- Drawing \(K_{2,n}\): A lower bound (Q1007548) (← links)
- New lower bounds for element distinctness on a one-tape Turing machine (Q1336768) (← links)
- On universally easy classes for NP-complete problems. (Q1401418) (← links)
- Searching and on-line recognition of star-shaped polygons. (Q1427863) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Longest increasing subsequences in sliding windows (Q1885912) (← links)
- Paid exchanges are worth the price (Q2182321) (← links)
- Interruptible algorithms for multiproblem solving (Q2197326) (← links)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- The impact of processing order on performance: a taxonomy of semi-FIFO policies (Q2361355) (← links)
- A novel approach for leveraging co-occurrence to improve the false positive error in signature files (Q2376805) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- Optimal scheduling of contract algorithms with soft deadlines (Q2400436) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- (Q2768307) (← links)
- (Q2768398) (← links)
- Computing Weak Consistency in Polynomial Time (Q2796276) (← links)
- List Colouring and Partial List Colouring of Graphs On-line (Q2798224) (← links)
- Lower Bounds for Graph Exploration Using Local Policies (Q2803810) (← links)
- Optimal Distributed Searching in the Plane with and Without Uncertainty (Q2803811) (← links)
- Paging for multi-core shared caches (Q2826048) (← links)
- Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) (← links)
- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods (Q2848917) (← links)
- Minimizing Cache Usage in Paging (Q2848921) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- The Distance 4-Sector of Two Points Is Unique (Q2872125) (← links)
- A New Perspective on List Update: Probabilistic Locality and Working Set (Q2896386) (← links)
- Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving (Q2929590) (← links)
- (Q2934601) (← links)
- Parameterized Algorithms for the H-Packing with t-Overlap Problem (Q2938748) (← links)
- Algorithms in the Ultra-Wide Word Model (Q2948478) (← links)
- Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← links)