Sergio A. Felperin

According to our database, Sergio A. Felperin authored at least 8 papers between 1991 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1996

Randomized Routing with Shorter Paths.

Eli Upfal, Sergio A. Felperin, Marc Snir

IEEE Trans. Parallel Distributed Syst., 1996

A Theory of Wormhole Routing in Parallel Computers.

Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal

IEEE Trans. Computers, 1996

1994

Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations.

Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz

IEEE Trans. Parallel Distributed Syst., 1994

1992

An Experimental Study of Wormhole Routing in Parallel Computers.

Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

A Theory of Wormhole Routing in Parallel Computers (Extended Abstract)

Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Routing techniques for massively parallel communication.

Sergio A. Felperin, Luis Gravano, Gustavo D. Pifarré, Jorge L. C. Sanz

Proc. IEEE, 1991

Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks.

Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Fully-adaptive routing: packet switching performance and wormhole algorithms.

Sergio A. Felperin, Luis Gravano, Gustavo D. Pifarré, Jorge L. C. Sanz

Proceedings of the Proceedings Supercomputing '91, 1991