Back to Results
First PageMeta Content
Recursion / Higher-order functions / Functional languages / Mathematical logic / Computability theory / Binary tree / Map / Tree / Binary search tree / Computer programming / Computing / Software engineering


Balancing lists: a proof pearl? Guyslain Naves1 and Arnaud Spiwack2 1 Aix Marseille Université, CNRS, LIF UMR 7279, 13288, Marseille, France
Add to Reading List

Document Date: 2014-06-13 08:06:32

Open Document

File Size: 394,99 KB

Share Result on Facebook

City

Paris / Marseille / /

Company

APL / Let us / /

Country

France / /

/

IndustryTerm

binary exponentiation algorithm / recursive exponentiation algorithm / linear-time algorithm / folklore algorithms / latter exponentiation algorithm / tail-recursive binary exponentiation algorithm / balanced binary search trees / balancing algorithm / /

OperatingSystem

Aix / /

Organization

European Research Council / /

Position

Elt head / /

Technology

structurally recursive exponentiation algorithm / tail-recursive binary exponentiation algorithm / binary exponentiation algorithm / folklore algorithms / linear-time algorithm / same algorithm / balancing algorithm / latter exponentiation algorithm / /

SocialTag