{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T05:06:38Z","timestamp":1740632798837,"version":"3.38.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00224-010-9294-3","type":"journal-article","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T06:21:29Z","timestamp":1286173289000},"page":"213-240","source":"Crossref","is-referenced-by-count":0,"title":["The Navigational Power of Web Browsers"],"prefix":"10.1007","volume":"50","author":[{"given":"Micha\u0142","family":"Bielecki","sequence":"first","affiliation":[]},{"given":"Jan","family":"Hidders","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Paredaens","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Spielmann","sequence":"additional","affiliation":[]},{"given":"Jerzy","family":"Tyszkiewicz","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Van\u00a0den Bussche","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,5]]},"reference":[{"key":"9294_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"issue":"2","key":"9294_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(99)00221-2","volume":"239","author":"S. Abiteboul","year":"2000","unstructured":"Abiteboul, S., Vianu, V.: Queries and computation on the Web. Theor. Comput. Sci. 239(2), 231\u2013255 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9294_CR3","volume-title":"Introduction to the Theory of Complexity","author":"D. Bovet","year":"1993","unstructured":"Bovet, D., Crescenzi, P.: Introduction to the Theory of Complexity. Prentice Hall, New York (1993). Freely available http:\/\/www.algoritmica.org\/piluc\/ (2006)"},{"issue":"2","key":"9294_CR4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A. Chandra","year":"1980","unstructured":"Chandra, A., Harel, D.: Computable queries for relational data bases. J. Comput. Syst. Sci. 21(2), 156\u2013178 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"9294_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1006\/ijhc.2002.1025","volume":"57","author":"A. Cockburn","year":"2002","unstructured":"Cockburn, A., McKenzie, B., JasonSmith, M.: Pushing back: evaluating a new behaviour for the back and forward buttons in WEB browsers. Int. J. Hum.-Comput. Stud. 57(5), 397\u2013414 (2002)","journal-title":"Int. J. Hum.-Comput. Stud."},{"unstructured":"Cockburn, A., et al.: Web navigation. http:\/\/www.cosc.canterbury.ac.nz\/andrew.cockburn\/web_navigation.html","key":"9294_CR6"},{"issue":"9","key":"9294_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/MC.1987.1663693","volume":"20","author":"J. Conklin","year":"1987","unstructured":"Conklin, J.: Hypertext: an introduction and survey. Computer 20(9), 17\u201341 (1987)","journal-title":"Computer"},{"key":"9294_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03182-7","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Berlin (1995)"},{"key":"9294_CR9","first-page":"90","volume-title":"Hypertext: Theory into Practice","author":"D.M. Edwards","year":"1999","unstructured":"Edwards, D.M., Hardman, L.: Lost in hyperspace: cognitive mapping and navigation in a hypertext environment. In: McAleese, R. (ed.) Hypertext: Theory into Practice, pp. 90\u2013150. Intellect, Bristol (1999)"},{"unstructured":"Greenberg, S., Cockburn, A.: Getting back to back: alternate behaviors for a Web browser\u2019s back button. In: 5th Conference on Human Factors and the Web, Gaithersburg, Maryland, 3 June 1999","key":"9294_CR10"},{"issue":"4","key":"9294_CR11","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes. SIAM J. Comput. 16(4), 760\u2013778 (1987)","journal-title":"SIAM J. Comput."},{"key":"9294_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Berlin (1999)"},{"issue":"2","key":"9294_CR13","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"9294_CR14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.3233\/FUN-2006-69304","volume":"69","author":"M. Kaminski","year":"2006","unstructured":"Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundam. Inform. 69, 301\u2013318 (2006)","journal-title":"Fundam. Inform."},{"key":"9294_CR15","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"9294_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Berlin (2004)"},{"issue":"8","key":"9294_CR17","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/S0306-4379(98)00032-5","volume":"23","author":"A.O. Mendelzon","year":"1998","unstructured":"Mendelzon, A.O., Milo, T.: Formal models of Web queries. Inf. Syst. 23(8), 615\u2013637 (1998)","journal-title":"Inf. Syst."},{"key":"9294_CR18","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"9294_CR19","volume-title":"Proceedings 21st ACM Symposium on Principles of Database Systems.","author":"M. Spielmann","year":"2002","unstructured":"Spielmann, M., Tyszkiewicz, J., Van\u00a0den Bussche, J.: Distributed computation of Web queries using automata. In: Proceedings 21st ACM Symposium on Principles of Database Systems. ACM, New York (2002)"},{"key":"9294_CR20","first-page":"137","volume-title":"Proceedings 14th ACM Symposium on the Theory of Computing","author":"M.Y. Vardi","year":"1982","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: Proceedings 14th ACM Symposium on the Theory of Computing, pp. 137\u2013146 (1982)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9294-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:04:49Z","timestamp":1740546289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9294-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,5]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9294"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9294-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2010,10,5]]}}}