On the public citation graph
Programming means and the solution of logical problems in software systems (basic concepts of the L2 language)
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00264290openalex-snapshot
A model for data structures and its applications. I
inferredcites →https://doi.org/10.1007/bf01068271openalex-snapshot
An extension of the programming language TREE in the PROEKT system
inferredcites →https://doi.org/10.1007/bf01071468openalex-snapshot
Syntax and semantics of formal languages
inferredcites →https://doi.org/10.1007/bf01073232openalex-snapshot
Software for an automatic system of design of computers and systems (PROEKT)
inferredcites →https://doi.org/10.1007/bf01073233openalex-snapshot
Automatic programming in the ?PROEKT? system
inferredcites →https://doi.org/10.1016/0066-4138(69)90036-6openalex-snapshot
Data structures and their representation in storage
inferredcites →https://doi.org/10.1016/c2013-0-07864-4openalex-snapshot
Annual Review in Automatic Programming
inferredcites →https://doi.org/10.1016/s0022-0000(71)80011-9openalex-snapshot
Towards a theory of data structures
inferredcites →https://doi.org/10.1016/s0022-0000(71)80034-xopenalex-snapshot
Data graphs and addressing schemes
inferredcites →https://doi.org/10.1145/362619.362627openalex-snapshot
A language extension for graph processing and its formal semantics
inferredcites →https://doi.org/10.1145/362759.362764openalex-snapshot
Toward an understanding of data structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_60openalex-snapshot
Algebras with approximation and recursive data structures
inferred← citeshttps://doi.org/10.1007/bf01069296openalex-snapshot
Interactive data structure processing
inferred← citeshttps://doi.org/10.1007/bf01069329openalex-snapshot
Instrumental means for the design of programs for processing mathematical texts
inferred← citeshttps://doi.org/10.1007/bf01069345openalex-snapshot
Algebraic treatment of data structures
inferred← citeshttps://doi.org/10.1007/bf01069432openalex-snapshot
Experimental development of software for an advanced computer array
inferred← citeshttps://doi.org/10.1007/bf01070415openalex-snapshot
Theory of data structures and synchronous parallel computations
inferred← citeshttps://doi.org/10.1007/bf01071356openalex-snapshot
Discrete systems and problems of their realization. II
inferred← citeshttps://doi.org/10.1007/bf01071384openalex-snapshot
A class of data-processing systems oriented toward mathematical investigations
inferred← citeshttps://doi.org/10.1007/bf01074229openalex-snapshot
Generalized context-free grammar of algorithmic language algol 68
inferred← citeshttps://doi.org/10.1007/bf01074920openalex-snapshot
Algebras with approximation and recursive data structures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.