The following pages link to Acta Informatica (Q161641):
Displaying 50 items.
- Performance evaluation of fork and join synchronization primitives (Q579922) (← links)
- The expressive theory of stacks (Q580954) (← links)
- An incremental mechanical development of systolic solutions to the algebraic path problem (Q582035) (← links)
- An on-line algorithm for variable-sized bin packing (Q582083) (← links)
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- An almost linear Robinson unification algorithm (Q582141) (← links)
- Efficient memo-table management strategies (Q582879) (← links)
- Nested satisfiability (Q582905) (← links)
- Product properties and their direct verification (Q594575) (← links)
- Computation and use of data flow information in optimizing compilers (Q598799) (← links)
- Concurrent search and insertion in 2-3 trees (Q598814) (← links)
- The Schorr-Waite graph marking algorithm (Q599496) (← links)
- Universal asynchronous iterative arrays of Mealy automata (Q599501) (← links)
- Sur les générateurs algébriques et linéaires (Q599515) (← links)
- Über Separatoren in planaren Graphen (Q599822) (← links)
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- On stateless deterministic restarting automata (Q611046) (← links)
- A note on prefix primitive words (Q611047) (← links)
- Using the causal domain to specify and verify distributed programs (Q678251) (← links)
- Performance preorder and competitive equivalence (Q678252) (← links)
- Random sprouts as internet models, and Pólya processes (Q707453) (← links)
- An axiomatization of graphs (Q707454) (← links)
- Maintaining mobile transactional consistency in hybrid broadcast environments (Q707494) (← links)
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees (Q707496) (← links)
- Trading polarizations for labels in P systems with active membranes (Q707497) (← links)
- P systems with symport/antiport simulating counter automata (Q707498) (← links)
- Three-element codes with one \(d\)-primitive word (Q707501) (← links)
- Randomization adaptive self-stabilization (Q707595) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- A note on pure codes (Q707598) (← links)
- ``Backward'' coinduction, Nash equilibrium and the rationality of escalation (Q715039) (← links)
- Least common container of tree pattern queries and its applications (Q715041) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- On timed alternating simulation for concurrent timed games (Q715043) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- Stochastic game logic (Q715046) (← links)
- Prefix-primitive annihilators of languages under some operations (Q715048) (← links)
- An algorithmic study of switch graphs (Q715049) (← links)
- Algebras for iteration and infinite computations (Q715050) (← links)
- Abstract reduction in directed model checking CCS processes (Q715051) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- On the power of enzymatic numerical P systems (Q715056) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Final and sequential behaviours of M-automata (Q731331) (← links)
