On the public citation graph

Theoretical Computer Science

https://doi.org/10.1142/1905

0 signed · 75 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.

Claim with ORCID

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.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11494645_30openalex-snapshot

Towards Computability of Higher Type Continuous Data

inferred← citeshttps://doi.org/10.1007/11805618_18openalex-snapshot

Dealing with Non-orientable Equations in Rewriting Induction

inferred← citeshttps://doi.org/10.1007/11965893_27openalex-snapshot

Containment of Conjunctive Queries over Databases with Null Values

inferred← citeshttps://doi.org/10.1007/3-540-33289-8_2openalex-snapshot

Vacuity-Oriented Generalized Yes/No Queries Addressed to Possibilistic Databases

inferred← citeshttps://doi.org/10.1007/3-540-36280-0_2openalex-snapshot

Emptiness Relations in Property Systems

inferred← citeshttps://doi.org/10.1007/3-540-40006-0_4openalex-snapshot

Semi-qualitative Reasoning about Distances: A Preliminary Report

inferred← citeshttps://doi.org/10.1007/3-540-44652-4_68openalex-snapshot

First-Order Characterization and Modal Analysis of Indiscernibility and Complementarity in Information Systems

inferred← citeshttps://doi.org/10.1007/3-540-45499-3_10openalex-snapshot

Meta Languages in Algebraic Compilers

inferred← citeshttps://doi.org/10.1007/3-540-45884-0_5openalex-snapshot

Theory of Judgments and Derivations

inferred← citeshttps://doi.org/10.1007/3-540-48196-6_2openalex-snapshot

Consistency Management in Runtime Evolving Concurrent Information Systems: A Co-nets-Based Approach

inferred← citeshttps://doi.org/10.1007/3-540-48958-4_9openalex-snapshot

Specialising Logic Programs with Respect to Call/Post Specifications

inferred← citeshttps://doi.org/10.1007/3-540-49213-5_12openalex-snapshot

An overview of compositional translations

inferred← citeshttps://doi.org/10.1007/3-540-49257-7_21openalex-snapshot

Tableau Techniques for Querying Information Sources through Global Schemas

inferred← citeshttps://doi.org/10.1007/3-540-49727-7_22openalex-snapshot

Program Analysis as Model Checking of Abstract Interpretations

inferred← citeshttps://doi.org/10.1007/3-540-57182-5_48openalex-snapshot

Observing located concurrency

inferred← citeshttps://doi.org/10.1007/3-540-58140-5_13openalex-snapshot

Application of typed lambda calculi in the untyped lambda calculus

inferred← citeshttps://doi.org/10.1007/3-540-58485-4_37openalex-snapshot

Stackability in the simply-typed call-by-value lambda calculus

inferred← citeshttps://doi.org/10.1007/3-540-60084-1_102openalex-snapshot

The pushdown method to optimize chain logic programs

inferred← citeshttps://doi.org/10.1007/3-540-60218-6_33openalex-snapshot

A trace consistent subset of PTL

inferred← citeshttps://doi.org/10.1007/3-540-60360-3_28openalex-snapshot

Natural-semantics-based abstract interpretation (preliminary version)

inferred← citeshttps://doi.org/10.1007/3-540-63620-x_61openalex-snapshot

Transformation of documents and schemas by patterns and contextual conditions

inferred← citeshttps://doi.org/10.1007/3-540-65306-6_24openalex-snapshot

Distributed versions of linear time temporal logic: A trace perspective

inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_19openalex-snapshot

Verifying Timing Properties of Concurrent Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_24openalex-snapshot

Real-Time Program Synthesis from Specifications

inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_3openalex-snapshot

Random Sampling Techniques in Parallel Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_14openalex-snapshot

Measure One Results in Computational Complexity Theory

inferred← citeshttps://doi.org/10.1007/978-1-4615-2786-2_5openalex-snapshot

Compositional Reasoning about Responsive Systems with Limited Resources

inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_49openalex-snapshot

Communication Complexity and BDD Lower Bound Techniques

inferred← citeshttps://doi.org/10.1007/978-3-319-10431-7_3openalex-snapshot

Completeness of Separation Logic with Inductive Definitions for Program Verification

inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_21openalex-snapshot

Gandy’s Theorem for Abstract Structures without the Equality Test

inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_27openalex-snapshot

Computational Aspects of Σ-Definability over the Real Numbers without the Equality Test

inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_10openalex-snapshot

On Polymorphic Recursion, Type Systems, and Abstract Interpretation

inferred← citeshttps://doi.org/10.1007/978-3-540-71200-8_1openalex-snapshot

Propositional Logics from Rough Set Theory

inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_2openalex-snapshot

Solving μ-Calculus Parity Games by Symbolic Planning

inferred← citeshttps://doi.org/10.1007/978-3-642-01530-4_2openalex-snapshot

Hybrid Genetic Programming and GMDH System: STROGANOFF

inferred← citeshttps://doi.org/10.1007/978-3-642-28667-4_2openalex-snapshot

Rough Sets

inferred← citeshttps://doi.org/10.1007/978-3-642-30344-9_14openalex-snapshot

Algebras for Information Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-31057-7_21openalex-snapshot

Soundness of Object-Oriented Languages with Coinductive Big-Step Semantics

inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_6openalex-snapshot

Two Dimensional Prefix Codes of Pictures

inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_7openalex-snapshot

Timed Rewriting Logic for the Specification of Time-Sensitive Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-77580-2_5openalex-snapshot

An introduction to compositional methods for concurrency and their application to real-time

inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_16openalex-snapshot

Beyond Modalities: Sufficiency and Mixed Algebras

inferred← citeshttps://doi.org/10.1007/978-81-322-1812-8_35-1openalex-snapshot

Algebraic Logic and Rough Set Theory

inferred← citeshttps://doi.org/10.1007/978-81-322-1812-8_35-2openalex-snapshot

Algebraic Logic and Rough Set Theory

inferred← citeshttps://doi.org/10.1007/978-81-322-2577-5_35openalex-snapshot

Algebraic Logic and Rough Set Theory

inferred← citeshttps://doi.org/10.1007/978-94-017-2798-3_5openalex-snapshot

Relational Proof Systems for Modal Logics

inferred← citeshttps://doi.org/10.1007/bf01053038openalex-snapshot

A duality between Pawlak's knowledge representation systems and bi-consequence systems

inferred← citeshttps://doi.org/10.1007/bfb0000504openalex-snapshot

An algebraic language processing environment

inferred← citeshttps://doi.org/10.1007/bfb0013841openalex-snapshot

Theorem proving for hierarchic first-order theories

inferred← citeshttps://doi.org/10.1007/bfb0014330openalex-snapshot

Some characteristics of strong innermost normalization

inferred← citeshttps://doi.org/10.1007/bfb0052380openalex-snapshot

An on-line problem database

inferred← citeshttps://doi.org/10.1007/bfb0054298openalex-snapshot

Realizability of monotone coinductive definitions and its application to program synthesis

inferred← citeshttps://doi.org/10.1007/bfb0055039openalex-snapshot

Deciding global partial-order properties

inferred← citeshttps://doi.org/10.1007/s10703-005-4592-0openalex-snapshot

Deciding Global Partial-Order Properties

inferred← citeshttps://doi.org/10.1007/s10992-010-9163-1openalex-snapshot

A Logic for Multiple-source Approximation Systems with Distributed Knowledge Base

inferred← citeshttps://doi.org/10.1016/0167-9236(94)90076-0openalex-snapshot

Logic decisions under constraints

inferred← citeshttps://doi.org/10.1016/b978-044451104-1/50022-8openalex-snapshot

Parametric Modeling

inferred← citeshttps://doi.org/10.1016/j.isatra.2010.08.003openalex-snapshot

LAN attack detection using Discrete Event Systems

inferred← citeshttps://doi.org/10.1016/j.jcss.2017.07.006openalex-snapshot

Rejecting jobs to minimize load and maximum flow-time

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80470-0openalex-snapshot

Tiles for Concurrent and Located Calculi

inferred← citeshttps://doi.org/10.1017/cbo9781316135228.001openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1017/cbo9781316135228.002openalex-snapshot

String matching

inferred← citeshttps://doi.org/10.1017/cbo9781316135228.003openalex-snapshot

Multiple string matching

inferred← citeshttps://doi.org/10.1017/cbo9781316135228.005openalex-snapshot

Regular expression matching

inferred← citeshttps://doi.org/10.1017/cbo9781316135228.006openalex-snapshot

Approximate matching

inferred← citeshttps://doi.org/10.1017/cbo9781316135228.008openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1017/s0960129500001420openalex-snapshot

Sheaf semantics for concurrent interacting objects

inferred← citeshttps://doi.org/10.1080/00207169108804002openalex-snapshot

A domain theoretic characterisation of the universal relation

inferred← citeshttps://doi.org/10.1080/15326349208807218openalex-snapshot

On conditional AstA : A Sample-Path Approach

inferred← citeshttps://doi.org/10.1142/s0129054114400127openalex-snapshot

ITERATION OF INVERTIBLE TRANSDUCTIONS

inferred← citeshttps://doi.org/10.1142/s021819400800391xopenalex-snapshot

SUPPORTING FORMAL VERIFICATION OF DIMA MULTI-AGENTS MODELS: TOWARDS A FRAMEWORK BASED ON MAUDE MODEL CHECKING

inferred← citeshttps://doi.org/10.1142/s1793005722500065openalex-snapshot

Topological Characterizations of Rough Set Theory Based on Quantum Logic

inferred← citeshttps://doi.org/10.1145/3394486.3403257openalex-snapshot

GHashing: Semantic Graph Hashing for Approximate Similarity Search in Graph Databases

inferred← citeshttps://doi.org/10.3166/jancl.18.137-152openalex-snapshot

Hyper arrow logic with indiscernibility and complementarity

inferred← citeshttps://doi.org/10.3182/20070523-3-es-4908.00031openalex-snapshot

ROBOT TASK SPECIFICATION AND EXECUTION THROUGH RELATIONAL POSITIONING

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.