Smoothed Analysis of Binary Search Trees

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Article , Conference object 01 Jan 2005 Netherlands Publisher:Springer Berlin HeidelbergJournal:Theoretical Computer Science, volume 378, pages 292-315 (issn: 0304-3975,

Copyright policy )Funded by:FCT | D4

Authors: Manthey, Bodo; Reischuk, Rüdiger;

doi: 10.1007/11602613_49 , 10.1016/j.tcs.2007.02.035

Smoothed Analysis of Binary Search Trees

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Country

Netherlands

Related Organizations

University of Twente
Netherlands
University of Lübeck
Germany
Saarland University
Germany
Universitäres Kinderwunschzentrum Lübeck
Germany

Keywords

Data structures, permutations, EWI-21276, Binary search trees, Permutations, IR-79427, Theoretical Computer Science, Discrete perturbations, binary search trees, Smoothed analysis, discrete perturbations, Searching and sorting, Smoothed Analysis, smoothed analysis, Computer Science(all)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	21
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average