Publications

Found 642 results
Author Title [ Type(Desc)] Year
Filters: First Letter Of Last Name is R  [Clear All Filters]
Technical Report
Knightly, E. W., & Rossaro P. (1995).  Smoothing and Multiplexing Tradeoffs for Deterministic Performance Guarantees to VBR Video.
Liskiewicz, M., & Reischuk R. (1996).  Space Bounds for Interactive Proof Systems with Public Coins and Bounded Number of Rounds.
Rayner, M., Hockey B. Ann, Renders J-M., Chatzichrisafis N., & Farrell K. (2005).  Spoken Language Processing in the Clarissa Procedure Browser.
Rayner, M., Hockey B. Ann, Renders J-M., Chatzichrisafis N., & Farrell K. (2005).  Spoken Language Processing in the Clarissa Procedure Browser.
Rössner, C., & Schnorr C. P. (1994).  A Stable Integer Relation Algorithm.
Luby, M., & Rackoff C. (1989).  A Study of Password Security.
Karpinski, M., & Rytter W. (1993).  On a Sublinear Time Parallel Construction of Optimal Binary Search Trees.
Liskiewicz, M., & Reischuk R. (1993).  The Sublogarithmic Space World.
Partridge, C., Rockwell D.., Allman M., Krishnan R., & Sterbenz J. P. G. (2002).  A Swifter Start for TCP.
Rasti, R., Murthy M., & Paxson V. (2014).  Temporal Lensing and its Application in Pulsing Denial of Service Attacks.
Ladkin, P., Anger F. D., & Rodriguez R. V. (1990).  Temporal Resoning with Intervals in Branching Time.
Randall, D., & Sinclair A. (1993).  Testable Algorithms for Self-Avoiding Walks.
Chang, S-Y., Morgan N., Raju A., Alwan A., & Kreiman J. (2015).  Using Fast and Slow Modulations to Model Human Hearing of Fast and Slow Speech.
Frieze, A., Karp R. M., & Reed B. (1992).  When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?.
Srivastava, M., Hansen M., Burke J., Parker A., Reddy S., Saurabh G., et al. (2006).  Wireless Urban Sensing Systems.
Thesis
Radoslavov, P. (2001).  The Relationship Between Topology and Protocol Performance: Case Studies.
Unpublished
Raskutti, G., & Mahoney M. (2014).  A Statistical Perspective on Randomized Sketching for Ordinary Least-Squares.

Pages