We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
A simulation model was developed and tested using Taylor II to justify the implementation of a Flexible Manufacturing Cell (FMC). The current production capacity at the existing C...
: Every information channel within Africa is restricted. Limited budgets cause televison stations to produce few shows of their own and to fill airtime with cheap American imports ...
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...