Mathematical Structures in Computer Science

Papers
(The TQCC of Mathematical Structures in Computer Science is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-03-01 to 2024-03-01.)
ArticleCitations
Open Petri nets20
SMT-based verification of data-aware processes: a model-theoretic approach13
Quasi-Nelson algebras and fragments6
Three improvements to the top-down solver6
From Kruskal’s theorem to Friedman’s gap condition6
Syntax and models of Cartesian cubical type theory6
Bisimulation as a logical relation5
Two-level type theory and applications4
Languages of higher-dimensional automata4
Petri nets based on Lawvere theories4
Implicative algebras: a new foundation for realizability and forcing4
String diagram rewrite theory III: Confluence with and without Frobenius4
Bicategories in univalent foundations4
String diagram rewrite theory II: Rewriting with symmetric monoidal structure3
A categorical view of varieties of ordered algebras3
Cofree coalgebras and differential linear logic3
Denotational semantics for guarded dependent type theory3
Rewriting with generalized nominal unification3
Two decades of automatic amortized resource analysis3
Causal inference via string diagram surgery3
Back to the Coordinated Attack Problem2
Separating minimal valuations, point-continuous valuations, and continuous valuations2
Probability, valuations, hyperspace: Three monads on top and the support as a morphism2
Finitary monads on the category of posets2
A focused linear logical framework and its application to metatheory of object logics2
Strictifying and taming directed paths in Higher Dimensional Automata2
A domain-theoretic framework for robustness analysis of neural networks2
Implicit computation complexity in higher-order programming languages2
Type-based analysis of logarithmic amortised complexity2
Formalising nominal C-unification generalised with protected variables2
Freely adjoining monoidal duals2
Products and projective limits of continuous valuations on T0 spaces2
Proof-relevance in Bishop-style constructive mathematics2
Convenient antiderivatives for differential linear categories2
Dilations and information flow axioms in categorical probability1
On reduction and normalization in the computational core1
Forward analysis for WSTS, part I: completions1
The role of linearity in sharing analysis1
Elementary fibrations of enriched groupoids1
A (machine-oriented) logic based on pattern matching1
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability1
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability1
The costructure–cosemantics adjunction for comodels for computational effects1
Robustness, Scott continuity, and computability1
Bounded ACh unification1
Convolution and concurrency1
Detection and diagnosis of deviations in distributed systems of autonomous agents1
Branching-time logics and fairness, revisited1
Indexed type theories1
Weakest preconditions in fibrations1
Cubical methods in homotopy type theory and univalent foundations1
Coherence for bicategorical cartesian closed structure1
A general framework for the semantics of type theory1
Computing knowledge in equational extensions of subterm convergent theories1
Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention1
Constructive sheaf models of type theory1
Computing with continuous objects: a uniform co-inductive approach1
Consistent disjunctive sequent calculi and Scott domains1
Algebras of UTxO blockchains1
A unified approach to some non-Hausdorff topological properties1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem1
Preserving consistency in geometric modeling with graph transformations1
Confluence of algebraic rewriting systems1
Nilpotent types and fracture squares in homotopy type theory1
Doctrines, modalities and comonads1
Witness algebra and anyon braiding1
Indexed and fibered structures for partial and total correctness assertions1
Quantifiers on languages and codensity monads1
Rogers semilattices of punctual numberings1
Z property for the shuffling calculus1
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs1
Encodings of Turing machines in linear logic1
CHAD for expressive total languages1
Modal descent1
Synthetic topology in Homotopy Type Theory for probabilistic programming1
Substitution Principle and semidirect products1
Metric monads1
Stochastic linearized generalized alternating direction method of multipliers: Expected convergence rates and large deviation properties1
Quantum circuits generating four-qubit maximally entangled states1
0.028562068939209