Publications

Found 4228 results
[ Author(Desc)] 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 
L
Luby, M., & Rackoff C. (1989).  A Study of Password Security.
Luckie, M., Beverly R., Wu T., Allman M., & claffy kc. (2015).  Resilience of Deployed TCP to Blind Off-Path Attacks. Proceedings of ACM Internet Measurement Conference.
Lukyanenko, A., Nikolaevskiy I., Kuptsov D., Gurtov A., Ghodsi A., & Shenker S. J. (2014).  STEM+: Allocating Bandwidth Fairly To Tasks.
Lüning, A.., Friedland G., Knipping L., & Rojas R. (2007).  Visualizing Large-Screen Electronic Chalkboard Content on Handheld Devices. Proceedings of the Second IEEE International Workshop on Multimedia Technologies for E-Learning at 9th IEEE Symposium on Multimedia. 369-375.
Luo, Z., Fu S., Theis M., Hasan S., Ratnasamy S., & Shenker S. (2021).  Democratizing cellular access with CellBricks. SIGCOMM '21: Proceedings of the 2021 ACM SIGCOMM 2021 Conference.
Luque, C., Moretó M., Cazorla F. J., Gioiosa R., Buyuktosunoglu A., & Valero M. (2012).  CPU Accounting for Multicore Processors. IEEE Transactions on Computers. Vol. 61.
Lv, Q., Ratnasamy S., & Shenker S. J. (2002).  Can Heterogeneity Make Gnutella Scalable?. 94-103.
Lv, Q., Cao P., Cohen E., Li K., & Shenker S. J. (2002).  Search and Replication in Unstructured Peer-to-Peer Networks. Proceedings of the International Comference on Measurements and Modeling of Computer Systems (SIGMETRICS 2002). 258-259.
Lv, Q., Cao P., Cohen E., Li K., & Shenker S. J. (2002).  Search and Replication in Unstructured Peer-to-Peer Networks. Proceedings of the 16th International Conference on Supercomputing (ICS-02). 84-95.
Lysenko, M., & Shapiro V. (2016).  Effective contact measures. Computer-Aided Design. 70, 134-143.
M
Ma, D., Friedland G., & Krell M. Michael (2018).  OrigamiSet1.0: Two New Datasets for Origami Classification and Difficulty Estimation. Proceedings of the 7th International Meeting on Origami in Science, Mathematics and Education (7OSME).
Ma, K. W. (1995).  Applying Large Vocabulary Hybrid HMM-MLP Methods to Telephone Recognition of Digits and Natural Numbers.
Ma, L.., Montague G.., Ye J.., Yao Z.., Gholami A.., Keutzer K.., et al. (2020).  Inefficiency of K-FAC for Large Batch Size Training. Proceedings of the AAAI-20 Conference.
Maas, M., Reames P., Morlan J., Asanović K., Joseph A. D., & Kubiatowicz J. D. (2012).  GPUs: An Opportunity for Offloading Garbage Collection.
Maass, W. (1991).  On-Line Learning with an Oblivious Environment and the Power of Randomization.
Maass, W., & Turan G. (1990).  How Fast Can A Threshold Gate Learn?.
MacKie-Mason, J., Shenker S. J., & Varian H. R. (1996).  Service Architecture and Content Provision: The Network Provider as Editor. 191-208.
Magimai-Doss, M., Hakkani-Tür D., etin Ö. Ç., Shriberg E., Fung J., & Mirghafori N. (2007).  Entropy Based Classifier Combination for Sentence Segmentation. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2007). 4, 189-192.
Mahajan, R., Floyd S., & Wetherall D. (2001).  Controlling High-Bandwidth Flows at the Congested Router.
Mahajan, R., Bellovin S. M., Floyd S., Ioannidis J., Paxson V., & Shenker S. J. (2002).  Controlling High Bandwidth Aggregates in the Network. ACM SIGCOMM Computer Communication Review. 32(3), 62-73.
Mahajan, R., Bellovin S. M., Floyd S., Ioannidis J., Paxson V., & Shenker S. J. (2002).  Aggregate Congestion Control. ACM SIGCOMM Computer Communication Review. 32(1), 69.
Mahajan, R., & Floyd S. (2001).  Controlling High Bandwidth Flows at the Congested Router.
Mahdavi, J., & Paxson V. (1999).  IPPM Metrics for Measuring Connectivity.
Mahoney, M., & Drineas P. (2016).  Structural properties underlying high-quality Randomized Numerical Linear Algebra algorithms. Handbook of Big Data. 137-154.
Mahoney, M. (2014).  A New Spin on an Old Algorithm: Technical Perspective on "Communication Costs of Strassen's Matrix Multiplication". Communications of the ACM. 57(2), 106.

Pages