Efficient algorithms for online decision problems
Authors:
- Adam KalaiAKAdam Kalai
- Santosh VempalaSVSantosh Vempala
Top Cited Papers
- 1 October 2005
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 71 (3) , 291-307
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Static Optimality and Dynamic Search-Optimality in Lists and TreesAlgorithmica, 2003
- Predicting nearly as well as the best pruning of a planar decision graphTheoretical Computer Science, 2002
- Regret in the On-Line Decision ProblemGames and Economic Behavior, 1999
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Universal PortfoliosMathematical Finance, 1991
- Self-adjusting binary search treesJournal of the ACM, 1985
- Dynamic huffman codingJournal of Algorithms, 1985
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985