Implementing Binary Search Trees in GP 2 (Extended Abstract)

Plump, DETLEF orcid.org/0000-0002-1148-822X and ISMAILI ALAOUI, ZIAD (2026) Implementing Binary Search Trees in GP 2 (Extended Abstract). In: Proceedings 16th International Workshop on Graph Computation Models (GCM 2025). Electronic Proceedings in Theoretical Computer Science. Open Publishing Association, pp. 6-12.

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© Z. Ismaili Alaoui and D. Plump
Dates:
  • Published: 26 January 2026
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Date Deposited: 29 Jan 2026 14:00
Last Modified: 29 Jan 2026 14:00
Published Version: https://doi.org/10.4204/EPTCS.440.2
Status: Published
Publisher: Open Publishing Association
Series Name: Electronic Proceedings in Theoretical Computer Science
Identification Number: 10.4204/EPTCS.440.2
Open Archives Initiative ID (OAI ID):

Download

Published Version

Filename: 2601.03897v1.pdf

Description: Implementing Binary Search Trees in GP 2

Licence: CC-BY 2.5

CLICK TO DOWNLOAD [thumbnail of Implementing Binary Search Trees in GP 2]

Export

Statistics

View Altmetric information about this item.


CORE (COnnecting REpositories)