Dynamic hotlinks

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 182-194

  Douïeb, Karim ^a,b   Langerman, Stefan ^a,c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b Boursier FRIA   (Guinea)

^c Chercheur Qualifié du FNRS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; ENTROPY; LINEAR SYSTEMS; SET THEORY; WEBSITES;

ENTROPY BOUND; HOTLINKS; LINEAR TIME ALGORITHMS; SOURCE HOME PAGE;

TREES (MATHEMATICS);

EID: 26844520385     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_17     Document Type: Conference Paper

References (18)

1. A.Andersson and T.W.Lai. Fast updating of well-balanced trees. In Proc. of the Second Scandinavian Worshop on Algorithm Theory, volume 447 of LNCS, pages 111-121, 1990.
2. P. Bose, E. Kranakis, D. Krizanc, M. V. Martin, J. Czyzowicz, A. Pelc, and L. Gasieniec. Strategies for hotlink assignments. In Proc. 11th Ann. Int. Symp. on Algoritms and Computation (ISAAC 2000), volume 1969 of LNCS, pages 23-34, 2000.
3. P. Bose, D. Krizanc, S. Langerman, and P. Morin. Asymmetric communication protocols via hotlink assignments. In Proc. of the 9th Coll. on Structural Information and Communication Complexity (SIROCCO 2002), pages 33-40, 2002.
4. H. Brönnimann, F. Cazals, and M. Durand. Randomized jumplists : A jump-and-walk dictionary data structure. In Proc. 20th Ann. Symp. on Theoretical Aspects of Computer Science (STACS 2003), volume 2607 of LNCS, pages 283-294, 2003.
5. J. Czyzowicz, E. Kranakis, D. Krizanc, A. Pelc, and M. V. Martin. Evaluation of hotlink assignment heuristics for improving web access. In Proc. 2nd Int. Conf. on Internet Computing (IC'2001), pages 793-799, 2001.
6. M. Drott. Using web server logs to improving site design. In Proc. ACM Conf. on Internet Computer Documentation, pages 43-50, 1998.
7. A. Elmasry. Deterministic jumplists. Technical report, DIMACS, 2003.
8. S. Fuhrmann, S. O. Krumke, and H.-C. Wirth. Multiple hotlink assignment. In Proc. 27th Int. Workshop on Graph- Theoric Concepts in Computer Science, volume 2204 of LNCS, pages 189-200, 2001.
9. I. Galperin and L. Rivest. Scapegoat trees. In Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 165-174, 1993.
10. O. Gerstel, S. Kutten, R. Matichin, and D. Peleg. Hotlink enhancement algorithms for web directories. In Proc. 14th Ann. Int. Symp. on Algorithms and Computation (ISAAC 2003), volume 2906 of LNCS, pages 68-77, 2003.
11. E. Kranakis, D. Krizanc, and M. V. Martin. The hotlink optimizer. In Proc. 3rd Int. Conf. on Internet Computing (IC'2002), pages 33-40, 2002.
12. E. Kranakis, D. Krizanc, and S. Shende. Approximate hotlink assignment. In Proc. 12th Ann. Int. Symp. on Algoritms and Computation (ISAAC 2001), volume 2223 of LNCS, pages 756-767, 2001.
13. R. Matichin and D. Peleg. Approximation algorithm for hotlink assignments in web directories. In Proc. Workshop on Algorithms and Data Structures (WADS 2003), volume 2748 of LNCS, pages 271-280, 2003.
14. N.Abramson. Information theory and coding. McGraw Hill, 1963.
15. M. Perkowitz and O. Etzioni. Towards adaptive Web sites: conceptual framework and case study. Computer Networks, 31(11-16):1245-1258, 1999.
16. A. Pessoa, E. Laber, and C. de Souza. Efficient algorithms for the hotlink assignment problem: The worst case search. In Proc. 15th Ann. Int. Symp. on Algorithms and Computation(ISAAC 2004), volume 3341 of LNCS, page 778, 2004.
17. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. In F. Dehne, J.-R. Sack, and N. Santoro, editors, Proc. Workshop on Algorithms and Data Structures (WADS 1989), volume 382 of LNCS, pages 437-449, 1989.
18. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-381, 1983.