Tree exploration with logarithmic memory

doi:10.1145/1921659.1921663

Tree exploration with logarithmic memory

Full Text:

PDF

Buy this Article

Authors:	Christoph Ambühl	University of Liverpool, Liverpool, UK
	Leszek Gąsieniec	University of Liverpool, Liverpool, UK
	Andrzej Pelc	Université du Québec en Outaouais, Gatineau, Québec, Canada
	Tomasz Radzik	King's College London, London, UK
	Xiaohui Zhang	University of Liverpool, Liverpool, UK

	2011 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 5 · Downloads (12 Months): 67 · Downloads (cumulative): 242 · Citation Count: 3

Published in:

	· Journal
	ACM Transactions on Algorithms (TALG) TALG Homepage archive
	Volume 7 Issue 2, March 2011 Article No. 17 ACM New York, NY, USA table of contents doi>10.1145/1921659.1921663

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: algorithms combinatorial algorithms computations on discrete structures distributed algorithms graph exploration graph labeling network problems pattern matching small memory theory

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player