Expressiveness and Complexity of Generic Graph Machines

M. Gemis, J. Paredaens, P. Peelman, J. Van den Bussche

Open source

DOI: 10.1007/s002240000087
Published: 1998-05-01
Container: Theory of Computing Systems
Publisher: Springer Science and Business Media LLC
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/s002240000087,
  title = {Expressiveness and Complexity of Generic Graph Machines},
  author = {M. Gemis and J. Paredaens and P. Peelman and J. Van den Bussche},
  year = {1998},
  journal = {Theory of Computing Systems},
  doi = {10.1007/s002240000087},
  url = {https://doi.org/10.1007/s002240000087}
}

RIS

TY  - JOUR
TI  - Expressiveness and Complexity of Generic Graph Machines
AU  - M. Gemis
AU  - J. Paredaens
AU  - P. Peelman
AU  - J. Van den Bussche
PY  - 1998
JO  - Theory of Computing Systems
DO  - 10.1007/s002240000087
UR  - https://doi.org/10.1007/s002240000087
ER  -

APA

Gemis, M., Paredaens, J., Peelman, P., & Bussche, J. V. D. (1998). Expressiveness and Complexity of Generic Graph Machines. Theory of Computing Systems. https://doi.org/10.1007/s002240000087

Source records

crossref · retrieved 2026-11-07T10:52:14.370Z