An improved kernel size for rotation distance in binary trees

Authors:
Joan M. Lucas
Affiliations:
Department of Computer Science, The College at Brockport, State University of New York, 350 New Campus Drive, Brockport, NY 14420-2933, USA
Venue:
Information Processing Letters
Year:
2010

Citing 19
Cited 1

Self-adjusting binary search trees

Journal of the ACM (JACM)
On the rotation distance in the lattice of binary trees

Information Processing Letters
The rotation graph of binary trees is hamiltonian

Journal of Algorithms
On the rotation distance of binary trees

Information Processing Letters
Some properties of the rotation lattice of binary trees

The Computer Journal
On the upper bound on the rotation distance of binary trees

Information Processing Letters
Generating binary trees by transpositions

Journal of Algorithms
A shortest path metric on unlabeled binary trees

Pattern Recognition Letters
On rotations and the generation of binary trees

Journal of Algorithms
Generating binary trees using rotations

Journal of the ACM (JACM)
General balanced trees

Journal of Algorithms
Graph of triangulations of a convex polygon and tree of triangulations

Computational Geometry: Theory and Applications
Mental imagery in program design and visual programming

International Journal of Human-Computer Studies - Best of empirical studies of programmers 7
Vertex cover: further observations and further improvements

Journal of Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization

ACM SIGACT News
Rotation distance is fixed-parameter tractable

Information Processing Letters
The lost continent of polynomial time: preprocessing and kernelization

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity

Parameterized Complexity

Lower bounds on the rotation distance of binary trees

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

Direct Anonymous Attestation (DAA) is a cryptographic scheme that enables remote authentication of a platform while preserving the privacy of the user of the platform. The DAA scheme developed by Brickell, Camenisch, and Chen has been adopted by the ...