Amanote Research

Amanote Research

    RegisterSign In

Splaying a Search Tree in Preorder Takes Linear Time

ACM SIGACT News
doi 10.1145/156063.156067
Full Text
Open PDF
Abstract

Available in full text

Date

April 1, 1993

Authors
R. ChaudhuriH. Höft
Publisher

Association for Computing Machinery (ACM)


Related search

A Constant Update Time Finger Search Tree

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

A Linear-Time Algorithm for Broadcast Domination in a Tree

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2009English

A Practical Concurrent Binary Search Tree

ACM SIGPLAN Notices
Computer Science
2010English

Monte Carlo Tree Search in Hex

IEEE Transactions on Computational Intelligence and AI in Games
ControlSystems EngineeringElectronic EngineeringElectricalArtificial IntelligenceSoftware
2010English

A Parallel Monte-Carlo Tree Search Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Efficient Tree Search in Encrypted Data

2004English

The Time It Takes to Turn a Memory Into a Template

Journal of Vision
OphthalmologySensory Systems
2013English

Search Problems in the Decision Tree Model

English

Self-Organizing Linear Search

ACM Computing Surveys
Computer ScienceTheoretical Computer Science
1985English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy