Result 21 to 40 of 45 total
On deciding trace equivalences for processes. (English)
Inf. Sci. 72, No.1-2, 105-121 (1993).
21
Determining performance measures of algorithm-based fault tolerant systems. (English)
J. Parallel Distrib. Comput. 18, No.1, 56-70 (1993).
22
Removing redundancy from a clause. (English)
Artif. Intell. 61, No.2, 263-289 (1993).
23
The equivalence problem for finite rings. (English)
J. Symb. Comput. 15, No.1, 67-71 (1993).
24
A characterisation of well-covered cubic graphs. (English)
J. Comb. Math. Comb. Comput. 13, 193-212 (1993).
25
Polynomial tests of normal forms and some related results. (English)
J. Comput. Sci. Technol. 7, No.1, 75-82 (1992).
26
Sequential Diagnosability is Co-NP Complete. (English)
IEEE Transactions on Computers 40, No.05, 584-595 (1991).
27
Fibres and ordered set coloring. (English)
J. Comb. Theory, Ser. A 58, No.1, 158-164 (1991).
28
On preemptive scheduling of periodic, real-time tasks on one processor. (English)
Mathematical foundations of computer science, Proc. 15th Symp., MFCS’90, Banská Bystrica/Czech. 1990, Lect. Notes Comput. Sci. 452, 173-179 (1990).
29
A Note on Detecting Sneak Paths in Transistor Networks. (English)
IEEE Transactions on Computers 38, No.06, 861-864 (1989).
30
A note on the computational complexity of the pure classical implication calculus. (English)
Inf. Process. Lett. 31, No.6, 277-278 (1989).
31
On the complexity of single fault set diagnosablity and diagnosis problems. (English)
IEEE Trans. Comput. 38, No.2, 195-201 (1989).
32
A new algorithm for scheduling periodic, real-time tasks. (English)
Algorithmica 4, No.2, 209-219 (1989).
33
Set limited relativization. (English)
An. Ştiinţ. Univ. Al. I. Cuza Iaşi, Ser. Nouă, Mat. 35, No.4, Inf.,, 329-335 (1989).
34
Are there interactive protocols for co-NP languages? (English)
Inf. Process. Lett. 28, No.5, 249-251 (1988).
35
The word and generator problems for lattices. (English)
Inf. Comput. 77, No.3, 192-217 (1988).
36
On the computational complexity of algebra on lattices. (English)
SIAM J. Comput. 16, 129-148 (1987).
37
The complexity of the word problem for abelian l-groups. (English)
Theor. Comput. Sci. 48, 127-132 (1986).
38
A topological view of some problems in complexity theory. (English)
Theory of algorithms, Colloq. Pécs/Hung. 1984, Colloq. Math. Soc. János Bolyai 44, 387-391 (1986).
39
Quantitative relativizations of complexity classes. (English)
SIAM J. Comput. 13, 461-487 (1984).
40
Result 21 to 40 of 45 total
Start
Contact
Print
General Help
