IEEE Transactions on Computers

Titel Veröffentlichungsdatum Sprache Zitate
A dynamic priority assignment technique for streams with (m, k)-firm deadlines1995/01/01129
Lee distance and topological properties of k-ary n-cubes1995/01/01128
Clock skew optimization1990/07/01124
Network resilience: a measure of network fault tolerance1990/01/01119
Incomplete hypercubes1988/05/01117
Performability analysis: measures, an algorithm, and a case study1988/04/01113
A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach1996/03/01112
Channel occupancy times and handoff rate for mobile computing and PCS networks1998/06/01112
Genetic algorithm and graph partitioning1996/07/01108
Multiple-way network partitioning1989/01/01108
Addressing, routing, and broadcasting in hexagonal mesh multiprocessors1990/01/01105
Polymorphic-torus network1989/01/01105
The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI1989/04/01105
The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments1995/01/01105
Coverage modeling for dependability analysis of fault-tolerant systems1989/06/01104
Data diversity: an approach to software fault tolerance1988/04/01103
Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding1991/01/01102
Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers1995/01/0199
Fault-tolerant wormhole routing algorithms for mesh networks1995/07/0198
Testing finite-state machines: state identification and verification1994/03/0197
Weakly hard real-time systems2001/04/0197
Enhanced hypercubes1991/03/0195
A VLIW architecture for a trace scheduling compiler1988/01/0195
Parallel computations on reconfigurable meshes1993/06/0194
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields1998/03/0192
A chip-multiprocessor architecture with speculative multithreading1999/01/0191
Executing a program on the MIT tagged-token dataflow architecture1990/03/0191
Distributed scheduling of tasks with deadlines and resource requirements1989/01/0191
Division algorithms and implementations1997/01/0190
Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model1999/01/0190