Suchergebnisse - "IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing."

Proceedings 17th IEEE Annual Conference on Computational Complexity.

Quelle: Proceedings 17th IEEE Annual Conference on Computational Complexity; 2002, piii-viii, 6p

Preface.

Quelle: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science; 2015, pxii-xii, 1p

On the Extension of Sarrus’ Rule to n×n  (n>3) Matrices: Development of New Method for the Computation of the Determinant of 4×4 Matrix.

Autoren: Sobamowo, M. G.

Quelle: International Journal of Engineering Mathematics; 12/5/2016, p1-14, 14p

Schlagwörter: MATRICES (Mathematics), DETERMINANTAL varieties, MATHEMATICAL models, ENGINEERING mathematics, NUMERICAL calculations, COMPUTATIONAL mathematics

Cover Pages.

Quelle: 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05); 2005, pi-iv, 4p

Preface.

Quelle: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS); 2016, pxiii-xiii, 1p

42nd IEEE Symposium On Foundations Of Computer Science.

Quelle: Proceedings 2001 IEEE International Conference on Cluster Computing; 2001, pi-viii, 8p

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

Quelle: Proceedings 14th Symposium on Logic in Computer Science (Cat No PR00158); 1999, p01, 1p

25th Annual Symposium on Foundations of Computer Science [front matter].

Quelle: 25th Annual Symposium onFoundations of Computer Science, 1984; 1984, pi-xii, 12p

Table of contents.

Quelle: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983); 1983, pix-xii, 4p

THE RANDOM ADVERSARY: A LOWER-BOUND TECHNIQUE FOR RANDOMIZED PARALLEL ALGORITHMS.

Autoren: Mackenzie, Philip D.

Quelle: SIAM Journal on Computing; 1997, Vol. 26 Issue 6, p1559, 22p

Schlagwörter: PARALLEL algorithms, HAMILTONIAN systems, RANDOM graphs

The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors.

Autoren: Rosenberg

Quelle: IEEE Transactions on Computers; 1983, Vol. C-32 Issue 10, p902-910, 9p

A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers.

Autoren: Preparata

Quelle: IEEE Transactions on Computers; 1983, Vol. C-32 Issue 2, p194-198, 5p

A Dictionary Machine (for VLSI).

Autoren: Ottmann Rosenberg Stockmeyer

Quelle: IEEE Transactions on Computers; 1982, Vol. C-31 Issue 9, p892-897, 6p

Proceedings 18th IEEE Annual Conference on Computational Complexity.

Quelle: Proceedings of the 18th IEEE Annual Conference on Computational Complexity, 2003; 2003, pN.PAG, 1p

Proceedings 18th Annual IEEE Symposium on Logic in Computer Science.

Quelle: Proceedings of the 18th Annual IEEE Symposium of Logic in Computer Science, 2003; 2003, pN.PAG, 1p

Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

Quelle: Proceedings 17th Annual IEEE Symposium on Logic in Computer Science; 2002, pN.PAG, 1p

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

Quelle: Proceedings 16th Annual IEEE Symposium on Logic in Computer Science; 2001, pN.PAG, 1p

Proceedings 16th Annual IEEE Conference on Computational Complexity.

Quelle: Proceedings 16th Annual IEEE Conference on Computational Complexity; 2001, pN.PAG, 1p

Proceedings 15th Annual IEEE Conference on Computational Complexity.

Quelle: Proceedings 15th Annual IEEE Conference on Computational Complexity; 2000, pN.PAG, 1p

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Quelle: Proceedings Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (CatNo99CB36317); 1999, piii-iii, 1p