The following pages link to Acta Informatica (Q161641):
Displaying 50 items.
- A logic covering undefinedness in program proofs (Q790610) (← links)
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles (Q790614) (← links)
- On real-time cellular automata and trellis automata (Q790615) (← links)
- A performance guarantee for the greedy set-partitioning algorithm (Q790814) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- A set-theoretic semantics for Clear (Q791329) (← links)
- The paging drum queue: A uniform perspective and further results (Q792089) (← links)
- A denotational semantics for shared-memory parallelism and nondeterminism (Q792754) (← links)
- On some variants of Post's correspondence problem (Q792770) (← links)
- A fair calculus of communicating systems (Q793508) (← links)
- Generalized binary split trees (Q794439) (← links)
- On the generative power of regular pattern grammars (Q794441) (← links)
- On binary tree encodements (Q795519) (← links)
- Characterization of all optimal networks for a simultaneous computation of AND and NOR (Q796492) (← links)
- Polyvariant mixed computation for analyzer programs (Q796970) (← links)
- An algorithm for merging heaps (Q797280) (← links)
- The residue of vector sets with applications to decidability problems in Petri nets (Q797285) (← links)
- Some average performance measures for the B-tree (Q797287) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- Practical LL(1)-based parsing of van Wijngaarden grammars (Q797298) (← links)
- Querying fragmented relations in a distributed database (Q797313) (← links)
- Strongest invariant functions: Their use in the systematic analysis of while statements (Q797985) (← links)
- A general proof rule for procedures in predicate transformer semantics (Q797986) (← links)
- Throughput of a satellite channel-communication (Q798292) (← links)
- A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\) (Q798294) (← links)
- Replaceability and computational equivalence for monotone boolean functions (Q798296) (← links)
- Standard model semantics for DSL. A data type specification language (Q799366) (← links)
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories (Q799371) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Using circular programs to eliminate multiple traversals of data (Q800713) (← links)
- Short proofs for tricky formulas (Q800909) (← links)
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- Deadlock-freedom in resource contentions (Q801672) (← links)
- Complexity of the word problem for commutative semigroups of fixed dimension (Q802020) (← links)
- On parallel integer sorting (Q805234) (← links)
- On partitions and presortedness of sequences (Q808689) (← links)
- A model and a fast algorithm for multiple errors spelling correction (Q808697) (← links)
- On finitely recognizable semigroups (Q811558) (← links)
- Single machine flow-time scheduling with scheduled maintenance (Q811593) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
- DKL: an efficient algorithm for learning deterministic Kripke structures (Q824283) (← links)
- Measuring the constrained reachability in quantum Markov chains (Q824285) (← links)
- Automata-based verification of programs with tree updates (Q845236) (← links)
- \(M/M/1\) retrial queue with working vacations (Q845237) (← links)
- Symmetry and partial order reduction techniques in model checking Rebeca (Q845239) (← links)
- Programmed grammars and their relation to the LBA problem (Q852006) (← links)
- Distances in random digital search trees (Q852009) (← links)
- Linearly bounded infinite graphs (Q852011) (← links)
- Representing the integers with powers of 2 and 3. (Q854677) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)