| Carving Perfect Layers out of Docker Images. | 0 | 0.34 | 2019 |
| Strategic Classification. | 0 | 0.34 | 2016 |
| Adaptive Caching in Big SQL using the HDFS Cache. | 12 | 0.77 | 2016 |
| Optimizing The Selection of Strangers To Answer Questions in Social Media. | 3 | 0.41 | 2014 |
| Preface | 0 | 0.34 | 2014 |
| Equilibrium Computation (Dagstuhl Seminar 14342). | 0 | 0.34 | 2014 |
| Recommending targeted strangers from whom to solicit information on social media | 26 | 1.00 | 2013 |
| Formation of preferences and strategic analysis | 0 | 0.34 | 2010 |
| 10171 Abstracts Collection - Equilibrium Computation. | 0 | 0.34 | 2010 |
| Dynamic faceted search for discovery-driven analysis | 45 | 1.49 | 2008 |
| Adaptive traitor tracing for large anonymous attack | 3 | 0.40 | 2008 |
| Efficient Coalition Detection In Traitor Tracing | 7 | 0.91 | 2008 |
| Online learning with prior knowledge | 14 | 0.91 | 2007 |
| Continuity properties of equilibrium prices and allocations in linear fisher markets | 2 | 0.60 | 2007 |
| Integrating a maximum-entropy cardinality estimator into DB2 UDB | 4 | 0.45 | 2006 |
| Combining expert advice in reactive environments | 22 | 1.71 | 2006 |
| Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings | 48 | 4.13 | 2005 |
| Outperforming LRU with an Adaptive Replacement Cache Algorithm | 97 | 3.66 | 2004 |
| Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments | 11 | 0.97 | 2004 |
| ARC: A Self-Tuning, Low Overhead Replacement Cache | 371 | 13.43 | 2003 |
| How to Combine Expert (and Novice) Advice when Actions Impact the Environment? | 15 | 1.44 | 2003 |
| Attribute Classification Using Feature Analysis | 24 | 2.21 | 2002 |
| Automating physical database design in a parallel database | 112 | 6.00 | 2002 |
| An Improved Predictive Accuracy Bound for Averaging Classifiers | 13 | 2.90 | 2001 |
| A sublinear parallel algorithm for stable matching | 9 | 1.88 | 2000 |
| A Fast Indexing Method For Multidimensional Nearest Neighbor Search | 20 | 1.71 | 1999 |
| Discovering Predictive Association Rules | 55 | 4.83 | 1998 |
| Discovery-Driven Exploration of OLAP Data Cubes | 180 | 21.55 | 1998 |
| A modified layered-step interior-point algorithm for linear programming | 14 | 1.45 | 1998 |
| Using fast matrix multiplication to find basic solutions | 13 | 1.01 | 1998 |
| Optimal weighted loop fusion for parallel programs | 31 | 1.60 | 1997 |
| Range queries in OLAP data cubes | 201 | 25.28 | 1997 |
| A Deterministic poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension | 18 | 0.93 | 1996 |
| A linear programming instance with many crossover events | 4 | 0.57 | 1996 |
| Color image background segmentation and representation | 0 | 0.34 | 1996 |
| Improved Algorithms and Analysis for Secretary Problems and Generalizations | 27 | 5.18 | 1995 |
| Algorithms and Complexity Analysis for Some Flow Problems | 5 | 0.57 | 1994 |
| Essays in Game Theory, In Honor of Michael Maschler | 8 | 0.98 | 1994 |
| Parallel linear programming in fixed dimension almost surely in constant time | 27 | 1.95 | 1994 |
| New algorithms for generalized network flows | 17 | 2.14 | 1994 |
| Improved Algorithms for Linear Inequalities with Two Variables per Inequality | 26 | 4.57 | 1994 |
| Fast algorithms for finding randomized strategies in game trees | 79 | 16.08 | 1994 |
| Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality | 57 | 4.08 | 1993 |
| Theoretical convergence of large-step primal-dual interior point algorithms for linear programming | 18 | 1.74 | 1993 |
| The Minimum Reservation Rate Problem in Digital Audio/Video Systems. | 1 | 0.37 | 1993 |
| Linear time algorithms for some separable quadratic programming problems | 35 | 3.56 | 1993 |
| A primal-dual infeasible-interior-point algorithm for linear programming | 92 | 8.64 | 1993 |
| Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs | 28 | 1.50 | 1993 |
| Constructing small sample spaces satisfying given constraints | 32 | 4.07 | 1993 |
| A general framework of continuation methods for complementarity problems | 18 | 2.36 | 1993 |
