pith. sign in

Title resolution pending

Bellantoni, S · 1992 · DOI 10.1007/bf01201998

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.LO 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Mathematical Informatics: Algorithms

cs.LO · 2026-05-18 · unverdicted · novelty 6.0

Algorithms are defined as finite directed graphs with edges labelled by partial maps on abstract data structures, with programs implementing them via step correspondences that preserve data transformations in monoid-action models.

citing papers explorer

Showing 1 of 1 citing paper.

  • Mathematical Informatics: Algorithms cs.LO · 2026-05-18 · unverdicted · none · ref 3

    Algorithms are defined as finite directed graphs with edges labelled by partial maps on abstract data structures, with programs implementing them via step correspondences that preserve data transformations in monoid-action models.