| On the Separation and Equivalence of Paging Strategies and Other Online Algorithms | 0 | 0.34 | 2019 |
| The Hausdorff Core Problem On Simple Polygons | 0 | 0.34 | 2014 |
| Broadcasting in Conflict-Aware Multi-channel Networks. | 0 | 0.34 | 2013 |
| Optimal Average Case Strategy for Looking Around a Corner. | 0 | 0.34 | 2012 |
| List update with probabilistic locality of reference | 1 | 0.35 | 2012 |
| On the Advice Complexity of Buffer Management. | 9 | 0.52 | 2012 |
| On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods | 7 | 0.48 | 2012 |
| A new perspective on list update: probabilistic locality and working set | 1 | 0.35 | 2011 |
| Untangled monotonic chains and adaptive range search | 6 | 0.49 | 2011 |
| An Improved Line-Separable Algorithm For Discrete Unit Disk Cover | 19 | 0.82 | 2010 |
| Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm | 9 | 0.66 | 2009 |
| An Application of Self-organizing Data Structures to Compression | 5 | 0.47 | 2009 |
| On Developing New Models, with Paging as a Case Study | 1 | 0.36 | 2009 |
| On the relative dominance of paging algorithms | 14 | 0.57 | 2009 |
| Parameterized Analysis of Paging and List Update Algorithms. | 13 | 0.56 | 2009 |
| Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance | 1 | 0.40 | 2009 |
| Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM). | 0 | 0.34 | 2008 |
| Adaptive Searching in One and Two Dimensions | 0 | 0.34 | 2008 |
| List Update Algorithms for Data Compression | 1 | 0.36 | 2008 |
| Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM) | 8 | 0.48 | 2008 |
| List update with locality of reference | 18 | 0.80 | 2008 |
| On certain new models for paging with locality of reference | 2 | 0.36 | 2008 |
| Closing the gap between theory and practice: new measures for on-line algorithm analysis | 3 | 0.41 | 2008 |
| Search Algorithms for Unstructured Peer-to-Peer Networks | 2 | 0.39 | 2007 |
| On the separation and equivalence of paging strategies | 29 | 1.62 | 2007 |
| On the complexity of finding an unknown cut via vertex queries | 4 | 0.52 | 2007 |
| Adaptive Analysis of On-line Algorithms | 1 | 0.35 | 2006 |
| A Survey of Performance Measures for On-line Algorithms | 22 | 0.70 | 2005 |
