Publications

Found 1845 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 
T
Randall, D., & Sinclair A. (1993).  Testable Algorithms for Self-Avoiding Walks.
Feldman, J., Weber S. Hollbach, & Stolcke A. (1990).  A Testbed for the Miniature Language L0. Proceedings of the Fifth Rocky Mountain Conference on Artificial Intelligence.
Shriberg, E., & Ferrer L. (2007).  A Text-constrained Prosodic System for Speaker Verification. Proceedings of the 8th Annual Conference of the International Speech Communication Association (Interspeech 2007). 1226-1229.
Shenker, S. (1990).  A Theoretical Analysis of Feedback Flow Control. Proceedings of the ACM SIGCOMM Symposium on Communications Architectures & Protocols. 156-165.
Blum, L., Shub M., & Smale S. (1988).  On a Theory of Computation and Complexity Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines.
Blum, L., Shub M., & Smale S. (1988).  On a Theory of Computation and Complexity Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines.
McCauley, J., Panda A., Krishnamurthy A., & Shenker S. (2019).  Thoughts on Load Distribution and the Role of Programmable Switches. Newsletter of ACM SIGCOMM Computer Communication Review. 49(1), 18-23.
Hadziosmanovic, D., Sommer R., Zambon E., & Hartel P. (2013).  Through the Eye of the PLC: Towards Semantic Security Monitoring for Industrial Control Systems.
Chun, B-G., Maniatis P., Shenker S., & Kubiatowicz J. D. (2009).  Tiered Fault Tolerance for Long-Term Integrity. 267-282.
Elsässer, R., & Sauerwald T. (2009).  Tight Bounds for the Cover Time of Multiple Random Walks. 415-426.
Staniford, S., Moore D., Paxson V., & Weaver N. (2004).  The Top Speed of Flash Worms. Proceedings of the ACM Workshop on Rapid Malcode (WORM 2004).
Widom, M., & Shenker S. (1984).  Topological Phase Transitions. 46-51.
Wang, R., & Shapiro V. (2019).  Topological semantics for lumped parameter systems modeling. Advanced Engineering Informatics. 42,
Ratnasamy, S., Handley M., Karp R. M., & Shenker S. (2002).  Topologically-Aware Overlay Construction and Server Selection. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002). 3, 1190-1199.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. 74-89.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Torque: Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. Nucleic Acids Research. 37, 106-108.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. 74-89.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Torque: Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. Nucleic Acids Research. 37, 106-108.
Feldman, J., & Shields P.. C. (1977).  Total Complexity and the Inference of Best Programs. 10, 181-191.
Feldman, J., & Shields P.. (1976).  Total Complexity and the Inference of Best Programs. 10,
Gairing, M., & Schoppmann F.. (2007).  Total Latency in Singleton Congestion Games. Proceedings of the Third International Workshop on Internet and Network Economics (WINE 2007). 381-387.

Pages