Searching Trees: An Essay

13 years 11 months ago

Download www.informatik.uni-trier.de

We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimensions of this topic.

Henning Fernau, Daniel Raible

Real-time Traffic

Applied Computing | Historical Dimensions | Run Time Analysis | Search Tree Algorithms | TAMC 2009 |

claim paper

» Web Wisdom An essay on how Web 20 and Semantic Web can foster a global knowledge society

» Internet Research Support System An Application for Immediate Feedback in Authentic Intern...

» Modeling Students Reasoning About Qualitative Physics Heuristics for Abductive Proof Searc...

» NearestNeighbor Search on a Time Budget via MaxMargin Trees

» Maximum innerproduct search using cone trees

» Generalized MonteCarlo Tree Search Extensions for General Game Playing

» Trees with exponentially growing costs

» Profiles of Random Trees Limit Theorems for Random Recursive Trees and Binary Search Trees

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	TAMC
Authors	Henning Fernau, Daniel Raible

Comments (0)

Sciweavers

Searching Trees: An Essay

Applied Computing | Historical Dimensions | Run Time Analysis | Search Tree Algorithms | TAMC 2009 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers