| |
| 2006 | ||
|---|---|---|
| 5 | EE | Teofilo F. Gonzalez, David Serena: Pairwise edge disjoint shortest paths in the n-cube. Theor. Comput. Sci. 369(1-3): 427-435 (2006) |
| 2004 | ||
| 4 | EE | Teofilo F. Gonzalez, David Serena: n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices. Parallel Computing 30(8): 973-998 (2004) |
| 3 | EE | Teofilo F. Gonzalez, David Serena: Complexity of pairwise shortest path routing in the grid. Theor. Comput. Sci. 326(1-3): 155-185 (2004) |
| 2002 | ||
| 2 | Teofilo F. Gonzalez, David Serena: Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems. IASTED PDCS 2002: 61-66 | |
| 1998 | ||
| 1 | EE | Kothuri Venkata Ravi Kanth, David Serena, Ambuj K. Singh: Improved Concurrency Control Techniques For Multi-Dimensional Index Structures. IPPS/SPDP 1998: 580-586 |
| 1 | Teofilo F. Gonzalez | [2] [3] [4] [5] |
| 2 | Kothuri Venkata Ravi Kanth | [1] |
| 3 | Ambuj K. Singh | [1] |