The following pages link to Acta Informatica (Q161641):
Displaying 50 items.
- On the number of nodes in universal networks of evolutionary processors (Q854680) (← links)
- A semantic approach to optimize linear datalog programs (Q854685) (← links)
- On the tree-transformation power of XSLT (Q855270) (← links)
- Representation and uniformization of algebraic transductions (Q855271) (← links)
- A new bound for the D0L sequence equivalence problem (Q855272) (← links)
- Verification conditions are code (Q855274) (← links)
- Hybridization methods for the analysis of nonlinear systems (Q868432) (← links)
- Symbolic models for control systems (Q868433) (← links)
- Geometric analysis of nondeterminacy in dynamical systems (Q868434) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- Fair ambients (Q877172) (← links)
- Parallel \(LL\) parsing (Q878376) (← links)
- An exact subexponential-time lattice algorithm for Asian options (Q878377) (← links)
- On using data abstractions for model checking refinements (Q878378) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- Infinitary rewriting: meta-theory and convergence (Q884993) (← links)
- A criterion for atomicity revisited (Q884994) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Observational implementation of algebraic specifications (Q911245) (← links)
- Binary search trees of almost optimal height (Q911247) (← links)
- On efficient implementation of an approximation algorithm for the Steiner tree problem (Q911286) (← links)
- Partial (set) 2-structures. I: Basic notions and the representation problems (Q911307) (← links)
- Partial (set) 2-structures. II: State spaces of concurrent systems (Q911308) (← links)
- Effective construction of the syntactic algebra of a recognizable series on trees (Q911788) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- The instability of self-stabilization (Q913475) (← links)
- Data refinement by calculation (Q913482) (← links)
- Duality in specification languages: A lattice-theoretical approach (Q913495) (← links)
- Proving relative lower bounds for incremental algorithms (Q913508) (← links)
- MRE hierarchical decomposition of general queueing network models (Q913642) (← links)
- Theoretical foundations of handling large substitution sets in temporal integrity monitoring (Q914364) (← links)
- The calculus of context relations (Q918720) (← links)
- Proof theory for exception handling in a tasking environment (Q918725) (← links)
- Some order dimension bounds for communication complexity problems (Q921909) (← links)
- Erratum: Maximum entropy two-station cyclic queues with multiple general servers (Q922348) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Two-tier relaxed heaps (Q929299) (← links)
- Applying relation algebra and RelView to solve problems on orders and lattices (Q929300) (← links)
- Weighted height of random trees (Q934911) (← links)
- Relational structures model of concurrency (Q934912) (← links)
- Algebraic reasoning for probabilistic action systems and while-loops (Q938297) (← links)
- The fibers and range of reduction graphs in ciliates (Q938298) (← links)
- Inference rules for proving the equivalence of recursive procedures (Q938300) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- Embedding mappings and splittings with applications (Q968275) (← links)
- On the observational theory of the CPS-calculus (Q968276) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- LR error repair using the A* algorithm (Q969645) (← links)
