David Serena

Pairwise edge disjoint shortest paths in the n-cube

Teofilo F. Gonzalez, David Serena, 2006, Theor. Comput. Sci..

n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices

Teofilo F. Gonzalez, David Serena, T. Gonzalez, 2004, Parallel Comput..

Improved concurrency control techniques for multi-dimensional index structures

Ambuj K. Singh, Kothuri Venkata Ravi Kanth, David Serena, 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

Complexity of pairwise shortest path routing in the grid

Teofilo F. Gonzalez, David Serena, T. Gonzalez, 2004, Theor. Comput. Sci..

Adaptive hierarchical swarming in persistent surveillance applications

David Serena, 2005, SPIE Defense + Commercial Sensing.

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

Teofilo F. Gonzalez, David Serena, 2002, IASTED PDCS.