Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms

Plump, Detlef orcid.org/0000-0002-1148-822X and Ismaili Alaoui, Ziad (Accepted: 2025) Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms. Logical Methods in Computer Science. ISSN: 1860-5974 (In Press)

Metadata

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

This is an author-produced version of the published paper. Uploaded in accordance with the University’s Research Publications and Open Access policy.
Dates:
  • Accepted: 15 January 2025
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Date Deposited: 10 Dec 2025 11:10
Last Modified: 12 Dec 2025 16:51
Published Version: https://doi.org/10.48550/arXiv.2501.09144
Status: In Press
Refereed: Yes
Identification Number: 10.48550/arXiv.2501.09144
Open Archives Initiative ID (OAI ID):

Download

Accepted Version


Under temporary embargo

Filename: 2501.09144v2.pdf

Description: Accepted manuscript

Licence: CC-BY 2.5

Request a copy

file not available

Export

Statistics

View Altmetric information about this item.


CORE (COnnecting REpositories)