Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
F
Fekete SP, Khuller S, Klemmstein M, Raghavachari B, Young N.  1997.  A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. Journal of Algorithms. 24(2):310-324.
Feige U, Halldórsson MM, Kortsarz G, Srinivasan A.  2003.  Approximating the domatic number. SIAM Journal on Computing. 32(1):172-195.
Fei Wu P, Qu Y, Fleischmann K, Golbeck J, Jaeger P, Preece J, Shneiderman B.  2008.  Designing community-based emergency communication system: A preliminary study. Proceedings of the American Society for Information Science and Technology. 45(1):1-3.
Fedder GK, Blanton S, Carley LR, Gupta SK, Koester D.  2001.  Integrated Microelectromechanical System (MEMS) Inertial Measurement Unit (IMIMU).
Feamster N, Johari R, Balakrishnan H.  2005.  Stable Policy Routing with Provider Independence. MIT-CSAIL-TR-2005-009
Feamster N, Gray A.  2008.  Can great research be taught?: independent research with cross-disciplinary thinking and broader impact Proceedings of the 39th SIGCSE technical symposium on Computer science education. :471-475.
Feamster N, Bansal D, Balakrishnan H.  2001.  On the interactions between layered quality adaptation and congestion control for streaming video. 11th International Packet Video Workshop.
Feamster N, Borkenhagen J, Rexford J.  2003.  Guidelines for interdomain traffic engineering. SIGCOMM Comput. Commun. Rev.. 33(5):19-30.
Feamster N.  2004.  Practical verification techniques for wide-area routing. SIGCOMM Comput. Commun. Rev.. 34(1):87-92.
Feamster N, Johari R, Balakrishnan H.  2007.  Implications of Autonomy for the Expressiveness of Policy Routing. Networking, IEEE/ACM Transactions on. 15(6):1266-1279.
Feamster N, Rexford J.  2007.  Network-Wide Prediction of BGP Routes. Networking, IEEE/ACM Transactions on. 15(2):253-266.
Feamster N, Balakrishnan H.  2005.  Correctness properties for Internet routing. Allerton Conference on Communication, Control, and Computing.
Feamster N.  2006.  Can Information from End Systems Improve Routing. Proceedings of the Workshop on Internet Routing Evolution and Design.
Feamster N, Voellmy A, Agarwal A, Hudak P, Burnett S, Launchbury J.  2010.  Don't Configure the Network, Program It! Domain-Specific Programming Languages for Network Systems. YALEU/DCS/RR-1432
Feamster N, Dingledine R.  2004.  Location diversity in anonymity networks. Proceedings of the 2004 ACM workshop on Privacy in the electronic society. :66-76.
Feamster N, Motiwala M, Vempala S.  2007.  Path splicing with network slicing. Proc. ACM SIGCOMM Hot-Nets.
Feamster N, Balazinska M, Wang W, Balakrishnan H, Karger D.  2003.  Thwarting Web Censorship with Untrusted Messenger Discovery. Privacy Enhancing TechnologiesPrivacy Enhancing Technologies. 2760:125-140.
Feamster N, Balakrishnan H.  2004.  Verifying the Correctness of Wide-Area Internet Routing. MIT-CSAIL-TR-2004-031
Feamster N, Johari R, Balakrishnan H.  2005.  Implications of autonomy for the expressiveness of policy routing. Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications. :25-36.
Feamster N, Rexford J.  2004.  Modeling BGP route selection within an AS. IEEE/ACM Transactions on Networking.
Feamster N, Mao Z M, Rexford J.  2004.  BorderGuard: detecting cold potatoes from peers. Proceedings of the 4th ACM SIGCOMM conference on Internet measurement. :213-218.
Feamster N, Balakrishnan H.  2002.  Packet loss recovery for streaming video. 12th International Packet Video Workshop.
Feamster N, Rexford J.  2002.  Network-wide BGP route prediction for traffic engineering. Proceedings of ITCOM.
Feamster N, Hassan U, Sundaresan S, Valancius V, Johari R, Vazirani V.  2009.  Towards an Internet Connectivity Market. GT-CS-09-01
Feamster N, Balakrishnan H.  2005.  Detecting BGP configuration faults with static analysis. Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2. :43-56.

Pages