Archives - Page 2 | BRICS Report Series

RS-42 Efficient String Matching on Coded Texts
No 42 (1994)
RS-41 On Data Structures and Asymmetric Communication Complexity
No 41 (1994)
RS-40 CPO Models for GSOS Languages - Part I: Compact GSOS Languages
No 40 (1994)
94-39 Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)
No 39 (1994)
RS-38 Enhancing the Strength of Conventional Cryptosystems
No 38 (1994)
RS-37 Fibrations and Calculi of Fractions
No 37 (1994)
RS-36 On provably disjoint NP-pairs
No 36 (1994)
RS-35 Partially Persistent Data Structures of Bounded Degree with Constant Update Time
No 35 (1994)
RS-34 A Compositional Proof System for the Modal mu-Calculus
No 34 (1994)
RS-33 Strong Concatenable Processes: An Approach to the Category of Petri Net Computations
No 33 (1994)
RS-32 Decidability of Systems of Set Constraints with Negative Constraints
No 32 (1994)
RS-31 Symmetric Logspace is Closed Under Complement
No 31 (1994)
RS-30 Fully Dynamic Transitive Closure in Plane Dags with one Source and one Sink
No 30 (1994)
RS-29 Secure Signature Schemes Based on Interactive Protocols
No 29 (1994)
RS-27 A Model of Intuitionistic Affine Logic from Stable Domain Theory (Revised and Expanded Version)
No 27 (1994)
RS-26 Count(q) versus the Pigeon-Hole Principle
No 26 (1994)
RS-25 Bootstrapping the Primitive Recursive Functions by 47 Colors
No 25 (1994)
RS-24 A Fractal which violates the Axiom of Determinacy
No 24 (1994)
RS-28 Probabilistic Proof Systems
No 28 (1994)
RS-23 Finitisation in Bounded Arithmetic
No 23 (1994)
RS-22 A General Adequacy Result for a Linear Functional Language
No 22 (1994)
RS-21 Count(q) does not imply Count(p)
No 21 (1994)
RS-20 An Action Semantics for ML Concurrency Primitives
No 20 (1994)
RS-19 Automatic Verification of Real-Timed Systems Using EPSILON
No 19 (1994)
RS-18 LCF Examples in HOL
No 18 (1994)
RS-17 Local Model Checking and Traces
No 17 (1994)
RS-16 External-Storage Data Structures for Plane-Sweep Algorithms
No 16 (1994)
RS-15 Petri Nets and Bisimulations
No 15 (1994)
RS-14 The Limit View of Infinite Computations
No 14 (1994)
RS-13 Stable Bistructure Models of PCF
No 13 (1994)
RS-12 Models for Concurrency
No 12 (1994)
RS-11 A Homomorphism Concept for omega-Regularity
No 11 (1994)
RS-10 Monadic Second-order Logic for Parameterized Verification
No 10 (1994)
RS-9 Bistructures, Bidomains and Linear Logic
No 9 (1994)
RS-8 Decidability Issues for Petri Nets
No 8 (1994)
RS-7 Bisimulation from Open Maps
No 7 (1994)
RS-6 Bisimulations, Games, and Logic
No 6 (1994)
RS-5 Unified Algebras and Abstract Syntax
No 5 (1994)
RS-4 Graphs and Decidable Transductions based on Edge Constraints
No 4 (1994)
RS-3 Linear Logic on Petri Nets
No 3 (1994)
RS-2 Complexity of Nondeterministic Functions
No 2 (1994)
RS-1 Semantics, Algorithmics and Logic: Basic Research in Computer Science. BRICS Inaugural Talk
No 1 (1994)
RS-14 Inclusion-Exclusion(3) Implies Inclusion-Exclusion(n)
No 14 (1995)
RS-38 Gödelisation in the lambda-Calculus
No 38 (1995)
RS-41 Eta-Expansion Does The Trick
No 41 (1995)
RS-14 On the Idempotence of the CPS Transformation
No 14 (1996)
RS-31 Names, Equations, Relations: Practical Ways to Reason about 'new'
No 31 (1996)
RS-19 Compilation and Equivalence of Imperative Objects
No 19 (1997)
RS-14 Dictionaries on AC^0 RAMs: Query Time Theta(√log n/log log n) is Necessary and Sufficient
No 14 (1997)
RS-05 Formatting Strings in ML
No 5 (1998)
RS-19 On the Power of Labels in Transition Systems
No 19 (2001)
RS-20 A Temporal Concurrent Constraint Programming Calculus
No 20 (2001)
RS-21 Equational Theories of Tropical Semirings
No 21 (2001)
RS-22 The Equational Theory of Fixed Points with Applications to Generalized Language Theory
No 22 (2001)
RS-23 Defunctionalization at Work
No 23 (2001)
RS-25 Cost Recurrences for DML Programs
No 25 (2001)
RS-26 A Complete Axiomatization of Simulation for Regular CCS Expressions
No 26 (2001)
RS-27 A Higher-Order Calculus for Categories
No 27 (2001)
RS-28 A Fully Equational Proof of Parikh's Theorem
No 28 (2001)
RS-29 A Unifying Approach to Goal-Directed Evaluation
No 29 (2001)
RS-30 A Selective CPS Transformation
No 30 (2001)
RS-31 Syntactic Theories in Practice
No 31 (2001)
RS-32 Cuckoo Hashing
No 32 (2001)
RS-33 Lossy Dictionaries
No 33 (2001)
RS-34 Fast Random Access to Wavelet Compressed Volumetric Data Using Hashing
No 34 (2001)
RS-35 A General Schema for Constructing One-Point Bases in the Lambda Calculus
No 35 (2001)
RS-36 Cache Oblivious Search Trees via Binary Trees of Small Height
No 36 (2001)
RS-37 Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
No 37 (2001)
RS-38 Free De Morgan Bisemigroups and Bisemilattices
No 38 (2001)
RS-39 There and Back Again
No 39 (2001)
RS-40 CPS Transformation of Flow Information, Part II: Administrative Reductions
No 40 (2001)
RS-41 Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
No 41 (2001)
RS-42 Rationally Additive Semirings
No 42 (2001)
RS-43 From Known-Plaintext Security to Chosen-Plaintext Security
No 43 (2001)
RS-44 Predicate Abstraction for Dense Real-Time Systems
No 44 (2001)
RS-45 An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
No 45 (2001)
RS-46 The Implicit Computational Complexity of Imperative Programming Languages
No 46 (2001)
RS-47 Non-Committing Encryption is Too Easy in the Random Oracle Model
No 47 (2001)
RS-48 Temporal Concurrent Constraint Programming: Applications and Behavior
No 48 (2001)
RS-49 A First-Order One-Pass CPS Transformation
No 49 (2001)
RS-50 Note on the Tableau Technique for Commutative Transition Systems
No 50 (2001)
RS-51 On Weak Markov's Principle
No 51 (2001)
RS-52 Extracting Witnesses from Proofs of Knowledge in the Random Oracle Model
No 52 (2001)
RS-53 Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata
No 53 (2001)
RS-54 Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation
No 54 (2001)
RS-55 A Simple CPS Transformation of Control-Flow Information
No 55 (2001)
RS-1 The bigwig Project
No 1 (2002)
RS-2 A Simple Correctness Proof of the Direct-Style Transformation
No 2 (2002)
RS-4 Syntactic Theories in Practice
No 4 (2002)
RS-3 On One-Pass CPS Transformations
No 3 (2002)
RS-5 Composing Strand Spaces
No 5 (2002)
RS-6 Equational Axioms for Probabilistic Bisimilarity (Preliminary Report)
No 6 (2002)
RS-7 A Formalization of Linkage Analysis
No 7 (2002)
RS-8 Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
No 8 (2002)
RS-9 One-Probe Search
No 9 (2002)
RS-10 Uniform Asymptotic Regularity for Mann Iterates
No 10 (2002)
RS-11 Extending Java for High-Level Web Service Construction
No 11 (2002)
RS-12 There and Back Again
No 12 (2002)
RS-13 Solving the String Statistics Problem in Time O(n log n)
No 13 (2002)
RS-14 Modified Bar Recursion
No 14 (2002)
RS-15 On the Number of Maximal Independent Sets in a Graph
No 15 (2002)
RS-16 Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds
No 16 (2002)
RS-17 On the Number of Maximal Bipartite Subgraphs of a Graph
No 17 (2002)
RS-19 An Extension Theorem with an Application to Formal Tree Series
No 19 (2002)
RS-21 Formal Tree Series
No 21 (2002)
RS-22 On the Expressive Power of Concurrent Constraint Programming Languages
No 22 (2002)
RS-23 Compact Representations of BL-Algebras
No 23 (2002)
RS-24 Static Analysis for Dynamic XML
No 24 (2002)
RS-25 Deciding Framed Bisimilarity
No 25 (2002)
RS-26 Fixed Points on Abstract Structures without the Equality Test
No 26 (2002)
RS-27 Simulating Uniform Hashing in Constant Time and Optimal Space
No 27 (2002)
RS-28 Mann Iterates of Directionally Nonexpansive Mappings in Hyperbolic Spaces
No 28 (2002)
RS-29 Comparative Methods for Gene Structure Prediction in Homologous Sequences
No 29 (2002)
RS-31 Proof Mining: A Systematic Way of Analysing Proofs in Mathematics
No 31 (2002)
RS-32 On Obtaining Knuth, Morris, and Pratt's String Matcher by Partial Evaluation
No 32 (2002)
RS-33 Memoization in Type-Directed Partial Evaluation
No 33 (2002)
RS-34 A Foundation for Embedded Languages
No 34 (2002)
RS-35 Timed Automata May Cause Some Troubles
No 35 (2002)
RS-36 CPS Transformation of Flow Information, Part II: Administrative Reductions
No 36 (2002)
RS-37 A Symmetric Approach to Compilation and Decompilation
No 37 (2002)
RS-38 The Powerdomain of Indexed Valuations
No 38 (2002)
RS-39 Some Remarks on Regular Words
No 39 (2002)
RS-40 A Note on an Expressiveness Hierarchy for Multi-exit Iteration
No 40 (2002)
RS-41 Axiomatizing Omega and Omega-op Powers of Words
No 41 (2002)
RS-42 Checking Consistency of Pedigree Information is NP-complete (Preliminary Report)
No 42 (2002)
RS-43 Using IDDs for Packet Filtering
No 43 (2002)
RS-44 Higher Dimensional Automata
No 44 (2002)
RS-45 Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets
No 45 (2002)
RS-46 Greibach Normal Form in Algebraically Complete Semirings
No 46 (2002)
RS-47 Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators
No 47 (2002)
RS-48 Linearity in Process Languages
No 48 (2002)
RS-49 HOPLA--A Higher-Order Process Language
No 49 (2002)
RS-50 Circuits on Cylinders
No 50 (2002)
RS-51 Computing Refined Buneman Trees in Cubic Time
No 51 (2002)
RS-52 A New One-Pass Transformation into Monadic Normal Form
No 52 (2002)
RS-53 A Lambda-Revelation of the SECD Machine
No 53 (2002)
RS-1 Deriving Bisimulation Congruences: 2-Categories vs. Precategories
No 1 (2003)
RS-2 Tagging, Encoding, and Jones Optimality
No 2 (2003)
RS-3 On the Computational Collapse of Quantum Information
No 3 (2003)
RS-4 A Formal Model for Trust in Dynamic Networks
No 4 (2003)
RS-5 Precise Analysis of String Expressions
No 5 (2003)
RS-6 Jeeg: Temporal Constraints for the Synchronization of Concurrent Objects
No 6 (2003)
RS-7 The METAFRONT System: Extensible Parsing and Transformation
No 7 (2003)
RS-8 Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers
No 8 (2003)
RS-9 An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
No 9 (2003)
RS-10 Wireless Authentication in chi-Spaces
No 10 (2003)
RS-12 A Complexity Analysis of Functional Interpretations.
No 12 (2003)
RS-13 A Functional Correspondence between Evaluators and Abstract Machines
No 13 (2003)
RS-14 From Interpreter to Compiler and Virtual Machine: A Functional Derivation
No 14 (2003)
RS-15 A Semantic Theory for Value-Passing Processes Based on the Late Approach
No 15 (2003)
RS-16 A Length-Flexible Threshold Cryptosystem with Applications
No 16 (2003)
RS-17 The Complexity of Checking Consistency of Pedigree Information and Related Problems
No 17 (2003)
RS-18 Syntactic Formats for Free: An Abstract Approach to Process Equivalence
No 18 (2003)
RS-19 Static Analysis of XML Transformations in Java
No 19 (2003)
RS-20 Fast Partial Evaluation of Pattern Matching in Strings
No 20 (2003)
RS-21 Some Logical Metatheorems with Applications in Functional Analysis
No 21 (2003)
RS-22 Scalable Key-Escrow
No 22 (2003)
RS-23 Recent Advances in Sigma-definability over Continuous Data Types
No 23 (2003)
RS-26 Lambda-Lifting in Quadratic Time
No 26 (2003)
RS-27 Nested Semantics over Finite Trees are Equationally Hard
No 27 (2003)
RS-28 Regular Languages Definable by Lindström Quantifiers
No 28 (2003)
RS-29 A Runtime System for XML Transformations in Java
No 29 (2003)
RS-30 New Algorithms for Exact Satisfiability
No 30 (2003)
RS-31 Adhesive Categories
No 31 (2003)
RS-32 Extracting Herbrand Disjunctions by Functional Interpretation
No 32 (2003)
RS-33 A Rational Deconstruction of Landin's SECD Machine
No 33 (2003)
RS-34 CCS with Hennessy's Merge has no Finite Equational Axiomatization
No 34 (2003)
RS-35 A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational...
No 35 (2003)
RS-36 Unfair Noisy Channels and Oblivious Transfer
No 36 (2003)
RS-37 Computational Collapse of Quantum State with Application to Oblivious Transfer
No 37 (2003)
RS-38 Contracts for Cooperation between Web Service Programmers and HTML Designers
No 38 (2003)
RS-39 Applying pi-Calculus to Practice: An Example of a Unified Security Mechanism
No 39 (2003)
RS-40 A Denotational Account of Untyped Normalization by Evaluation
No 40 (2003)
RS-41 An Operational Foundation for Delimited Continuations
No 41 (2003)
RS-42 Full Abstraction for HOPLA
No 42 (2003)
RS-43 Domain Theory for Concurrency
No 43 (2003)
RS-44 The Cell Probe Complexity of Succinct Data Structures
No 44 (2003)
RS-45 On converting CNF to DNF
No 45 (2003)
RS-46 The Role of Quantifier Alternations in Cut Elimination
No 46 (2003)
RS-47 Recursive Ping-Pong Protocols
No 47 (2003)
RS-48 Danfoss EKC Trial Project Deliverables
No 48 (2003)
RS-49 Online On-the-Fly Testing of Real-time Systems
No 49 (2003)
RS-50 A Two-Layer Approach to the Computability and Complexity of Real Numbers
No 50 (2003)
RS-51 Bounds on Iterations of Asymptotically Quasi-Nonexpansive Mappings
No 51 (2003)
RS-52 Pragmatics of Modular SOS
No 52 (2003)
RS-53 Composing Programming Languages by Combining Action-Semantics Modules
No 53 (2003)
RS-1 Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
No 1 (2004)
RS-2 Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
No 2 (2004)
RS-3 A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines
No 3 (2004)
RS-4 Optimal Strategies in Priced Timed Game Automata
No 4 (2004)
RS-5 From Interpreter to Logic Engine by Defunctionalization
No 5 (2004)
RS-6 On Reducing a System of Equations to a Single Equation
No 6 (2004)
RS-7 On the Expressive Power of Extended Process Rewrite Systems
No 7 (2004)
RS-8 Highly Undecidable Questions for Process Algebras
No 8 (2004)
RS-9 Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
No 9 (2004)
RS-10 Probabilistic Event Structures and Domains
No 10 (2004)
RS-11 Congruences for Contextual Graph-Rewriting
No 11 (2004)
RS-12 Lambda-Lifting in Quadratic Time
No 12 (2004)
RS-13 Strong Privacy Protection in Electronic Voting
No 13 (2004)
RS-14 Maker-Maker and Maker-Breaker Games are PSPACE-Complete
No 14 (2004)
RS-15 The Full Abstraction of the UC Framework
No 15 (2004)
RS-16 Distributed Approximation of Fixed-Points in Trust Structures
No 16 (2004)
RS-17 Computing Logarithms Digit-by-Digit
No 17 (2004)
RS-18 An Algorithm for Exact Satisfiability Analysed with the Number of Clauses as Parameter
No 18 (2004)
RS-19 Maximum Exact Satisfiability: NP-completeness Proofs and Exact Algorithms
No 19 (2004)
RS-20 From Natural Semantics to Abstract Machines
No 20 (2004)
RS-21 New-HOPLA--A Higher-Order Process Language with Name Generation
No 21 (2004)
RS-22 Profunctors, Open Maps and Bisimulation
No 22 (2004)
RS-23 Recursion vs. Replication in Simple Cryptographic Protocols
No 23 (2004)
RS-24 Bisimilarity is not Finitely Based over BPA with Interrupt
No 24 (2004)
RS-25 On the Recursive Enumerability of Fixed-Point Combinators
No 25 (2004)
RS-26 Refocusing in Reduction Semantics
No 26 (2004)
RS-27 On the Adaptiveness of Quicksort
No 27 (2004)
RS-28 A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational...
No 28 (2004)
RS-29 An Operational Foundation for Delimited Continuations in the CPS Hierarchy
No 29 (2004)
RS-30 From Reduction-Based to Reduction-Free Normalization
No 30 (2004)
RS-31 Strongly Uniform Bounds from Semi-Constructive Proofs
No 31 (2004)
RS-32 A Quantitative Version of Kirk's Fixed Point Theorem for Asymptotic Contractions
No 32 (2004)
RS-33 A Runtime System for XML Transformations in Java
No 33 (2004)
RS-34 The Design Space of Type Checkers for XML Transformation Languages
No 34 (2004)
RS-35 Type Checking Semantic Functions in ASDF
No 35 (2004)
RS-36 An Action Environment
No 36 (2004)
RS-37 Constructive Action Semantics for Core ML
No 37 (2004)
RS-38 Bottom-Up beta-Substitution: Uplinks and lambda-DAGs
No 38 (2004)
RS-39 CPS Transformation of Beta-Redexes
No 39 (2004)
RS-40 Fast Partial Evaluation of Pattern Matching in Strings
No 40 (2004)
RS-41 Sur un Exemple de Patrick Greussay
No 41 (2004)
RS-1 On the Recursive Enumerability of Fixed-Point Combinators
No 1 (2005)
RS-2 On the Dynamic Extent of Delimited Continuations
No 2 (2005)
RS-3 There and Back Again
No 3 (2005)
RS-4 Denotational Aspects of Untyped Normalization by Evaluation
No 4 (2005)
RS-5 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations (Preliminary Version)
No 5 (2005)
RS-6 Distributed Approximation of Fixed-Points in Trust Structures
No 6 (2005)
RS-7 Modular Structural Operational Semantics
No 7 (2005)
RS-8 Exploiting Labels in Structural Operational Semantics
No 8 (2005)
RS-9 Reviewing Bounds on the Circuit Size of the Hardest Functions
No 9 (2005)
RS-10 A Simple Proof of a Folklore Theorem about Delimited Control
No 10 (2005)
RS-11 An Operational Foundation for Delimited Continuations in the CPS Hierarchy
No 11 (2005)
RS-12 Program Extraction from Proofs of Weak Head Normalization
No 12 (2005)
RS-13 On the Dynamic Extent of Delimited Continuations
No 13 (2005)
RS-14 On Obtaining the Boyer-Moore String-Matching Algorithm by Partial Evaluation
No 14 (2005)
RS-15 A Concrete Framework for Environment Machines
No 15 (2005)
RS-16 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
No 16 (2005)
RS-17 A Quantum Cipher with Near Optimal Key-Recycling
No 17 (2005)
RS-18 Secure Computing, Economy, and Trust: A Generic Solution for Secure Auctions with Real-World Applications
No 18 (2005)
RS-19 Finite Equational Bases in Process Algebra: Results and Open Questions
No 19 (2005)
RS-20 Cryptography in the Bounded Quantum Storage Model
No 20 (2005)
RS-21 General Logical Metatheorems for Functional Analysis
No 21 (2005)
RS-22 A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines
No 22 (2005)
RS-23 A Framework for Concrete Reputation-Systems
No 23 (2005)
RS-24 An Operational Foundation for Delimited Continuations in the CPS Hierarchy
No 24 (2005)
RS-25 A Simple Proof of a Folklore Theorem about Delimited Control
No 25 (2005)
RS-26 Measuring the Propagation of Information in Partial Evaluation
No 26 (2005)
RS-27 A Calculus for Context-Awareness
No 27 (2005)
RS-28 On Counting the Number of Consistent Genotype Assignments for Pedigrees
No 28 (2005)
RS-29 On Obtaining the Boyer-Moore String-Matching Algorithm by Partial Evaluation
No 29 (2005)
RS-30 An Operational Semantics for Trust Policies.
No 30 (2005)
RS-31 Type Checking with XML Schema in XACT
No 31 (2005)
RS-32 Static Validation of XSL Transformations
No 32 (2005)
RS-33 Bisimilarity is not Finitely Based over BPA with Interrupt
No 33 (2005)
RS-34 Formal Aspects of Polyvariant Specialization
No 34 (2005)
RS-35 Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative
No 35 (2005)
RS-36 On the Static and Dynamic Extents of Delimited Continuations
No 36 (2005)
RS-37 Faster Algorithms for Computing Longest Common Increasing Subsequences
No 37 (2005)
RS-38 A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines
No 38 (2005)
RS-1 On the Axiomatizability of Priority
No 1 (2006)
RS-2 A Formal Model for Context-Awareness
No 2 (2006)
RS-3 A Concrete Framework for Environment Machines
No 3 (2006)
RS-4 A Rational Deconstruction of Landin's J Operator
No 4 (2006)
RS-5 Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative
No 5 (2006)
RS-6 A Finite Equational Base for CCS with Left Merge and Communication Merge
No 6 (2006)
RS-7 Undecidability Results for Bisimilarity on Prefix Rewrite Systems
No 7 (2006)
RS-8 Static Analysis for Java Servlets and JSP
No 8 (2006)
RS-10 Static Analysis for Java Servlets and JSP
No 10 (2006)
RS-11 An Interface Theory for Input/Output Automata
No 11 (2006)
RS-12 Higher-Order Beta Matching with Solutions in Long Beta-Eta Normal Form
No 12 (2006)
RS-13 Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
No 13 (2006)
RS-14 Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
No 14 (2006)
RS-15 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
No 15 (2006)
RS-16 Static Analysis for Event-Based XML Processing
No 16 (2006)
RS-17 A Rational Deconstruction of Landin's J Operator
No 17 (2006)
RS-19 Logics for The Applied pi Calculus
No 19 (2006)
RS-1 HIROIMONO is NP-complete
No 1 (2007)
RS-2 Characteristic Formulae: From Automata to Logic
No 2 (2007)
RS-3 Ready To Preorder: Get Your BCCSP Axiomatization for Free!
No 3 (2007)
RS-4 A Complete, Co-Inductive Syntactic Theory of Sequential Control and State
No 4 (2007)
RS-5 On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt
No 5 (2007)
RS-6 On One-Pass CPS Transformations
No 6 (2007)
RS-7 Refunctionalization at Work
No 7 (2007)
RS-8 A Simple Application of Lightweight Fusion to Proving the Equivalence of Abstract Machines
No 8 (2007)
RS-10 Analyzing Ambiguity of Context-Free Grammars
No 10 (2007)
RS-11 The Saga of the Axiomatization of Parallel Composition
No 11 (2007)
RS-14 On Barron and Strachey's Cartesian Product Function
No 14 (2007)
RS-16 On the Equivalence between Small-Step and Big-Step Abstract Machines: A Simple Application of Lightweight Fusion
No 16 (2007)
RS-18 Control-Flow Analysis of Functional Programs
No 18 (2007)
RS-2 Dynamic Normal Forms and Dynamic Characteristic Polynomial
No 2 (2008)
RS-3 A Study of Syntactic and Semantic Artifacts and its Application to Lambda Definability, Strong Normalization...
No 3 (2008)
RS-4 Refunctionalization at Work
No 4 (2008)
RS-5 Inter-Deriving Semantic Artifacts for Object-Oriented Programming
No 5 (2008)
RS-6 An Investigation of Abadi and Cardelli's Untyped Calculus of Objects
No 6 (2008)
RS-7 Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: ...
No 7 (2008)
RS-24 Automata on Series-Parallel Biposets
No 24 (2001)
RS-20 Regular Languages Definable by Lindström Quantifiers (Preliminary Version)
No 20 (2002)
RS-30 Lambda-Lifting in Quadratic Time
No 30 (2002)
RS-11 Fast Partial Evaluation of Pattern Matching in Strings
No 11 (2003)
RS-25 From Interpreter to Logic Engine by Defunctionalization
No 25 (2003)
RS-24 A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines
No 24 (2003)

Full text not available. This report is superseded by the later report BRICS RS-04-3
RS-16 Marked Ancestor Problems
No 16 (1998)
RS-35 An operational Investigation of the CPS Hierarchy
No 35 (1998)
RS-54 Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure
No 54 (1998)

Full text not available. This report is superseded by the later report BRICS RS-99-27
RS-02 An Extensional Characterization of Lambda-Lifting and Lambda-Dropping
No 2 (1998)

Full text not available. This report is superseded by the later report BRICS RS-99-21.
RS-18 Cache Oblivious Distribution Sweeping
No 18 (2002)
RS-9 Analyzing Ambiguity of Context-Free Grammars
No 9 (2006)
RS-12 Optimal Resilient Dynamic Dictionaries
No 12 (2007)
RS-18 Not published
No 18 (2006)
RS-9 Not published
No 9 (2007)
RS-13 Not published
No 13 (2007)
RS-15 Not published
No 15 (2007)
RS-17 Not published
No 17 (2007)
RS-1 Not published
No 1 (2008)

Previous 351-670 of 670