Sciweavers

2095 search results - page 26 / 419
» Improved pebbling bounds
Sort
View
COMBINATORICS
2004
61views more  COMBINATORICS 2004»
13 years 9 months ago
Improved Bounds on the Length of Maximal Abelian Square-free Words
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
Evan M. Bullock
IPL
2000
62views more  IPL 2000»
13 years 9 months ago
Improved bounds for dictionary look-up with one error
Gerth Stølting Brodal, Srinivasan Venkatesh
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
13 years 9 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri