Theory of Communication Network
Project status: Active
Research Areas
People
| Eli Upfal |
Publications
Flaxman, A., Frieze, A., and Upfal, E. Efficient communication in an ad-hoc network. Journal of Algorithms 52 (2004), 1-7. [ pdf ]
McDiarmid, C., Luzak, M., and Upfal, E. On-line routing of random calls. Probability Theory and Related Fields 125 (2003), 457-482. [ pdf ]
Broder, A., Frieze, A., and Upfal, E. A general approach to dynamic packet routing with bounded buffers. J. of the ACM 48 (2001), 324-349. [ pdf ]
Pandurangan, G., Raghavan, P., and Upfal, E. Building low-diameter P2P networks. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (2001), pp. 492-499. [ pdf ]
Pandurangan, G., and Upfal, E. Static and dynamic evaluation of QoS properties. Journal of Interconnection Networks 1 (2000), 135-150. [ pdf ]
Pandurangan, G., and Upfal, E. Static and dynamic evaluation of QoS properties. In Proceedings of the 31st ACM Symposium on Theory of Computing (1999), pp. 566-573. [ pdf ]
Broder, A., Frieze, A., and Upfal, E. Dynamic packet routing on arrays with bounded buffers. In Proceedings of the Third Latin American Symposium on Theoretical Informatics (LATIN '98) (Apr 1998), pp. 273-281. [ pdf ]
Borodin, A., Raghavan, P., Schieber, B., and Upfal, E. How much can hardware help routing? Journal of the ACM 44 (1997), 726-741. [ pdf ]
Broder, A., Frieze, A., and Upfal, E. Static and dynamic path selection on expander graphs: a random walk approach. In Proceedings of the 29th ACM Symposium on Theory of Computing (1997), pp. 531-539. [ pdf ]
Bruck, J., Ho, C.-T., Kipnis, S., Upfal, E., and Weathersby, D. Efficient algorithms for all-to-all communication in multiport message-passing systems. IEEE Trans. on Parallel and Distributed Computing 8 (1997), 1143-1156. [ pdf ]
Broder, A., and Upfal, E. Dynamic deflection routing on arrays. In Proceedings of the 28th ACM Symposium on Theory of Computing (1996), pp. 348-355. [ pdf ]
Broder, A., Frieze, A., Suen, S., and Upfal, E. An efficient algorithm for the vertex-disjoint paths problem in random graphs. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (1996), pp. 261-268. [ pdf ]
Broder, A., Frieze, A., and Upfal, E. A general approach to dynamic packet routing with bounded buffers. In Proceedings of the 37th IEEE Symposium on the Foundations of Computer Science (1996), pp. 390-399. [ pdf ]
Felperin, S., Raghavan, P., and Upfal, E. A theory of wormhole routing in parallel computers. IEEE Transactions on Computing 45 (1996), 704-713. [ pdf ]
Preminger, S., and Upfal, E. Safe and efficient traffic laws for mobile robots. In Proceedings of the Scandinavian Workshop on Algorithm Theory (Jul 1996), pp. 357-367.
Upfal, E., Felperin, S., and Snir, M. Randomized routing with shorter paths. IEEE Transactions on Parallel and Distributed Computing 7 (1996), 356-362. [ pdf ]
Feige, U., Peleg, D., Raghavan, P., and Upfal, E. Computing with noisy information. SIAM Journal on Computing 23 (1994), 1001-1018. [ pdf ]
Borodin, A., Raghavan, P., Schieber, B., and Upfal, E. How much can hardware help routing? In Proceedings of the 25th ACM Symposium on Theory of Computing (1993), pp. 573-582. [ pdf ]
Upfal, E., Felperin, S., and Snir, M. Randomized routing with shorter paths. In Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures (1993), pp. 283-292. [ pdf ]
Broder, A., Frieze, A., Shamir, E., and Upfal, E. Near-perfect token distribution. In Proceedings of the International Colloquium on Automata, Languages and Programming (1992), pp. 308-317.
Felperin, S., Raghavan, P., and Upfal, E. An experimental study of wormhole routing in parallel computers. In Parallel Architectures and Their Efficient Use, Proceedings of the First Heinz Nixdorf Symposium (Paderborn, Germany, 1992), pp. 156-165.
Felperin, S., Raghavan, P., and Upfal, E. A theory of wormhole routing in parallel computers. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (1992), pp. 563-572. [ pdf ]
Upfal, E. An O(log N) deterministic packet routing algorithm. Journal of the ACM 39 (1992), 55-70. [ pdf ]
Feige, U., Peleg, D., Raghavan, P., and Upfal, E. Randomized broadcast in networks. In Proceedings of the First International Symposium of the Special Interest Group on Algorithms (SIGAL 1990) (Aug 1990), pp. 128-137.
Peleg, P., and Upfal, E. A time-randomness tradeoff for oblivious routing. SIAM Journal on Computing 19 (1990), 256-266.
Upfal, E. An O(logN) deterministic packet routing algorithm. In Proceedings of the ACM Symposium on Theory of Computing (1989), pp. 241-250.
Dwork, C., Peleg, D., Pippenger, N., and Upfal, E. Fault tolerance in network of bounded degree. SIAM Journal on Computing 17 (1988), 975-988.
Peleg, D., and Upfal, E. A tradeoff between space and efficiency for routing tables. In Proceedings of the ACM Symposium on Theory of Computing (1988), pp. 43-52.
Peleg, D., and Upfal, E. The generalized packet routing problem. Theoretical Computer Science 53 (1987), 281-293.
Dwork, C., Peleg, D., Pippenger, N., and Upfal, E. Fault tolerance in networks of bounded degree. In Proceedings of the ACM Symposium on Theory of Computing (1986), pp. 370-379.
Upfal, E. Efficient schemes for parallel communication. Journal of the ACM 31 (1984), 507-517.
Upfal, E. Efficient schemes for parallel communication. In Proceedings of the ACM SIGACT - SIGOPS Symposium on Principles of Distributed Computing (1982), pp. 55-59.
| Page Owner: Webmaster | Last Modified: Mon Oct 23 14:57:09 2006 |