David Serena

According to our database, David Serena authored at least 5 papers between 1998 and 2006.

Collaborative distances:

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

2006

Pairwise edge disjoint shortest paths in the n-cube.

Teofilo F. Gonzalez, David Serena

Theor. Comput. Sci., 2006

2004

Complexity of pairwise shortest path routing in the grid.

Teofilo F. Gonzalez, David Serena

Theor. Comput. Sci., 2004

<i>n</i>-Cube network: node disjoint shortest paths for maximal distance pairs of vertices.

Teofilo F. Gonzalez, David Serena

Parallel Comput., 2004

2002

Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems.

Teofilo F. Gonzalez, David Serena

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

1998

Improved Concurrency Control Techniques For Multi-Dimensional Index Structures.

Kothuri Venkata Ravi Kanth, David Serena, Ambuj K. Singh

Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998