default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDScientific Annals of Computer Science, Volume 30
Volume 30, Number 1, 2020
- Jan A. Bergstra
:
Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers. 1-24 - Shibsankar Das:
An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs. 25-37 - Shibsankar Das:
A Modified Decomposition Algorithm for Maximum Weight Bipartite Matching and Its Experimental Evaluation. 39-67 - Ferry Timmers, Jan Friso Groote:
A Complete Axiomatisation for Probabilistic Trace Equivalence. 69-104
Volume 30, Number 2, December 2020
- Jan A. Bergstra:
Instruction Sequence Faults with Formal Change Justification. 105-166 - Jan A. Bergstra:
Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation. 167-203 - Cornelis A. Middelburg:
Probabilistic Process Algebra and Strategic Interleaving. 205-243
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-07 23:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
