Authors: LIBESKINDHADAS R

Citation: R. Libeskindhadas, A TIGHT LOWER-BOUND ON THE NUMBER OF CHANNELS REQUIRED FOR DEADLOCK-FREE WORMHOLE ROUTING, I.E.E.E. transactions on computers, 47(10), 1998, pp. 1158-1160

Authors: LIBESKINDHADAS R

Citation: R. Libeskindhadas, SORTING IN PARALLEL, The American mathematical monthly, 105(3), 1998, pp. 238-245

Authors: LIBESKINDHADAS R SHRIVASTAVA N MELHEM RG LIU CL

Citation: R. Libeskindhadas et al., OPTIMAL RECONFIGURATION ALGORITHMS FOR REAL-TIME FAULT-TOLERANT PROCESSOR ARRAYS, IEEE transactions on parallel and distributed systems, 6(5), 1995, pp. 498-510

Authors: LIBESKINDHADAS R BRANDT E

Citation: R. Libeskindhadas et E. Brandt, ORIGIN-BASED FAULT-TOLERANT ROUTING IN THE MESH, Future generations computer systems, 11(6), 1995, pp. 603-615

Authors: LIBESKINDHADAS R

Citation: R. Libeskindhadas, APPROXIMATION ALGORITHMS - GOOD SOLUTIONS TO HARD PROBLEMS, The American mathematical monthly, 102(1), 1995, pp. 57-61