Publications

Found 1886 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is S  [Clear All Filters]
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 
B
Surana, S., Patra R., Nedevschi S., Ramos M., Subramanian L., Ben-David Y., et al. (2008).  Beyond Pilots: Keeping Rural Wireless Networks Alive.
Surana, S., Patra R., Nedevschi S., Ramos M., Subramanian L., Ben-David Y., et al. (2008).  Beyond Pilots: Keeping Rural Wireless Networks Alive.
Vallina-Rodriguez, N., Sundaresan S., Kreibich C., Weaver N., & Paxson V. (2014).  Beyond the Radio: Illuminating the Higher Layers of Mobile Networks.
Vallina-Rodriguez, N., Sundaresan S., Kreibich C., Weaver N., & Paxson V. (2015).  Beyond the Radio: Illuminating the Higher Layers of Mobile Networks.
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. J. (2002).  A BGP-Based Mechanism for Lowest-Cost Routing. Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). 173-182.
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. J. (2002).  A BGP-Based Mechanism for Lowest-Cost Routing. Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). 173-182.
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. J. (2005).  A BGP-Based Mechanism for Lowest-Cost Routing. Distributed Computing. 18(1), 61-72.
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. J. (2005).  A BGP-Based Mechanism for Lowest-Cost Routing. Distributed Computing. 18(1), 61-72.
Pang, R., Paxson V., Sommer R., & Peterson L. (2006).  binpac: A yacc for Writing Application Protocol Parsers. Proceedings of the Internet Measurement Conference 2006 (IMC 2006). 289-300.
Shastri, L. (1999).  A Biological Grounding of Recruitment Learning and Vicinal Algorithms.
Shastri, L. (2001).  Biological grounding of recruitment learning and vicinal algorithms in long-term potentiation. 348-367.
Graciarena, M., Delplanche M., Shriberg E., & Stolcke A. (2011).  Bird Species Recognition Combining Acoustic and Sequence Modeling. 341-344.
Graciarena, M., Delplanche M., Shriberg E., & Stolcke A. (2011).  Bird Species Recognition Combining Acoustic and Sequence Modeling. 341-344.
Halvorson, T., Szurdi J., Maier G., Felegyhazi M., Kreibich C., Weaver N., et al. (2012).  The BIZ Top-Level Domain: Ten Years Later.
Schnorr, C. P., & Vaudenay S. (1994).  Black Box Cryptanalysis of Hash Networks Based on Multipermutations.
Schnorr, C. P. (1992).  Block Korkin-Zolotarev Bases and Successive Minima.
Schuett, D.., Eckhardt U.., & Suda P.. (1992).  Boot Algebras.
Schuett, D.., Eckhardt U.., & Suda P.. (1992).  Boot Algebras.
Pitsillidis, A., Levchenko K., Kreibich C., Kanich C., Voelker G. M., Paxson V., et al. (2010).  Botnet Judo: Fighting Spam with Itself.
Fornasa, M., Stecca M., Maresca M., & Baglietto P. (2015).  Bounded Latency Spanning Tree Reconfiguration. Computer Networks. 76, 259-274.
Iyer, A. Padmanabha, Panda A., Venkataraman S., Chowdhury M., Akella A., Shenker S. J., et al. (2018).  Bridging the GAP: towards approximate graph analytics. Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA).
Iyer, A. Padmanabha, Panda A., Venkataraman S., Chowdhury M., Akella A., Shenker S. J., et al. (2018).  Bridging the GAP: towards approximate graph analytics. Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA).
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S. J., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S. J., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S. J., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.

Pages