Random walks with “back buttons” (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Random walks with “back buttons” (extended abstract)

Full text

Pdf (1.02 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-second annual ACM symposium on Theory of computing table of contents

Portland, Oregon, United States

Pages: 484 - 493

Year of Publication: 2000

ISBN:1-58113-184-4

Authors

Ronald Fagin	IBM Almaden Research Center, 650 Harry Road, San Jose, CA
Anna R. Karlin	Department of Computer Science, Box 352350, University of Washington, Seattle, WA
Jon Kleinberg	Department of Computer Science, Cornell University, Ithaca, NY
Prabhakar Raghavan	IBM Almaden Research Center, 650 Harry Road, San Jose, CA
Sridhar Rajagopalan	IBM Almaden Research Center, 650 Harry Road, San Jose, CA
Ronitt Rubinfeld	NECI, 4 Independence Way, Princeton, NY
Madhu Sudan	MIT Laboratory for Computer Science, 545 Technology Square NE43-307, Cambridge, MA
Andrew Tomkins	IBM Almaden Research Center, 650 Harry Road, San Jose, CA

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 27, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/335305.335362 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Rob Barrett , Paul P. Maglio , Daniel C. Kellem, How to personalize the Web, Proceedings of the SIGCHI conference on Human factors in computing systems, p.75-82, March 22-27, 1997, Atlanta, Georgia, United States [doi>10.1145/258549.258595]
	2	Moses Charikar , Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins, On targeting Markov segments, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.99-108, May 01-04, 1999, Atlanta, Georgia, United States [doi>10.1145/301250.301280]
	3	M. Grotschel, L. Lovasz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimizations. Springer-Verlag, Berlin, 1987.
	4	Roger A. Horn , Charles R. Johnson, Matrix analysis, Cambridge University Press, New York, NY, 1985
	5	S. Karlin and H. Taylor A First Course in Stochastic Processes, Academic Press, 1975.
	6	J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. The University Series in Higher Mathematics. Van Nostrand, Princeton, NJ, 1966.
	7	H. Lieberman. An agent that assists web browsing. Proceedings of tJCAI, 1995.
	8	H. Minc. Nonnegative Matrices. John Wiley and Sons, New York, 1988.
	9	Rajeev Motwani , Prabhakar Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995
	10	Ted Selker, COACH: a teaching agent that learns, Communications of the ACM, v.37 n.7, p.92-99, July 1994 [doi>10.1145/176789.176799]

CITED BY 4

	Fabien Mathieu , Mohamed Bouklit, The effect of the back button in a random walk: application for pagerank, Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, May 19-21, 2004, New York, NY, USA
	I. S. Nekrestyanov , N. V. Panteleeva, Text Retrieval Systems for the Web, Programming and Computing Software, v.28 n.4, p.207-225, July-August 2002
	Stefan Kiefer , Michael Luttenberger , Javier Esparza, On the convergence of Newton's method for monotone systems of polynomial equations, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	Kousha Etessami , Mihalis Yannakakis, Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations, Journal of the ACM (JACM), v.56 n.1, p.1-66, January 2009