Skip to main navigation
Skip to search
Skip to main content

York Research Database Home

Help & FAQ

Home
Researchers
Departments and Units
Publications
Projects
Activities
Datasets
Prizes

Search by expertise, name or affiliation

Computational Completeness of Simple Graph Programs

Plump, D. (Invited speaker)

Computer Science

Activity: Talk or presentation › Invited talk

Period	28 May 2014
Held at	University of Bremen, Germany

Powered by Pure, Scopus & Elsevier Fingerprint Engine™

All content on this site: Copyright © 2025 York Research Database, its licensors, and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

York Research Database data protection policy

About web accessibility

Report vulnerability