| 6201 | A Menagerie of Non-Finitely Based Process Semantics over BPA… (10.7146/brics.v3i23.20003) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6202 | The Buffer Tree: A New Technique for Optimal I/O Algorithms (10.7146/brics.v3i28.20009) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6203 | A Computational Formalization for Partial Evaluation (Extend… (10.7146/brics.v3i34.20015) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6204 | Weak Semantics Based on Lighted Button Pressing Experiments.… (10.7146/brics.v3i43.20025) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6205 | Combining Algebraic and Set-Theoretic Specifications (Extend… (10.7146/brics.v3i52.20055) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6206 | Modeling, Sharing, and Recursion for Weak Reduction Strategi… (10.7146/brics.v3i56.18681) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6207 | Compositional and Symbolic Model-Checking of Real-Time Syste… (10.7146/brics.v3i59.18770) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6208 | Lower Bounds for Dynamic Transitive Closure, Planar Point Lo… (10.7146/brics.v3i9.19972) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6209 | Timed Modal Specification —Theory and Tools (10.7146/brics.v4i11.18802) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6210 | Bistructures, Bidomains and Linear Logic (10.7146/brics.v4i15.18805) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6211 | Linear Hashing (10.7146/brics.v4i16.18808) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6212 | Abstract Interpretation in the Operational Semantics Hierarc… (10.7146/brics.v4i2.18781) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6213 | Searching Constant Width Mazes Captures the AC0 Hierarchy (10.7146/brics.v4i25.18951) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6214 | Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Ze… (10.7146/brics.v4i27.18953) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6215 | A Definability Theorem for First Order Logic (10.7146/brics.v4i3.18782) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6216 | Hardness Results for Dynamic Problems by Extensions of Fredm… (10.7146/brics.v4i32.18958) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6217 | Presheaf Models for the pi-Calculus (10.7146/brics.v4i34.18960) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6218 | A Theory of Recursive Domains with Applications to Concurren… (10.7146/brics.v4i35.18961) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6219 | Fast Distributed Algorithms for Brooks-Vizing Colourings (Ex… (10.7146/brics.v4i37.18963) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6220 | A Relational Account of Call-by-Value Sequentiality (10.7146/brics.v4i41.18967) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6221 | What Is a ‘Good’ Encoding of Guarded Choice? (10.7146/brics.v4i45.19266) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6222 | A Simple Solution to Type Specialization (10.7146/brics.v5i1.19275) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6223 | Compiling Actions by Partial Evaluation, Revisited (10.7146/brics.v5i13.19285) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6224 | The Hardness of Speeding-up Knapsack (10.7146/brics.v5i14.19286) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6225 | Generating Hard Tautologies Using Predicate Logic and the Sy… (10.7146/brics.v5i19.19425) | References ORCID License | 22.58 | 1 | 1601-5355 |