Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.
Internet
Services
· A Transport Layer for Live Streaming in a Content Delivery Network, with Leonidas Kontothanassis, Joel Wein, Duke Hong, Robert Kleinberg, Brian Mancuso, David Shaw, and Daniel Stodolsky. Proceedings of the IEEE, Special Issue on Evolution of Internet Technologies 92(9):1408-1419 (September, 2004).
· Globally distributed content delivery, with J. Dilley, B. Maggs, J. Parikh, H. Prokop, and B. Weihl, IEEE Internet Computing, September/October 2002, pp. 50-58.
· A Measurement-Based Analysis of Multihoming, with A. Akella, B. Maggs, S. Seshan, and A. Shaikh, Proceedings of the 2003 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), August 2003.
· Designing Overlay Multicast Networks for Streaming, with K. Andreev, B. M. Maggs, and A. Meyerson, Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 2003.
· Tree Layout for Internal Network Characterizations in Multicast Networks, with M. Adler, T. Bu, and D. Towsley, Proceedings of Third International Workshop on Networked Group Communication, London, pp. 189--204, Nov. 2001.
Communication Networks
· Augmented Ring Networks, with W. Aiello, S.N. Bhatt, F.R.K. Chung, and A.L. Rosenberg, IEEE Transactions on Parallel and Distributed Systems, 12 (2001) pp. 598-609. Conference version: 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Proceedings in Informatics 5, Carleton Scientific, pp. 1--16, July 1999.
· On the Benefit of Supporting Virtual Channels in Wormhole Routers, with R. Cole and B.M. Maggs, Journal of Computer and System Sciences (JCSS), Vol. 62, No. 1, February 2001, pp. 152-177. Conference Version: 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.131-141, June 1996.
· On the Bisection Width and Expansion of Butterfly Networks, with C. F. Bornstein, A. Litman, B. M. Maggs, and T. Yatzkar, Theory of Computing Systems (TOCS), Vol. 34, No. 6, November 2001, pp. 491-518. Conference Version: First Merged International Parallel Processing Symposium (IPPS) and Symposium on Parallel and Distributed Processing (SPDP), pp. 144-150, March 1998.
· Convergence and Concentration Results for Packet Routing Networks, with S. Datta, 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Proceedings in Informatics 5, Carleton Scientific, pp. 78--92, July 1999.
· Simple algorithms for routing on butterfly networks with bounded queues, with B. Maggs, SIAM Journal on Computing, Vol. 28, No. 3, pp. 984--1003, 1999. Conference Version: Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), pp. 150--161, May 1992.
· Scheduling time-constrained communication in linear networks, with M. Adler, A.L. Rosenberg, and W. Unger, 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 1998.
· Randomized protocols for low-congestion circuit routing in multistage interconnection networks, with R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schroder, and B. Vocking, Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), May 1998.
· The performance of simple routing algorithms that drop packets, with S. Datta, 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 159-167, June, 1997.
· Routing on Butterfly Networks with Random Faults, with R. Cole and B.M. Maggs, 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 558--570, October 1995.
Fault Tolerance
· On the fault tolerance of some popular bounded-degree networks, with F.T. Leighton, and B.M. Maggs, SIAM Journal on Computing, Vol. 27, No. 5, pp. 1303--1333, October 1998. Conference Version: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 542--552, October 1992.
·
Reconfiguring
Arrays with Faults Part I: Worst-Case Faults, with
R. Cole and B. Maggs,
· Optimal design of checks for error detection and location in fault tolerant multiprocessor systems, with N. K. Jha, IEEE Transactions on Computers, Vol. 42, No. 7, pp. 780--793, 1993. Conference Version: Proceedings of the Fault Tolerant Computing Systems Conference, pp. 396--406, September 1991.
Parallel and Distributed Computation
· Optimal clustering of tree-sweep computations for high-latency parallel environments, with L. Gao and A. L. Rosenberg, IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 8, pp. 813--824, August 1999. Conference Version: Optimal Architecture-Independent Scheduling of Fine-Grain Tree-Sweep Computations, with L. Gao and A. Rosenberg, 7th IEEE Symposium on Parallel and Distributed Processing (SPDP), pp. 620-629, Oct 1995.
· The reconfigurable ring of processors: Fine-grain tree-structured computations, with A.L. Rosenberg and V. Scarano, IEEE Transactions on Computers, Vol. 46, No. 10, pp. 1119 -- 1131, October 1997. Conference Version: 6th IEEE Symposium on Parallel and Distributed Processing} (SPDP), pp. 470--477, Oct 1994.
· The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Emulation, with A. L. Rosenberg and V. Scarano, special issue on ``Dynamically Reconfigurable Architectures'' of Parallel Processing Letters, Vol. 5, No. 1, pp. 37--48, 1995.
· Efficient emulations of trees and arrays on a reconfigurable ring of processors, with A.L. Rosenberg and V. Scarano, Invited paper, 11th International Conference on Mathematical and Computer Modelling and Scientific Computing (ICMCM & SC), March 1997.
· On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors, with L. Gao and A. Rosenberg, 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 309--317, June 1996.
Randomized Algorithms
· The power of two random choices: A survey of the techniques and results, with M. Mitzenmacher and A. Richa, Handbook of Randomized Computing, vol 1, pp. 255-305, July 2001, edited by P. Pardalos, S. Rajasekaran, and J. Rolim, Kluwer Press.
·
On Balls
and Bins with Deletions, with R. Cole, A. Frieze, B.M. Maggs,
M. Mitzenmacher, A. W. Richa,
and E. Upfal,
2nd International Workshop on Randomization and Approximation Techniques
in Computer Science (RANDOM), Barcelona, Spain, October 1998.
Miscellaneous
·
A system to
place observers on a polyhedral terrain in polynomial time, with
M. Marengoni, B.A. Draper, and A. Hanson, Image and
Vision Computing Journal, 18: pages 773-780, 2000. Conference
Version: 3rd {IEEE} Workshop on Applications of Computer Vision,
· Parallel Optimization of Motion Controllers via Policy Iteration, with J.A. Coelho and R.A. Grupen, Advances in Neural Information Processing Systems Conference} {(NIPS)}, pp. 996--1002, MIT Press, November 1995.
· Learning programs with an easy to calculate set of errors, with W. Gasarch, C. Smith, and, M. Velauthapillai, Fundamenta Informaticae, Vol. 16, No. 3-4, pp. 355--370, 1992. Conference Version: Proceedings of the Workshop on Computational Learning Theory (COLT), May 1988.
· Probabilistic analysis of two stage matching, with A. Rosenfeld, Pattern Recognition, Vol. 22, No. 3, pp. 331--343, 1989.
· Using probabilistic domain knowledge to reduce the expected cost of matching, with A. Margalit and A. Rosenfeld, Image Understanding Workshop, pp. 678--689, April 1988.