A probabilistic approach to navigation in Hypertext

Information Sciences

Volumn 114, Issue 1-4, 1999, Pages 165-186

  Levene, Mark ^a   Loizou, George ^b  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; ONLINE SEARCHING; PROBABILITY; QUERY LANGUAGES;

HYPERTEXT QUERY LANGUAGE (HQL);

HYPERTEXT SYSTEMS;

EID: 0033102419     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(98)10055-5     Document Type: Article

References (19)

1. F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
2. V. Bush, As we may think, Atlantic Monthly 76 (1945) 101-108.
3. B.A. Davey, H.A. Priestly, Introduction to Lattices and Order, Cambridge University Press, Cambridge, UK, 1990.
4. E.A. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Chapter 16, Elsevier, Amsterdam, 1990, pp. 997-1072.
5. R. Fagin, J.Y. Halpern, N. Megiddo, A logic for reasoning about probabilities, Inform, and Comput. 87 (1990) 78-128.
6. W. Feller, An Introduction to Probability Theory and its Applications, third edition, Wiley, New York, 1968.
7. M.F. Prisse, S.B. Cousins, Models for Hypertext, J. Am. Soc. Inform. Sci. 43 (1992) 182-192.
8. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPcompleteness, Freeman, New York, 1979.
9. J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6 (1977) 675-695.
10. R.P. Grimaldi, Discrete and Combinatorial Mathematics, second edition, Addison-Wesley, Reading, MA, 1989.
11. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
12. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A, Chapter 2, Elsevier, Amsterdam, 1990, pp. 67-161.
13. J.G. Kemeny, J.L. Snell, Finite Markov Chains, D. van Nostrand, Princeton, 1960.
14. K. de Leeuw, E.F. Moore, C.E. Shannon, N. Shapiro, Computability by probabilistic Turing machines, in: C.E. Shannon, J. McCarthy (Eds.), Automata Studies, Princeton University Press, Princeton, NJ, 1956, pp. 183-212.
15. D. Lehman, S. Shelah, Reasoning with time and chance. Inform, and Control 53 (1982) 165-198.
16. M. Levene, G. Loizou, Navigation in Hypertext is easy only sometimes, Research Note RN/ 94/43, Department of Computer Science, University College London.
17. R. McNaughton, S. Pappert, Counter-Free Automata, MIT Press, Cambridge, MA, 1971.
18. M. Nasu, N. Honda, Fuzzy events realized by finite probabilistic automata, Inform, and Control 12 (1968) 284-303.
19. J. Nielsen, Hypertext and Hypermedia, Academic Press, San Diego, 1990.