Weak associativity and restricted rotation
type: Item
instance of: scholarly article
title: Weak associativity and restricted rotation
zbMATH Open document ID: 1209.68351
published in: Information Processing Letters
publication date: 2010-08-16T00:00:00Z
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5771251
zbMATH Keywords: combinatorial problems
zbMATH Keywords: binary trees
zbMATH Keywords: rotation
zbMATH Keywords: weak associativity
author: Jean Pallo
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.01.014
OpenAlex ID: W1980291790
cites work: Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
cites work: Restricted rotation distance between binary trees.
cites work: BOUNDING RIGHT-ARM ROTATION DISTANCES
cites work: A decidable word problem without equivalent canonical term rewriting system
cites work: An algebraic scheme associated with the non-commutative KP hierarchy and some of its extensions
cites work: From nonassociativity to solutions of the KP hierarchy
cites work: A new approach to deformation equations of noncommutative KP hierarchies
cites work: Q4165427
cites work: Quasigroups, loops, and associative laws
cites work: Effective splaying with restricted rotations
cites work: \(k\)-restricted rotation distance between binary trees
cites work: Enumerating, Ranking and Unranking Binary Trees
cites work: Generating binary trees by Glivenko classes on Tamari lattices
cites work: Right-arm rotation distance between binary trees
cites work: Q5422506
cites work: Algorithms and Data Structures
cites work: The On-Line Encyclopedia of Integer Sequences
DOI: 10.1016/J.IPL.2009.01.014
description: scientific article; zbMATH DE number 5771251