Now showing items 298-300 of 3794

    • The Round Complexity of Secure Protocols 

      Rogaway, Phillip (1991-04)
      Assume we have a network of three of more players, each player in possession of some private input. The players want to compute some function of these private inputs, but in a way which protects the privacy of each ...
    • Performance Tradeoffs in Multithreaded Processors 

      Agarwal, Anant (1991-04)
      High network latencies in large-scale multiprocessors can cause a significant drop in processor utilization. By maintaining multiple process contexts in hardware and switching among them in a few cycles, multithreaded ...
    • Randomness and Robustness in Hypercube Computation 

      Newman, Mark Joseph (1991-04)
      In this thesis we explore means by which hypercubes can compute despite faulty processors and links. We also study techniques which enable hypercubes to simulate dynamically changing networks and data structures.