On the public citation graph
Theory of data structures and synchronous parallel computations
0 signed · 44 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/bf01068582openalex-snapshot
Programming means and the solution of logical problems in software systems (basic concepts of the L2 language)
inferredcites →https://doi.org/10.1007/bf01071356openalex-snapshot
Discrete systems and problems of their realization. II
inferredcites →https://doi.org/10.1007/bf01071436openalex-snapshot
Automata theory and structural design problems of digital machines
inferredcites →https://doi.org/10.1007/bf01071468openalex-snapshot
Syntax and semantics of formal languages
inferredcites →https://doi.org/10.1007/bf01071592openalex-snapshot
On the automation of computer design
inferredcites →https://doi.org/10.1016/b978-0-12-161901-5.50023-6openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1145/356654.356659openalex-snapshot
Associative and Parallel Processors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-0476-1_1openalex-snapshot
Theoretical and Applied Programming
inferred← citeshttps://doi.org/10.1007/bf01068199openalex-snapshot
Data structures as sets with repeating elements
inferred← citeshttps://doi.org/10.1007/bf01068221openalex-snapshot
Generation of parallel programs from nonprocedural specifications
inferred← citeshttps://doi.org/10.1007/bf01068331openalex-snapshot
An algorithm for maximum desequencing of repetition-free loops
inferred← citeshttps://doi.org/10.1007/bf01068466openalex-snapshot
Organizing computations in multiprocessor computer systems
inferred← citeshttps://doi.org/10.1007/bf01068564openalex-snapshot
Equivalence in the complexity of several problems
inferred← citeshttps://doi.org/10.1007/bf01068683openalex-snapshot
Local optimization of colorings of graphs
inferred← citeshttps://doi.org/10.1007/bf01068847openalex-snapshot
Theoretical principles for designing discrete systems
inferred← citeshttps://doi.org/10.1007/bf01068912openalex-snapshot
General computation-organization principles for a multiprocessor structure
inferred← citeshttps://doi.org/10.1007/bf01068975openalex-snapshot
Implementation of asynchronous parallel computations in control space
inferred← citeshttps://doi.org/10.1007/bf01069345openalex-snapshot
Algebraic treatment of data structures
inferred← citeshttps://doi.org/10.1007/bf01069346openalex-snapshot
Finite state expressions in a system of algorithmic algebras with a commutative algebra of conditions
inferred← citeshttps://doi.org/10.1007/bf01070273openalex-snapshot
Design theory of multiprocessor computer hardware and software
inferred← citeshttps://doi.org/10.1007/bf01072018openalex-snapshot
Structure analysis of algorithms with the purpose of elucidating the possibilities of parallel execution
inferred← citeshttps://doi.org/10.1007/bf01072150openalex-snapshot
Operator composition in a multidimensional structurally oriented model of parallel computations and systems
inferred← citeshttps://doi.org/10.1007/bf01072292openalex-snapshot
Theory of language processors and parallel computations
inferred← citeshttps://doi.org/10.1007/bf01072298openalex-snapshot
Program deparallelization using the method of successive penetration
inferred← citeshttps://doi.org/10.1007/bf01072303openalex-snapshot
Representation of the algorithm for solving a system of equations with a three-diagonal matrix in a structural algorithmic algebra
inferred← citeshttps://doi.org/10.1007/bf01074527openalex-snapshot
Hierarchical graph structures and program facilities for their manipulation
inferred← citeshttps://doi.org/10.1007/bf01074664openalex-snapshot
Relations in algebras of data structures. I
inferred← citeshttps://doi.org/10.1007/bf01074880openalex-snapshot
Program specification and synthesis using systems of equations over data structures
inferred← citeshttps://doi.org/10.1007/bf01075125openalex-snapshot
Analytic transformations on a computer: State of the art and problems
inferred← citeshttps://doi.org/10.1007/bf01078491openalex-snapshot
Controlling spaces in asynchronous parallel computations
inferred← citeshttps://doi.org/10.1007/bf01078822openalex-snapshot
Method for design of program systems with special reference to debugging of the programs of parallel file-processing language
inferred← citeshttps://doi.org/10.1007/bf01085188openalex-snapshot
Methods and means of parallel processing of information
inferred← citeshttps://doi.org/10.1007/bf01130094openalex-snapshot
Formalized program specifications and transformation synthesis
inferred← citeshttps://doi.org/10.1007/bf01307028openalex-snapshot
Constructing a family of algorithmic languages for programming and design of multiprocessor computer systems
inferred← citeshttps://doi.org/10.1007/s10559-023-00619-6openalex-snapshot
PARCS Technology: Concept and Implementations
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.