| 1 | On provably disjoint NP-pairs (10.7146/brics.v1i36.21607) | References ORCID License | 129.32 | 52 |
| 2 | Refocusing in Reduction Semantics (10.7146/brics.v11i26.21851) | References ORCID License | 123.99 | 44 |
| 3 | Decidability Issues for Petri Nets (10.7146/brics.v1i8.21662) | References ORCID License | 120.96 | 40 |
| 4 | A Group Signature Scheme Based on an RSA-Variant (10.7146/brics.v5i27.19433) | References ORCID License | 114.86 | 33 |
| 5 | Cache Oblivious Search Trees via Binary Trees of Small Heigh… (10.7146/brics.v8i36.21696) | References ORCID License | 112.89 | 31 |
| 6 | MONA: Monadic Second-Order Logic in Practice (10.7146/brics.v2i21.19923) | References ORCID License | 107.35 | 26 |
| 7 | Modelling and Analysis of a Collision Avoidance Protocol usi… (10.7146/brics.v3i24.20005) | References ORCID License | 107.35 | 26 |
| 8 | Cuckoo Hashing (10.7146/brics.v8i32.21692) | References ORCID License | 107.35 | 26 |
| 9 | Formal Modeling and Analysis of an Audio/Video Protocol: An… (10.7146/brics.v4i31.18957) | References ORCID License | 102.13 | 22 |
| 10 | Balls and Bins: A Study in Negative Dependence (10.7146/brics.v3i25.20006) | References ORCID License | 100.68 | 21 |
| 11 | Relational Reasoning about Contexts (10.7146/brics.v4i24.18950) | References ORCID License | 100.68 | 21 |
| 12 | From HUPPAAL to UPPAAL - A Translation from Hierarchical Tim… (10.7146/brics.v8i11.20467) | References ORCID License | 97.58 | 19 |
| 13 | From Interpreter to Compiler and Virtual Machine: A Function… (10.7146/brics.v10i14.21784) | References ORCID License | 95.91 | 18 |
| 14 | Minimum-Cost Reachability for Priced Timed Automata (10.7146/brics.v8i3.20457) | References ORCID License | 95.91 | 18 |
| 15 | Bisimulation for Labelled Markov Processes (10.7146/brics.v4i4.18783) | References ORCID License | 94.15 | 17 |
| 16 | A Generalisation, a Simplification and some Applications of… (10.7146/brics.v7i45.20212) | References ORCID License | 94.15 | 17 |
| 17 | Cryptography in the Bounded Quantum Storage Model (10.7146/brics.v12i20.21886) | References ORCID License | 88.21 | 14 |
| 18 | A Compositional Proof System for the Modal mu-Calculus (10.7146/brics.v1i34.21609) | References ORCID License | 88.21 | 14 |
| 19 | Open Maps (at) Work (10.7146/brics.v2i23.19925) | References ORCID License | 88.21 | 14 |
| 20 | The Meaning of Types From Intrinsic to Extrinsic Semantics (10.7146/brics.v7i32.20167) | References ORCID License | 88.21 | 14 |
| 21 | Marked Ancestor Problems (10.7146/brics.v5i16.21956) | References ORCID License | 85.96 | 13 |
| 22 | Verifiable Encryption and Applications to Group Signatures a… (10.7146/brics.v5i32.19438) | References ORCID License | 85.96 | 13 |
| 23 | Hashing Functions can Simplify Zero-Knowledge Protocol Desig… (10.7146/brics.v1i39.21604) | References ORCID License | 83.55 | 12 |
| 24 | A Modular SOS for Action Notation (10.7146/brics.v6i56.20126) | References ORCID License | 83.55 | 12 |
| 25 | Deciding Framed Bisimilarity (10.7146/brics.v9i25.21741) | References ORCID License | 83.55 | 12 |
| 26 | A Calculus for Context-Awareness (10.7146/brics.v12i27.21894) | References ORCID License | 80.94 | 11 |
| 27 | Models for Concurrency (10.7146/brics.v1i12.21658) | References ORCID License | 80.94 | 11 |
| 28 | Guided Synthesis of Control Programs for a Batch Plant using… (10.7146/brics.v7i37.20203) | References ORCID License | 80.94 | 11 |
| 29 | Efficient Protocols based on Probabilistic Encryption using… (10.7146/brics.v7i5.20133) | References ORCID License | 80.94 | 11 |
| 30 | Universal Hash Proofs and a Paradigm for Adaptive Chosen Cip… (10.7146/brics.v8i37.21697) | References ORCID License | 80.94 | 11 |
| 31 | Efficient Guiding Towards Cost-Optimality in UPPAAL (10.7146/brics.v8i4.20458) | References ORCID License | 80.94 | 11 |
| 32 | Decidability of Systems of Set Constraints with Negative Con… (10.7146/brics.v1i32.21611) | References ORCID License | 78.10 | 10 |
| 33 | A HOL Basis for Reasoning about Functional Programs (10.7146/brics.v1i44.21598) | References ORCID License | 78.10 | 10 |
| 34 | UPPAAL—a Tool Suite for Automatic Verification of Real–Time… (10.7146/brics.v3i58.18769) | References ORCID License | 78.10 | 10 |
| 35 | Bisimulations for Asynchronous Mobile Processes (10.7146/brics.v3i8.19971) | References ORCID License | 78.10 | 10 |
| 36 | Measures on Hidden Markov Models (10.7146/brics.v6i6.20063) | References ORCID License | 78.10 | 10 |
| 37 | A Denotational Investigation of Defunctionalization (10.7146/brics.v7i47.20214) | References ORCID License | 78.10 | 10 |
| 38 | Compact Representations of BL-Algebras (10.7146/brics.v9i23.21739) | References ORCID License | 78.10 | 10 |
| 39 | A Rational Deconstruction of Landin's SECD Machine (10.7146/brics.v10i33.21801) | References ORCID License | 75.00 | 9 |
| 40 | Dictionaries on AC^0 RAMs: Query Time Theta(√log n/log log n… (10.7146/brics.v4i14.21678) | References ORCID License | 75.00 | 9 |
| 41 | Multiparty Computation from Threshold Homomorphic Encryption (10.7146/brics.v7i14.20141) | References ORCID License | 75.00 | 9 |
| 42 | Static Analysis for Dynamic XML (10.7146/brics.v9i24.21740) | References ORCID License | 75.00 | 9 |
| 43 | Online On-the-Fly Testing of Real-time Systems (10.7146/brics.v10i49.21821) | References ORCID License | 71.57 | 8 |
| 44 | Precise Analysis of String Expressions (10.7146/brics.v10i5.21776) | References ORCID License | 71.57 | 8 |
| 45 | A Study of Syntactic and Semantic Artifacts and its Applicat… (10.7146/brics.v15i3.21938) | References ORCID License | 71.57 | 8 |
| 46 | From Timed Automata to Logic - and Back (10.7146/brics.v2i2.19504) | References ORCID License | 71.57 | 8 |
| 47 | BDD Algortihms and Cache Misses (10.7146/brics.v3i26.20007) | References ORCID License | 71.57 | 8 |
| 48 | Objects as Mobile Processes (10.7146/brics.v3i38.20020) | References ORCID License | 71.57 | 8 |
| 49 | How to Believe a Machine-Checked Proof (10.7146/brics.v4i18.18945) | References ORCID License | 71.57 | 8 |
| 50 | Optimal Time-Space Trade-Offs for Sorting (10.7146/brics.v5i10.19282) | References ORCID License | 71.57 | 8 |
| 51 | Assessing the Overhead of ML Exceptions by Selective CPS Tra… (10.7146/brics.v5i15.19287) | References ORCID License | 71.57 | 8 |
| 52 | Foundations of Modular SOS (10.7146/brics.v6i54.20124) | References ORCID License | 71.57 | 8 |
| 53 | Domain Theory for Concurrency (10.7146/brics.v10i43.21815) | References ORCID License | 67.73 | 7 |
| 54 | Congruences for Contextual Graph-Rewriting (10.7146/brics.v11i11.21836) | References ORCID License | 67.73 | 7 |
| 55 | Finitisation in Bounded Arithmetic (10.7146/brics.v1i23.21644) | References ORCID License | 67.73 | 7 |
| 56 | Bisimulation from Open Maps (10.7146/brics.v1i7.21663) | References ORCID License | 67.73 | 7 |
| 57 | An Expressively Complete Linear Time Temporal Logic for Mazu… (10.7146/brics.v3i62.18563) | References ORCID License | 67.73 | 7 |
| 58 | Proving in Zero-Knowledge that a Number is the Product of Tw… (10.7146/brics.v5i29.19435) | References ORCID License | 67.73 | 7 |
| 59 | Predicate Abstraction for Dense Real-Time Systems (10.7146/brics.v8i44.21704) | References ORCID License | 67.73 | 7 |
| 60 | Timed Automata May Cause Some Troubles (10.7146/brics.v9i35.21750) | References ORCID License | 67.73 | 7 |
| 61 | New Algorithms for Exact Satisfiability (10.7146/brics.v10i30.21798) | References ORCID License | 63.38 | 6 |
| 62 | Bounds on Iterations of Asymptotically Quasi-Nonexpansive Ma… (10.7146/brics.v10i51.21823) | References ORCID License | 63.38 | 6 |
| 63 | The METAFRONT System: Extensible Parsing and Transformation (10.7146/brics.v10i7.21778) | References ORCID License | 63.38 | 6 |
| 64 | Maker-Maker and Maker-Breaker Games are PSPACE-Complete (10.7146/brics.v11i14.21839) | References ORCID License | 63.38 | 6 |
| 65 | Profunctors, Open Maps and Bisimulation (10.7146/brics.v11i22.21847) | References ORCID License | 63.38 | 6 |
| 66 | Optimal Strategies in Priced Timed Game Automata (10.7146/brics.v11i4.21829) | References ORCID License | 63.38 | 6 |
| 67 | A Dynamic Continuation-Passing Style for Dynamic Delimited C… (10.7146/brics.v12i16.21882) | References ORCID License | 63.38 | 6 |
| 68 | Secure Computing, Economy, and Trust: A Generic Solution for… (10.7146/brics.v12i18.21884) | References ORCID License | 63.38 | 6 |
| 69 | Type Checking with XML Schema in XACT (10.7146/brics.v12i31.21898) | References ORCID License | 63.38 | 6 |
| 70 | Complexity Results for Model Checking (10.7146/brics.v2i18.19920) | References ORCID License | 63.38 | 6 |
| 71 | Cut-Elimination for Full Intuitionistic Linear Logic (10.7146/brics.v3i10.19973) | References ORCID License | 63.38 | 6 |
| 72 | Regular Trace Event Structures (10.7146/brics.v3i32.20012) | References ORCID License | 63.38 | 6 |
| 73 | Presheaf Models for Concurrency (10.7146/brics.v3i35.20017) | References ORCID License | 63.38 | 6 |
| 74 | Pushdown Processes: Games and Model Checking (10.7146/brics.v3i54.20057) | References ORCID License | 63.38 | 6 |
| 75 | Finitely Presented Heyting Algebras (10.7146/brics.v5i30.19436) | References ORCID License | 63.38 | 6 |
| 76 | Derandomizing Arthur-Merlin Games using Hitting Sets (10.7146/brics.v6i47.20117) | References ORCID License | 63.38 | 6 |
| 77 | Towards a Theory of Regular MSC Languages (10.7146/brics.v6i52.20122) | References ORCID License | 63.38 | 6 |
| 78 | A Modular SOS for ML Concurrency Primitives (10.7146/brics.v6i57.20127) | References ORCID License | 63.38 | 6 |
| 79 | Linear Parametric Model Checking of Timed Automata (10.7146/brics.v8i5.20459) | References ORCID License | 63.38 | 6 |
| 80 | On the Number of Maximal Independent Sets in a Graph (10.7146/brics.v9i15.21733) | References ORCID License | 63.38 | 6 |
| 81 | Deriving Bisimulation Congruences: 2-Categories vs. Precateg… (10.7146/brics.v10i1.21772) | References ORCID License | 58.36 | 5 |
| 82 | General Logical Metatheorems for Functional Analysis (10.7146/brics.v12i21.21887) | References ORCID License | 58.36 | 5 |
| 83 | A Formal Model for Context-Awareness (10.7146/brics.v13i2.21908) | References ORCID License | 58.36 | 5 |
| 84 | Complexity of Nondeterministic Functions (10.7146/brics.v1i2.21668) | References ORCID License | 58.36 | 5 |
| 85 | Strong Concatenable Processes: An Approach to the Category o… (10.7146/brics.v1i33.21610) | References ORCID License | 58.36 | 5 |
| 86 | Hardware Verification using Monadic Second-Order Logic (10.7146/brics.v2i7.19509) | References ORCID License | 58.36 | 5 |
| 87 | The I/O-Complexity of Ordered Binary-Decision Diagram Manipu… (10.7146/brics.v3i29.20010) | References ORCID License | 58.36 | 5 |
| 88 | Statistical Secrecy and Multi-Bit Commitments (10.7146/brics.v3i45.20047) | References ORCID License | 58.36 | 5 |
| 89 | A Compositional Proof of a Real-Time Mutual Exclusion Protoc… (10.7146/brics.v3i55.20058) | References ORCID License | 58.36 | 5 |
| 90 | On the Distributed Complexity of Computing Maximal Matchings (10.7146/brics.v4i38.18964) | References ORCID License | 58.36 | 5 |
| 91 | Protein Folding in the 2D HP Model (10.7146/brics.v6i16.20073) | References ORCID License | 58.36 | 5 |
| 92 | Formal Verification of a Power Controller Using the Real-Tim… (10.7146/brics.v6i8.20065) | References ORCID License | 58.36 | 5 |
| 93 | Modelling and Control of Discrete Event Dynamic Systems (10.7146/brics.v7i26.20156) | References ORCID License | 58.36 | 5 |
| 94 | CPS Transformation of Beta-Redexes (10.7146/brics.v7i35.20170) | References ORCID License | 58.36 | 5 |
| 95 | MONA Implementation Secrets (10.7146/brics.v7i40.20206) | References ORCID License | 58.36 | 5 |
| 96 | The bigwig Project (10.7146/brics.v9i1.21718) | References ORCID License | 58.36 | 5 |
| 97 | Chromatic Number in Time O(2.4023^n) Using Maximal Independe… (10.7146/brics.v9i45.21760) | References ORCID License | 58.36 | 5 |
| 98 | Equational Axioms for Probabilistic Bisimilarity (Preliminar… (10.7146/brics.v9i6.21724) | References ORCID License | 58.36 | 5 |
| 99 | A Functional Correspondence between Monadic Evaluators and A… (10.7146/brics.v10i35.21803) | References ORCID License | 52.42 | 4 |
| 100 | An Operational Foundation for Delimited Continuations in the… (10.7146/brics.v11i29.21854) | References ORCID License | 52.42 | 4 |
| 101 | A Dynamic Continuation-Passing Style for Dynamic Delimited C… (10.7146/brics.v13i15.21920) | References ORCID License | 52.42 | 4 |
| 102 | Negative Dependence Through the FKG Inequality (10.7146/brics.v3i27.20008) | References ORCID License | 52.42 | 4 |
| 103 | The Computational Complexity of Some Problems of Linear Alge… (10.7146/brics.v3i33.20013) | References ORCID License | 52.42 | 4 |
| 104 | Error Correcting Codes, Perfect Hashing Circuits, and Determ… (10.7146/brics.v4i17.18813) | References ORCID License | 52.42 | 4 |
| 105 | Span Programs and General Secure Multi-Party Computation (10.7146/brics.v4i28.18954) | References ORCID License | 52.42 | 4 |
| 106 | First-Order Logic with Two Variables and Unary Temporal Logi… (10.7146/brics.v4i5.18784) | References ORCID License | 52.42 | 4 |
| 107 | Migration = Cloning ; Aliasing (Preliminary Version) (10.7146/brics.v5i33.19439) | References ORCID License | 52.42 | 4 |
| 108 | Clock Difference Diagrams (10.7146/brics.v5i46.19491) | References ORCID License | 52.42 | 4 |
| 109 | An Improved Algorithm for RNA Secondary Structure Prediction (10.7146/brics.v6i15.20072) | References ORCID License | 52.42 | 4 |
| 110 | On proving syntactic properties of CPS programs (10.7146/brics.v6i23.20092) | References ORCID License | 52.42 | 4 |
| 111 | The Max-Plus Algebra of the Natural Numbers has no Finite Eq… (10.7146/brics.v6i33.20102) | References ORCID License | 52.42 | 4 |
| 112 | A Runtime System for Interactive Web Services (10.7146/brics.v6i9.20066) | References ORCID License | 52.42 | 4 |
| 113 | Complexity of Weak Bisimilarity and Regularity for BPA and B… (10.7146/brics.v7i16.20143) | References ORCID License | 52.42 | 4 |
| 114 | Local Logics for Traces (10.7146/brics.v7i2.20130) | References ORCID License | 52.42 | 4 |
| 115 | Dynamic Partitioning in Linear Relation Analysis. Applicatio… (10.7146/brics.v7i38.20204) | References ORCID License | 52.42 | 4 |
| 116 | A Calculus of Circular Proofs and its Categorical Semantics (10.7146/brics.v8i15.20472) | References ORCID License | 52.42 | 4 |
| 117 | Non-Committing Encryption is Too Easy in the Random Oracle M… (10.7146/brics.v8i47.21707) | References ORCID License | 52.42 | 4 |
| 118 | Optimal Black-Box Secret Sharing over Arbitrary Abelian Grou… (10.7146/brics.v9i8.21726) | References ORCID License | 52.42 | 4 |
| 119 | From Interpreter to Logic Engine by Defunctionalization (10.7146/brics.v10i25.21954) | References ORCID License | 45.15 | 3 |
| 120 | A Formal Model for Trust in Dynamic Networks (10.7146/brics.v10i4.21775) | References ORCID License | 45.15 | 3 |
| 121 | Maximum Exact Satisfiability: NP-completeness Proofs and Exa… (10.7146/brics.v11i19.21844) | References ORCID License | 45.15 | 3 |
| 122 | Recursion vs. Replication in Simple Cryptographic Protocols (10.7146/brics.v11i23.21848) | References ORCID License | 45.15 | 3 |
| 123 | Static Validation of XSL Transformations (10.7146/brics.v12i32.21899) | References ORCID License | 45.15 | 3 |
| 124 | Analyzing Ambiguity of Context-Free Grammars (10.7146/brics.v13i9.21965) | References ORCID License | 45.15 | 3 |
| 125 | Analyzing Ambiguity of Context-Free Grammars (10.7146/brics.v14i10.21932) | References ORCID License | 45.15 | 3 |
| 126 | Count(q) does not imply Count(p) (10.7146/brics.v1i21.21646) | References ORCID License | 45.15 | 3 |
| 127 | Linear Logic on Petri Nets (10.7146/brics.v1i3.21667) | References ORCID License | 45.15 | 3 |
| 128 | A Constraint Oriented Proof Methodology based on Modal Trans… (10.7146/brics.v1i47.21595) | References ORCID License | 45.15 | 3 |
| 129 | The Constructive Lift Monad (10.7146/brics.v2i20.19922) | References ORCID License | 45.15 | 3 |
| 130 | Petri Nets and Bisimulations (10.7146/brics.v2i4.19506) | References ORCID License | 45.15 | 3 |
| 131 | Deciding Regularity in Process Algebras (10.7146/brics.v2i52.19953) | References ORCID License | 45.15 | 3 |
| 132 | A Complete Deductive System for the mu-Calculus (10.7146/brics.v2i6.19508) | References ORCID License | 45.15 | 3 |
| 133 | Partial and Higher Order Differentials and Applications to t… (10.7146/brics.v2i9.19512) | References ORCID License | 45.15 | 3 |
| 134 | On the Complexity of Deciding Behavioural Equivalences and P… (10.7146/brics.v3i39.20021) | References ORCID License | 45.15 | 3 |
| 135 | A Machine Verified Distributed Sorting Algorithm (10.7146/brics.v3i4.19967) | References ORCID License | 45.15 | 3 |
| 136 | Theory and Practice of Action Semantics (10.7146/brics.v3i53.20056) | References ORCID License | 45.15 | 3 |
| 137 | Model Checking via Reachability Testing for Timed Automata (10.7146/brics.v4i29.18955) | References ORCID License | 45.15 | 3 |
| 138 | Quantum Entanglement and Communication Complexity (10.7146/brics.v4i40.18966) | References ORCID License | 45.15 | 3 |
| 139 | CoFI: The Common Framework Initiative for Algebraic Specific… (10.7146/brics.v4i48.19269) | References ORCID License | 45.15 | 3 |
| 140 | Online Type-Directed Partial Evaluation (10.7146/brics.v4i53.19274) | References ORCID License | 45.15 | 3 |
| 141 | Dynamic Linear Time Temporal Logic (10.7146/brics.v4i8.18798) | References ORCID License | 45.15 | 3 |
| 142 | On the (Im)possibility of Basing Oblivious Transfer and Bit… (10.7146/brics.v5i37.19442) | References ORCID License | 45.15 | 3 |
| 143 | A Complexity Gap for Tree-Resolution (10.7146/brics.v6i29.20098) | References ORCID License | 45.15 | 3 |
| 144 | Verification of State/Event Systems by Quotienting (10.7146/brics.v6i41.20111) | References ORCID License | 45.15 | 3 |
| 145 | Observational Mu-Calculus (10.7146/brics.v6i5.20062) | References ORCID License | 45.15 | 3 |
| 146 | Practical Threshold RSA Signatures Without a Trusted Dealer (10.7146/brics.v7i30.20164) | References ORCID License | 45.15 | 3 |
| 147 | Improved Non-Committing Encryption Schemes based on a Genera… (10.7146/brics.v7i6.20134) | References ORCID License | 45.15 | 3 |
| 148 | The Abstraction and Instantiation of String-Matching Program… (10.7146/brics.v8i12.20469) | References ORCID License | 45.15 | 3 |
| 149 | Defunctionalization at Work (10.7146/brics.v8i23.21684) | References ORCID License | 45.15 | 3 |
| 150 | On the Number of Quasi-Kernels in Digraphs (10.7146/brics.v8i7.20461) | References ORCID License | 45.15 | 3 |
| 151 | Extending Java for High-Level Web Service Construction (10.7146/brics.v9i11.21729) | References ORCID License | 45.15 | 3 |
| 152 | Solving the String Statistics Problem in Time O(n log n) (10.7146/brics.v9i13.21731) | References ORCID License | 45.15 | 3 |
| 153 | A Simple Correctness Proof of the Direct-Style Transformatio… (10.7146/brics.v9i2.21719) | References ORCID License | 45.15 | 3 |
| 154 | Composing Strand Spaces (10.7146/brics.v9i5.21723) | References ORCID License | 45.15 | 3 |
| 155 | A Functional Correspondence between Evaluators and Abstract… (10.7146/brics.v10i13.21783) | References ORCID License | 35.78 | 2 |
| 156 | Syntactic Formats for Free: An Abstract Approach to Process… (10.7146/brics.v10i18.21788) | References ORCID License | 35.78 | 2 |
| 157 | A Functional Correspondence between Call-by-Need Evaluators… (10.7146/brics.v10i24.21955) | References ORCID License | 35.78 | 2 |
| 158 | Jeeg: Temporal Constraints for the Synchronization of Concur… (10.7146/brics.v10i6.21777) | References ORCID License | 35.78 | 2 |
| 159 | Probabilistic Event Structures and Domains (10.7146/brics.v11i10.21835) | References ORCID License | 35.78 | 2 |
| 160 | Lambda-Lifting in Quadratic Time (10.7146/brics.v11i12.21837) | References ORCID License | 35.78 | 2 |
| 161 | From Natural Semantics to Abstract Machines (10.7146/brics.v11i20.21845) | References ORCID License | 35.78 | 2 |
| 162 | On the Adaptiveness of Quicksort (10.7146/brics.v11i27.21852) | References ORCID License | 35.78 | 2 |
| 163 | From Reduction-Based to Reduction-Free Normalization (10.7146/brics.v11i30.21855) | References ORCID License | 35.78 | 2 |
| 164 | An Action Environment (10.7146/brics.v11i36.21861) | References ORCID License | 35.78 | 2 |
| 165 | Constructive Action Semantics for Core ML (10.7146/brics.v11i37.21862) | References ORCID License | 35.78 | 2 |
| 166 | Zero-Knowledge Proofs and String Commitments Withstanding Qu… (10.7146/brics.v11i9.21834) | References ORCID License | 35.78 | 2 |
| 167 | A Simple Proof of a Folklore Theorem about Delimited Control (10.7146/brics.v12i25.21892) | References ORCID License | 35.78 | 2 |
| 168 | There and Back Again (10.7146/brics.v12i3.21869) | References ORCID License | 35.78 | 2 |
| 169 | On the Axiomatizability of Priority (10.7146/brics.v13i1.21907) | References ORCID License | 35.78 | 2 |
| 170 | Static Analysis for Java Servlets and JSP (10.7146/brics.v13i10.21915) | References ORCID License | 35.78 | 2 |
| 171 | A Rational Deconstruction of Landin's J Operator (10.7146/brics.v13i17.21922) | References ORCID License | 35.78 | 2 |
| 172 | Control-Flow Analysis of Functional Programs (10.7146/brics.v14i18.21936) | References ORCID License | 35.78 | 2 |
| 173 | Ready To Preorder: Get Your BCCSP Axiomatization for Free! (10.7146/brics.v14i3.21926) | References ORCID License | 35.78 | 2 |
| 174 | An Investigation of Abadi and Cardelli's Untyped Calculus of… (10.7146/brics.v15i6.21941) | References ORCID License | 35.78 | 2 |
| 175 | Monadic Second-order Logic for Parameterized Verification (10.7146/brics.v1i10.21660) | References ORCID License | 35.78 | 2 |
| 176 | A Homomorphism Concept for omega-Regularity (10.7146/brics.v1i11.21659) | References ORCID License | 35.78 | 2 |
| 177 | External-Storage Data Structures for Plane-Sweep Algorithms (10.7146/brics.v1i16.21651) | References ORCID License | 35.78 | 2 |
| 178 | An Action Semantics for ML Concurrency Primitives (10.7146/brics.v1i20.21647) | References ORCID License | 35.78 | 2 |
| 179 | A General Adequacy Result for a Linear Functional Language (10.7146/brics.v1i22.21645) | References ORCID License | 35.78 | 2 |
| 180 | Symmetric Logspace is Closed Under Complement (10.7146/brics.v1i31.21612) | References ORCID License | 35.78 | 2 |
| 181 | Partially Persistent Data Structures of Bounded Degree with… (10.7146/brics.v1i35.21608) | References ORCID License | 35.78 | 2 |
| 182 | Fibrations and Calculi of Fractions (10.7146/brics.v1i37.21606) | References ORCID License | 35.78 | 2 |
| 183 | A Complete Axiomatization of Timed Bisimulation for a Class… (10.7146/brics.v1i43.21599) | References ORCID License | 35.78 | 2 |
| 184 | Compositional Model Checking of Real Time Systems (10.7146/brics.v2i19.19921) | References ORCID License | 35.78 | 2 |
| 185 | A Semantic Theory for Value–Passing Processes Late Approach… (10.7146/brics.v2i22.19924) | References ORCID License | 35.78 | 2 |
| 186 | Automata for the mu-calculus and Related Results (10.7146/brics.v2i27.19929) | References ORCID License | 35.78 | 2 |
| 187 | Petri Nets, Traces, and Local Model Checking (10.7146/brics.v2i39.19941) | References ORCID License | 35.78 | 2 |
| 188 | Lower Bounds on Arithmetic Circuits via Partial Derivatives… (10.7146/brics.v2i43.19944) | References ORCID License | 35.78 | 2 |
| 189 | Monadic Second-Order Logic, Graphs and Unfoldings of Transit… (10.7146/brics.v2i44.19945) | References ORCID License | 35.78 | 2 |
| 190 | A Complete Equational Axiomatization for Prefix Iteration wi… (10.7146/brics.v2i5.19507) | References ORCID License | 35.78 | 2 |
| 191 | A Case Study in Automated Verification Based on Trace Abstra… (10.7146/brics.v2i54.19955) | References ORCID License | 35.78 | 2 |
| 192 | Axiomatizing Prefix Iteration with Silent Steps (10.7146/brics.v2i56.19957) | References ORCID License | 35.78 | 2 |
| 193 | External-Memory Algorithms for Processing Line Segments in G… (10.7146/brics.v3i12.19975) | References ORCID License | 35.78 | 2 |
| 194 | Rotation of Periodic Strings and Short Superstrings (10.7146/brics.v3i21.19984) | References ORCID License | 35.78 | 2 |
| 195 | Scalings in Linear Programming: Necessary and Sufficient Con… (10.7146/brics.v3i48.20050) | References ORCID License | 35.78 | 2 |
| 196 | Diagnostic Model Checking for Real-Time Systems (10.7146/brics.v3i57.18682) | References ORCID License | 35.78 | 2 |
| 197 | Compilation and Equivalence of Imperative Objects (10.7146/brics.v4i19.21677) | References ORCID License | 35.78 | 2 |
| 198 | Topological Completeness for Higher-Order Logic (10.7146/brics.v4i21.18947) | References ORCID License | 35.78 | 2 |
| 199 | Relational Semantics of Non-Deterministic Dataflow (10.7146/brics.v4i36.18962) | References ORCID License | 35.78 | 2 |
| 200 | Distributed Safety Controllers for Web Services (10.7146/brics.v4i47.19268) | References ORCID License | 35.78 | 2 |
| 201 | CASL for ASF+SDF Users (10.7146/brics.v4i49.19270) | References ORCID License | 35.78 | 2 |
| 202 | Sequential Iteration of Interactive Arguments and an Efficie… (10.7146/brics.v4i50.19271) | References ORCID License | 35.78 | 2 |
| 203 | Some Lambda Calculus and Type Theory Formalized (10.7146/brics.v4i51.19272) | References ORCID License | 35.78 | 2 |
| 204 | On the Finitary Characterization of pi-Congruences (10.7146/brics.v4i52.19273) | References ORCID License | 35.78 | 2 |
| 205 | A Comparison of Petri Net Semantics under the Collective Tok… (10.7146/brics.v5i17.19423) | References ORCID License | 35.78 | 2 |
| 206 | An Extensional Characterization of Lambda-Lifting and Lambda… (10.7146/brics.v5i2.21961) | References ORCID License | 35.78 | 2 |
| 207 | Efficient Multiparty Computations with Dishonest Minority (10.7146/brics.v5i36.19441) | References ORCID License | 35.78 | 2 |
| 208 | The Power of Reachability Testing for Timed Automata (10.7146/brics.v5i48.19493) | References ORCID License | 35.78 | 2 |
| 209 | Formatting Strings in ML (10.7146/brics.v5i5.21679) | References ORCID License | 35.78 | 2 |
| 210 | Imperative Objects and Mobile Processes (10.7146/brics.v5i52.19498) | References ORCID License | 35.78 | 2 |
| 211 | Weak Bisimulation and Open Maps (10.7146/brics.v6i14.20071) | References ORCID License | 35.78 | 2 |
| 212 | An Error in the Mixed Adversary Protocol by Fitzi, Hirt and… (10.7146/brics.v6i2.20059) | References ORCID License | 35.78 | 2 |
| 213 | Two Notes on the Computational Complexity of One-Dimensional… (10.7146/brics.v6i3.20060) | References ORCID License | 35.78 | 2 |
| 214 | Structural Operational Semantics (10.7146/brics.v6i30.20099) | References ORCID License | 35.78 | 2 |
| 215 | Decoding Choice Encodings (10.7146/brics.v6i42.20112) | References ORCID License | 35.78 | 2 |
| 216 | Partial Evaluation for Constraint-Based Program Analyses (10.7146/brics.v6i45.20115) | References ORCID License | 35.78 | 2 |
| 217 | Model-Checking Real-Time Control Programs. Verifying LEGO Mi… (10.7146/brics.v6i53.20123) | References ORCID License | 35.78 | 2 |
| 218 | Free mu-lattices (10.7146/brics.v7i28.20161) | References ORCID License | 35.78 | 2 |
| 219 | The Alternation Hierarchy for the Theory of mu-lattices (10.7146/brics.v7i29.20163) | References ORCID License | 35.78 | 2 |
| 220 | PowerForms: Declarative Client-Side Form Field Validation (10.7146/brics.v7i43.20210) | References ORCID License | 35.78 | 2 |
| 221 | The Second Futamura Projection for Type-Directed Partial Eva… (10.7146/brics.v7i44.20211) | References ORCID License | 35.78 | 2 |
| 222 | Reasoning About Code-Generation in Two-Level Languages (10.7146/brics.v7i46.20213) | References ORCID License | 35.78 | 2 |
| 223 | Events in Security Protocols (10.7146/brics.v8i13.20470) | References ORCID License | 35.78 | 2 |
| 224 | A Temporal Concurrent Constraint Programming Calculus (10.7146/brics.v8i20.21681) | References ORCID License | 35.78 | 2 |
| 225 | A Higher-Order Calculus for Categories (10.7146/brics.v8i27.21687) | References ORCID License | 35.78 | 2 |
| 226 | A Fully Equational Proof of Parikh's Theorem (10.7146/brics.v8i28.21688) | References ORCID License | 35.78 | 2 |
| 227 | Syntactic Theories in Practice (10.7146/brics.v8i31.21691) | References ORCID License | 35.78 | 2 |
| 228 | Perfect Hiding and Perfect Binding Universally Composable Co… (10.7146/brics.v8i41.21701) | References ORCID License | 35.78 | 2 |
| 229 | Extracting Witnesses from Proofs of Knowledge in the Random… (10.7146/brics.v8i52.21713) | References ORCID License | 35.78 | 2 |
| 230 | Syntactic Accidents in Program Analysis: On the Impact of th… (10.7146/brics.v8i54.21715) | References ORCID License | 35.78 | 2 |
| 231 | A Simple CPS Transformation of Control-Flow Information (10.7146/brics.v8i55.21716) | References ORCID License | 35.78 | 2 |
| 232 | Static Validation of Dynamically Generated HTML (10.7146/brics.v8i9.20464) | References ORCID License | 35.78 | 2 |
| 233 | The Powerdomain of Indexed Valuations (10.7146/brics.v9i38.21753) | References ORCID License | 35.78 | 2 |
| 234 | A Complexity Analysis of Functional Interpretations (10.7146/brics.v10i12.21782) | References ORCID License | 22.58 | 1 |
| 235 | A Length-Flexible Threshold Cryptosystem with Applications (10.7146/brics.v10i16.21786) | References ORCID License | 22.58 | 1 |
| 236 | The Complexity of Checking Consistency of Pedigree Informati… (10.7146/brics.v10i17.21787) | References ORCID License | 22.58 | 1 |
| 237 | Static Analysis of XML Transformations in Java (10.7146/brics.v10i19.21789) | References ORCID License | 22.58 | 1 |
| 238 | Some Logical Metatheorems with Applications in Functional An… (10.7146/brics.v10i21.21791) | References ORCID License | 22.58 | 1 |
| 239 | Recent Advances in Σ-definability over Continuous Data Types (10.7146/brics.v10i23.21793) | References ORCID License | 22.58 | 1 |
| 240 | Adhesive Categories (10.7146/brics.v10i31.21799) | References ORCID License | 22.58 | 1 |
| 241 | CCS with Hennessy's Merge has no Finite Equational Axiomatiz… (10.7146/brics.v10i34.21802) | References ORCID License | 22.58 | 1 |
| 242 | Contracts for Cooperation between Web Service Programmers an… (10.7146/brics.v10i38.21806) | References ORCID License | 22.58 | 1 |
| 243 | A Denotational Account of Untyped Normalization by Evaluatio… (10.7146/brics.v10i40.21808) | References ORCID License | 22.58 | 1 |
| 244 | Recursive Ping-Pong Protocols (10.7146/brics.v10i47.21819) | References ORCID License | 22.58 | 1 |
| 245 | Composing Programming Languages by Combining Action-Semantic… (10.7146/brics.v10i53.21825) | References ORCID License | 22.58 | 1 |
| 246 | Efficient Algorithms for gcd and Cubic Residuosity in the Ri… (10.7146/brics.v10i8.21779) | References ORCID License | 22.58 | 1 |
| 247 | An Extended Quadratic Frobenius Primality Test with Average… (10.7146/brics.v10i9.21780) | References ORCID License | 22.58 | 1 |
| 248 | Split-2 Bisimilarity has a Finite Axiomatization over CCS wi… (10.7146/brics.v11i1.21826) | References ORCID License | 22.58 | 1 |
| 249 | An Algorithm for Exact Satisfiability Analysed with the Numb… (10.7146/brics.v11i18.21843) | References ORCID License | 22.58 | 1 |
| 250 | Cache-Oblivious Data Structures and Algorithms for Undirecte… (10.7146/brics.v11i2.21827) | References ORCID License | 22.58 | 1 |
| 251 | New-HOPLA--A Higher-Order Process Language with Name Generat… (10.7146/brics.v11i21.21846) | References ORCID License | 22.58 | 1 |
| 252 | Bisimilarity is not Finitely Based over BPA with Interrupt (10.7146/brics.v11i24.21849) | References ORCID License | 22.58 | 1 |
| 253 | A Functional Correspondence between Monadic Evaluators and A… (10.7146/brics.v11i28.21853) | References ORCID License | 22.58 | 1 |
| 254 | The Design Space of Type Checkers for XML Transformation Lan… (10.7146/brics.v11i34.21859) | References ORCID License | 22.58 | 1 |
| 255 | Bottom-Up beta-Substitution: Uplinks and lambda-DAGs (10.7146/brics.v11i38.21863) | References ORCID License | 22.58 | 1 |
| 256 | Sur un Exemple de Patrick Greussay (10.7146/brics.v11i41.21866) | References ORCID License | 22.58 | 1 |
| 257 | A Simple Proof of a Folklore Theorem about Delimited Control (10.7146/brics.v12i10.21876) | References ORCID License | 22.58 | 1 |
| 258 | Program Extraction from Proofs of Weak Head Normalization (10.7146/brics.v12i12.21878) | References ORCID License | 22.58 | 1 |
| 259 | On the Dynamic Extent of Delimited Continuations (10.7146/brics.v12i13.21879) | References ORCID License | 22.58 | 1 |
| 260 | A Concrete Framework for Environment Machines (10.7146/brics.v12i15.21881) | References ORCID License | 22.58 | 1 |
| 261 | A Quantum Cipher with Near Optimal Key-Recycling (10.7146/brics.v12i17.21883) | References ORCID License | 22.58 | 1 |
| 262 | On the Dynamic Extent of Delimited Continuations (10.7146/brics.v12i2.21868) | References ORCID License | 22.58 | 1 |
| 263 | A Syntactic Correspondence between Context-Sensitive Calculi… (10.7146/brics.v12i22.21888) | References ORCID License | 22.58 | 1 |
| 264 | A Framework for Concrete Reputation-Systems (10.7146/brics.v12i23.21889) | References ORCID License | 22.58 | 1 |
| 265 | Faster Algorithms for Computing Longest Common Increasing Su… (10.7146/brics.v12i37.21904) | References ORCID License | 22.58 | 1 |
| 266 | A Syntactic Correspondence between Context-Sensitive Calculi… (10.7146/brics.v12i38.21905) | References ORCID License | 22.58 | 1 |
| 267 | Denotational Aspects of Untyped Normalization by Evaluation (10.7146/brics.v12i4.21870) | References ORCID License | 22.58 | 1 |
| 268 | Exploiting Labels in Structural Operational Semantics (10.7146/brics.v12i8.21874) | References ORCID License | 22.58 | 1 |
| 269 | Visibly Pushdown Automata: From Language Equivalence to Simu… (10.7146/brics.v13i13.21918) | References ORCID License | 22.58 | 1 |
| 270 | Static Analysis for Event-Based XML Processing (10.7146/brics.v13i16.21921) | References ORCID License | 22.58 | 1 |
| 271 | A Syntactic Correspondence between Context-Sensitive Calculi… (10.7146/brics.v13i18.22176) | References ORCID License | 22.58 | 1 |
| 272 | Logics for The Applied pi Calculus (10.7146/brics.v13i19.21923) | References ORCID License | 22.58 | 1 |
| 273 | A Concrete Framework for Environment Machines (10.7146/brics.v13i3.21909) | References ORCID License | 22.58 | 1 |
| 274 | A Rational Deconstruction of Landin's J Operator (10.7146/brics.v13i4.21910) | References ORCID License | 22.58 | 1 |
| 275 | Static Analysis for Java Servlets and JSP (10.7146/brics.v13i8.21914) | References ORCID License | 22.58 | 1 |
| 276 | Temporal Logics Beyond Regularity (10.7146/brics.v14i13.22178) | References ORCID License | 22.58 | 1 |
| 277 | A Complete, Co-Inductive Syntactic Theory of Sequential Cont… (10.7146/brics.v14i4.21927) | References ORCID License | 22.58 | 1 |
| 278 | On the Existence of a Finite Base for Complete Trace Equival… (10.7146/brics.v14i5.21928) | References ORCID License | 22.58 | 1 |
| 279 | On One-Pass CPS Transformations (10.7146/brics.v14i6.21929) | References ORCID License | 22.58 | 1 |
| 280 | Refunctionalization at Work (10.7146/brics.v14i7.21930) | References ORCID License | 22.58 | 1 |
| 281 | Dynamic Normal Forms and Dynamic Characteristic Polynomial (10.7146/brics.v15i2.21937) | References ORCID License | 22.58 | 1 |
| 282 | Refunctionalization at Work (10.7146/brics.v15i4.21939) | References ORCID License | 22.58 | 1 |
| 283 | The Limit View of Infinite Computations (10.7146/brics.v1i14.21653) | References ORCID License | 22.58 | 1 |
| 284 | Petri Nets and Bisimulations (10.7146/brics.v1i15.21652) | References ORCID License | 22.58 | 1 |
| 285 | Local Model Checking and Traces (10.7146/brics.v1i17.21650) | References ORCID License | 22.58 | 1 |
| 286 | Automatic Verification of Real-Timed Systems Using EPSILON (10.7146/brics.v1i19.21648) | References ORCID License | 22.58 | 1 |
| 287 | Secure Signature Schemes Based on Interactive Protocols (10.7146/brics.v1i29.21637) | References ORCID License | 22.58 | 1 |
| 288 | Enhancing the Strength of Conventional Cryptosystems (10.7146/brics.v1i38.21605) | References ORCID License | 22.58 | 1 |
| 289 | CPO Models for GSOS Languages - Part I: Compact GSOS Languag… (10.7146/brics.v1i40.21603) | References ORCID License | 22.58 | 1 |
| 290 | Lower Bounds for Monotone Span Programs (10.7146/brics.v1i46.21596) | References ORCID License | 22.58 | 1 |
| 291 | Synthesizing Distinguishing Formulae for Real Time Systems (10.7146/brics.v1i48.21594) | References ORCID License | 22.58 | 1 |
| 292 | Bisimulations, Games, and Logic (10.7146/brics.v1i6.21664) | References ORCID License | 22.58 | 1 |
| 293 | An Optimal O(log log n) Time Parallel Algorithm for Detectin… (10.7146/brics.v2i11.19514) | References ORCID License | 22.58 | 1 |
| 294 | The Girard Translation Extended with Recursion (10.7146/brics.v2i13.19882) | References ORCID License | 22.58 | 1 |
| 295 | Basic Action Theory (10.7146/brics.v2i25.19927) | References ORCID License | 22.58 | 1 |
| 296 | An n log n Algorithm for Online BDD Refinement (10.7146/brics.v2i29.19931) | References ORCID License | 22.58 | 1 |
| 297 | From Branching to Linear Metric Domains (and back) (10.7146/brics.v2i30.19933) | References ORCID License | 22.58 | 1 |
| 298 | Trust in the lambda-calculus (10.7146/brics.v2i31.19934) | References ORCID License | 22.58 | 1 |
| 299 | Efficient Inference of Object Types (10.7146/brics.v2i32.19935) | References ORCID License | 22.58 | 1 |
| 300 | Type Inference with Nonstructural Subtyping (10.7146/brics.v2i33.19936) | References ORCID License | 22.58 | 1 |
| 301 | Non-primitive Recursive Function Definitions (10.7146/brics.v2i36.19939) | References ORCID License | 22.58 | 1 |
| 302 | Experiments with ZF Set Theory in HOL and Isabelle (10.7146/brics.v2i37.19940) | References ORCID License | 22.58 | 1 |
| 303 | A Fully Abstract Denotational Model for Observational Congru… (10.7146/brics.v2i40.19942) | References ORCID License | 22.58 | 1 |
| 304 | Eta-Expansion Does The Trick (10.7146/brics.v2i41.21673) | References ORCID License | 22.58 | 1 |
| 305 | Automated Logical Verification based on Trace Abstractions (10.7146/brics.v2i53.19954) | References ORCID License | 22.58 | 1 |
| 306 | Behavioural Equivalence for Infinite Systems—Partially Decid… (10.7146/brics.v2i55.19956) | References ORCID License | 22.58 | 1 |
| 307 | Topological Aspects of Traces (10.7146/brics.v2i57.19958) | References ORCID License | 22.58 | 1 |
| 308 | On the Finitary Bisimulation (10.7146/brics.v2i59.19960) | References ORCID License | 22.58 | 1 |
| 309 | A Communication Complexity Proof that Symmetric Functions ha… (10.7146/brics.v3i1.19502) | References ORCID License | 22.58 | 1 |
| 310 | Semantics-Based Compiling: A Case Study in Type-Directed Par… (10.7146/brics.v3i13.19976) | References ORCID License | 22.58 | 1 |
| 311 | Comparing Transition Systems with Independence and Asynchron… (10.7146/brics.v3i18.19980) | References ORCID License | 22.58 | 1 |
| 312 | Thunks and the lambda-Calculus (10.7146/brics.v3i19.19981) | References ORCID License | 22.58 | 1 |
| 313 | Back to Direct Style II: First-Class Continuations (10.7146/brics.v3i20.19982) | References ORCID License | 22.58 | 1 |
| 314 | An Equational Axiomatization for Multi-Exit Iteration (10.7146/brics.v3i22.19985) | References ORCID License | 22.58 | 1 |
| 315 | A Menagerie of Non-Finitely Based Process Semantics over BPA… (10.7146/brics.v3i23.20003) | References ORCID License | 22.58 | 1 |
| 316 | The Buffer Tree: A New Technique for Optimal I/O Algorithms (10.7146/brics.v3i28.20009) | References ORCID License | 22.58 | 1 |
| 317 | A Computational Formalization for Partial Evaluation (Extend… (10.7146/brics.v3i34.20015) | References ORCID License | 22.58 | 1 |
| 318 | Weak Semantics Based on Lighted Button Pressing Experiments.… (10.7146/brics.v3i43.20025) | References ORCID License | 22.58 | 1 |
| 319 | Combining Algebraic and Set-Theoretic Specifications (Extend… (10.7146/brics.v3i52.20055) | References ORCID License | 22.58 | 1 |
| 320 | Modeling, Sharing, and Recursion for Weak Reduction Strategi… (10.7146/brics.v3i56.18681) | References ORCID License | 22.58 | 1 |
| 321 | Compositional and Symbolic Model-Checking of Real-Time Syste… (10.7146/brics.v3i59.18770) | References ORCID License | 22.58 | 1 |
| 322 | Lower Bounds for Dynamic Transitive Closure, Planar Point Lo… (10.7146/brics.v3i9.19972) | References ORCID License | 22.58 | 1 |
| 323 | Timed Modal Specification —Theory and Tools (10.7146/brics.v4i11.18802) | References ORCID License | 22.58 | 1 |
| 324 | Bistructures, Bidomains and Linear Logic (10.7146/brics.v4i15.18805) | References ORCID License | 22.58 | 1 |
| 325 | Linear Hashing (10.7146/brics.v4i16.18808) | References ORCID License | 22.58 | 1 |
| 326 | Abstract Interpretation in the Operational Semantics Hierarc… (10.7146/brics.v4i2.18781) | References ORCID License | 22.58 | 1 |
| 327 | Searching Constant Width Mazes Captures the AC0 Hierarchy (10.7146/brics.v4i25.18951) | References ORCID License | 22.58 | 1 |
| 328 | Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Ze… (10.7146/brics.v4i27.18953) | References ORCID License | 22.58 | 1 |
| 329 | A Definability Theorem for First Order Logic (10.7146/brics.v4i3.18782) | References ORCID License | 22.58 | 1 |
| 330 | Hardness Results for Dynamic Problems by Extensions of Fredm… (10.7146/brics.v4i32.18958) | References ORCID License | 22.58 | 1 |
| 331 | Presheaf Models for the pi-Calculus (10.7146/brics.v4i34.18960) | References ORCID License | 22.58 | 1 |
| 332 | A Theory of Recursive Domains with Applications to Concurren… (10.7146/brics.v4i35.18961) | References ORCID License | 22.58 | 1 |
| 333 | Fast Distributed Algorithms for Brooks-Vizing Colourings (Ex… (10.7146/brics.v4i37.18963) | References ORCID License | 22.58 | 1 |
| 334 | A Relational Account of Call-by-Value Sequentiality (10.7146/brics.v4i41.18967) | References ORCID License | 22.58 | 1 |
| 335 | What Is a ‘Good’ Encoding of Guarded Choice? (10.7146/brics.v4i45.19266) | References ORCID License | 22.58 | 1 |
| 336 | A Simple Solution to Type Specialization (10.7146/brics.v5i1.19275) | References ORCID License | 22.58 | 1 |
| 337 | Compiling Actions by Partial Evaluation, Revisited (10.7146/brics.v5i13.19285) | References ORCID License | 22.58 | 1 |
| 338 | The Hardness of Speeding-up Knapsack (10.7146/brics.v5i14.19286) | References ORCID License | 22.58 | 1 |
| 339 | Generating Hard Tautologies Using Predicate Logic and the Sy… (10.7146/brics.v5i19.19425) | References ORCID License | 22.58 | 1 |
| 340 | On Encoding p pi in m pi (10.7146/brics.v5i26.19432) | References ORCID License | 22.58 | 1 |
| 341 | Low Redundancy in Dictionaries with O(1) Worst Case Lookup T… (10.7146/brics.v5i28.19434) | References ORCID License | 22.58 | 1 |
| 342 | An Operational Investigation of the CPS Hierarchy (10.7146/brics.v5i35.21957) | References ORCID License | 22.58 | 1 |
| 343 | An Interpretation of the Fan Theorem in Type Theory (10.7146/brics.v5i39.19484) | References ORCID License | 22.58 | 1 |
| 344 | Timed Bisimulation and Open Maps (10.7146/brics.v5i4.19277) | References ORCID License | 22.58 | 1 |
| 345 | The Computational Strength of Extensions of Weak König’s Lem… (10.7146/brics.v5i41.19486) | References ORCID License | 22.58 | 1 |
| 346 | Semantics, Modularity, and Rewriting Logic (10.7146/brics.v5i42.19487) | References ORCID License | 22.58 | 1 |
| 347 | Compilation and Equivalence of Imperative Objects (Revised R… (10.7146/brics.v5i55.19500) | References ORCID License | 22.58 | 1 |
| 348 | Finding Maximal Pairs with Bounded Gap (10.7146/brics.v6i12.20069) | References ORCID License | 22.58 | 1 |
| 349 | Hash and Displace: Efficient Evaluation of Minimal Perfect H… (10.7146/brics.v6i13.20070) | References ORCID License | 22.58 | 1 |
| 350 | A Semantic Account of Type-Directed Partial Evaluation (10.7146/brics.v6i17.20074) | References ORCID License | 22.58 | 1 |
| 351 | Hereditary History Preserving Bisimilarity is Undecidable (10.7146/brics.v6i19.20076) | References ORCID License | 22.58 | 1 |
| 352 | A Note on Spector’s Quantifier-Free Rule of Extensionality (10.7146/brics.v6i20.20077) | References ORCID License | 22.58 | 1 |
| 353 | On the Two-Variable Fragment of the Equational Theory of the… (10.7146/brics.v6i22.20079) | References ORCID License | 22.58 | 1 |
| 354 | Conservative Extension in Structural Operational Semantics (10.7146/brics.v6i24.20093) | References ORCID License | 22.58 | 1 |
| 355 | Finding Maximal Quasiperiodicities in Strings (10.7146/brics.v6i25.20094) | References ORCID License | 22.58 | 1 |
| 356 | An Expressive Extension of TLC (10.7146/brics.v6i26.20095) | References ORCID License | 22.58 | 1 |
| 357 | Lambda-Dropping: Transforming Recursive Equations into Progr… (10.7146/brics.v6i27.20096) | References ORCID License | 22.58 | 1 |
| 358 | A Fully Abstract Presheaf Semantics of SCCS with Finite Dela… (10.7146/brics.v6i28.20097) | References ORCID License | 22.58 | 1 |
| 359 | Foundational and Mathematical Uses of Higher Types (10.7146/brics.v6i31.20100) | References ORCID License | 22.58 | 1 |
| 360 | Is your Model Checker on Time? On the Complexity of Model Ch… (10.7146/brics.v6i32.20101) | References ORCID License | 22.58 | 1 |
| 361 | Wavelet Based 3D Compression for Very Large Volume Data Supp… (10.7146/brics.v6i34.20103) | References ORCID License | 22.58 | 1 |
| 362 | On the Steiner Tree 3/2-Approximation for Quasi-Bipartite Gr… (10.7146/brics.v6i39.20108) | References ORCID License | 22.58 | 1 |
| 363 | On Plain and Hereditary History-Preserving Bisimulation (10.7146/brics.v6i4.20061) | References ORCID License | 22.58 | 1 |
| 364 | The Second Futamura Projection for Type-Directed Partial Eva… (10.7146/brics.v6i40.20109) | References ORCID License | 22.58 | 1 |
| 365 | Faster Deterministic Dictionaries (10.7146/brics.v6i48.20118) | References ORCID License | 22.58 | 1 |
| 366 | Event Structures as Presheaves —Two Representation Theorems (10.7146/brics.v6i7.20064) | References ORCID License | 22.58 | 1 |
| 367 | Pseudoknots in RNA Secondary Structures (10.7146/brics.v7i1.20129) | References ORCID License | 22.58 | 1 |
| 368 | A Tough Nut for Tree Resolution (10.7146/brics.v7i10.20137) | References ORCID License | 22.58 | 1 |
| 369 | Modeling a Language for Embedded Systems in Timed Automata (10.7146/brics.v7i17.20144) | References ORCID License | 22.58 | 1 |
| 370 | Language, Semantics, and Methods for Cryptographic Protocols (10.7146/brics.v7i18.20145) | References ORCID License | 22.58 | 1 |
| 371 | Heuristics for Hierarchical Partitioning with Application to… (10.7146/brics.v7i21.20148) | References ORCID License | 22.58 | 1 |
| 372 | Growing Languages with Metamorphic Syntax Macros (10.7146/brics.v7i24.20151) | References ORCID License | 22.58 | 1 |
| 373 | A Discrete Stratety Improvement Algorithm for Solving Parity… (10.7146/brics.v7i48.20215) | References ORCID License | 22.58 | 1 |
| 374 | Higher Order Reverse Mathematics (10.7146/brics.v7i49.20216) | References ORCID License | 22.58 | 1 |
| 375 | Democratic Consensus and the Local Majority Rule (10.7146/brics.v7i8.20135) | References ORCID License | 22.58 | 1 |
| 376 | The Complexity of Constructing Evolutionary Trees Using Expe… (10.7146/brics.v8i1.20220) | References ORCID License | 22.58 | 1 |
| 377 | Effective Bounds on Strong Unicity in L1-Approximation (10.7146/brics.v8i14.20471) | References ORCID License | 22.58 | 1 |
| 378 | Language-Based Caching of Dynamically Generated HTML (10.7146/brics.v8i17.20474) | References ORCID License | 22.58 | 1 |
| 379 | On the Power of Labels in Transition Systems (10.7146/brics.v8i19.21680) | References ORCID License | 22.58 | 1 |
| 380 | The Equational Theory of Fixed Points with Applications to G… (10.7146/brics.v8i22.21683) | References ORCID License | 22.58 | 1 |
| 381 | A Selective CPS Transformation (10.7146/brics.v8i30.21690) | References ORCID License | 22.58 | 1 |
| 382 | Lossy Dictionaries (10.7146/brics.v8i33.21693) | References ORCID License | 22.58 | 1 |
| 383 | Free De Morgan Bisemigroups and Bisemilattices (10.7146/brics.v8i38.21698) | References ORCID License | 22.58 | 1 |
| 384 | Temporal Concurrent Constraint Programming: Applications and… (10.7146/brics.v8i48.21708) | References ORCID License | 22.58 | 1 |
| 385 | Note on the Tableau Technique for Commutative Transition Sys… (10.7146/brics.v8i50.21711) | References ORCID License | 22.58 | 1 |
| 386 | Traveling Salesman Should not be Greedy: Domination Analysis… (10.7146/brics.v8i6.20460) | References ORCID License | 22.58 | 1 |
| 387 | Checking for Open Bisimilarity in the pi-Calculus (10.7146/brics.v8i8.20463) | References ORCID License | 22.58 | 1 |
| 388 | Modified Bar Recursion (10.7146/brics.v9i14.21732) | References ORCID License | 22.58 | 1 |
| 389 | Strong Bisimilarity of Simple Process Algebras: Complexity L… (10.7146/brics.v9i16.21734) | References ORCID License | 22.58 | 1 |
| 390 | On the Number of Maximal Bipartite Subgraphs of a Graph (10.7146/brics.v9i17.21735) | References ORCID License | 22.58 | 1 |
| 391 | Cache Oblivious Distribution Sweeping (10.7146/brics.v9i18.21964) | References ORCID License | 22.58 | 1 |
| 392 | An Extension Theorem with an Application to Formal Tree Seri… (10.7146/brics.v9i19.21736) | References ORCID License | 22.58 | 1 |
| 393 | Regular Languages Definable by Lindström Quantifiers (Prelim… (10.7146/brics.v9i20.21950) | References ORCID License | 22.58 | 1 |
| 394 | Formal Tree Series (10.7146/brics.v9i21.21737) | References ORCID License | 22.58 | 1 |
| 395 | On the Expressive Power of Concurrent Constraint Programming… (10.7146/brics.v9i22.21738) | References ORCID License | 22.58 | 1 |
| 396 | Fixed Points on Abstract Structures without the Equality Tes… (10.7146/brics.v9i26.21742) | References ORCID License | 22.58 | 1 |
| 397 | Simulating Uniform Hashing in Constant Time and Optimal Spac… (10.7146/brics.v9i27.21743) | References ORCID License | 22.58 | 1 |
| 398 | Mann Iterates of Directionally Nonexpansive Mappings in Hype… (10.7146/brics.v9i28.21744) | References ORCID License | 22.58 | 1 |
| 399 | Comparative Methods for Gene Structure Prediction in Homolog… (10.7146/brics.v9i29.21745) | References ORCID License | 22.58 | 1 |
| 400 | On One-Pass CPS Transformations (10.7146/brics.v9i3.21722) | References ORCID License | 22.58 | 1 |
| 401 | A Symmetric Approach to Compilation and Decompilation (10.7146/brics.v9i37.21752) | References ORCID License | 22.58 | 1 |
| 402 | Some Remarks on Regular Words (10.7146/brics.v9i39.21754) | References ORCID License | 22.58 | 1 |
| 403 | Checking Consistency of Pedigree Information is NP-complete… (10.7146/brics.v9i42.21757) | References ORCID License | 22.58 | 1 |
| 404 | Using IDDs for Packet Filtering (10.7146/brics.v9i43.21758) | References ORCID License | 22.58 | 1 |
| 405 | Linearity in Process Languages (10.7146/brics.v9i48.21763) | References ORCID License | 22.58 | 1 |
| 406 | Circuits on Cylinders (10.7146/brics.v9i50.21765) | References ORCID License | 22.58 | 1 |
| 407 | A Lambda-Revelation of the SECD Machine (10.7146/brics.v9i53.21768) | References ORCID License | 22.58 | 1 |