Publications

Found 4139 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 
A
Ahmad, S., & Omohundro S. (1991).  Efficient Visual Search: A Connectionist Solution.
Ahmad, S. (1991).  VISIT: An Efficient Computational Model Of Human Visual Attention.
Ahmad, S., & Omohundro S. (1990).  A Network for Extracting the Locations of Point Clusters Using Selective Attention.
Agarwal, D.., & Floyd S. (1994).  A Tool for Debugging Internet Multicast Routing. Proceedings of the 22nd Annual ACM Computer Science Conference (CSC '94).
Afroz, S., Javed M., Paxson V., Qazi S. Asif, Sajid S., & Tschantz M. Carl (2018).  A Bestiary of Blocking The Motivations and Modes behind Website Unavailability.
Afroz, S., Fifield D., Tschantz M. Carl, Paxson V., & Tygar J.D.. (2015).  Censorship Arms Race: Research vs. Practice. Proceedings of the Workshop on Hot Topics in Privacy Enhancing Technologies (HotPETs).
Afroz, S., Biggio B., Carlini N., Elovici Y., & Shabtai A. (2019).  AISec'19: 12th ACM Workshop on Artificial Intelligence and Security. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. 2707-2708.
Afroz, S., Tschantz M. Carl, Sajid S., Qazi S. Asif, Javed M., & Paxson V. (2018).  Exploring Server-side Blocking of Regions.
Adler, M., Halperin E., Karp R. M., & Vazirani V. V. (2003).  A Stochastic Process on the Hypercube with Applications to Peer to Peer Networks. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel sorting with limited bandwidth. Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95). 129-136.
Adler, I., Ahn H-S., Karp R. M., & Ross S. M. (2005).  A Probabilistic Model for the Survivability of Cells. Journal of Applied Probability. 42(4), 919-931.
Adler, I., Karp R. M., & Shamir R. (1986).  A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only. Mathematics of Operations Research. 11(4), 570-590.
Adler, I., Ahn H.. S., Karp R. M., & Ross S. M. (2003).  Coalescing Times for IID Random Variables.
Adler, M., Halperin E., Karp R. M., & Vazirani V. V. (2003).  A Stochastic Process on the Hypercube with Applications to Peer-to-peer Networks. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003). 575-584.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling parallel communication: the h-relation problem. Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). 1-20.
Adler, I., Karp R. M., & Shamir R. (1987).  A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps. Journal of Complexity. 3(4), 372-387.
Adler, M., Bartal Y., Byers J. W., Luby M., & Raz D. (1997).  A Modular Analysis of Network Transmission Protocols.
Adler, M., Byers J. W., & Karp R. M. (2000).  Parallel Sorting with Limited Bandwidth. 29(6), 1997-2015.
Adler, M., Gemmell P., Harchol-Balter M., Karp R. M., & Kenyon C. (1994).  Selection in the presence of noise: the design of playoff systems. Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 564-572.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling Parallel Communication: The h-Relation Problem.
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel Sorting With Limited Bandwidth.
Adcock, A. B., Sullivan B. D., & Mahoney M. W. (2014).  Tree Decompositions and Social Graphs.
Adams, O., Cohn T., Neubig G., Cruz H., Bird S., & Michaud A. (2018).  Evaluating phonemic transcription of low-resource tonal languages for language documentation. Proceedings of the LREC 2018 Workshop.
Adams, A. K., Mahdavi J., Mathis M., & Paxson V. (1998).  Creating a Scalable Architecture for Internet Measurement. Proceedings of the Internet Summit (INET '98).
Adams, A. K., Bu T., Cáceres R., Duffield N., Friedman T., Horowitz J., et al. (2000).  The Use of End-to-end Multicast Measurements for Characterizing Internal Network Behavior.

Pages