Publications

Found 194 results
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is C  [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 
C
Cohen, M., Franco H., Morgan N., Rumelhart D., & Abrash V. (1992).  Hybrid Neural Network / Hidden Markov Model Continuous Speech Recognition. Proceedings of the International Conference on Spoken Language Processing (ICSLP'92). 915-918.
Codenotti, B., & Margara L. (1992).  Efficient Clustering Techniques for the Geometric Traveling Salesman Problem.
Codenotti, B., Leoncini M., & Resta G. (1991).  Oracle Computations in Parallel Numerical Linear Algebra.
Codenotti, B., Manzini G., Margara L., & Resta G. (1993).  Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP.
Codenotti, B., Datta B. N., Datta K., & Leoncini M. (1994).  Fast and Efficient Parallel Algorithms for Problems in Control Theory.
Codenotti, B., & Margara L. (1992).  Local Properties of Some NP-Complete Problems.
Cocchi, R., Shenker S., Estrin D., & Zhang L. (1993).  Pricing in Computer Networks: Motivation, Formulation, and Example. IEEE/ACM Transactions on Networking. 1(6), 614-627.
Cocchi, R., Estrin D., Shenker S., & Zhang L. (1991).  A Study of Priority Pricing in Multiple Service Class Networks. Proceedings of the ACM SIGCOMM '91 Conference on Communications Architecture & Protocols. 123-130.
Cleve, R. (1989).  Controlled Gradual Disclosure Schemes for Random Bits and Their Applications.
Cleve, R., & Luby M. (1990).  A Note on Self-Testing/Correcting Methods for Trigonometric Functions.
Cleve, R. (1990).  Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S..
Cleve, R., & Dagum P. (1989).  A Constructive Omega(t(superscript 1.26)) Lower Bound for the Ramsey Number R (3,t).
Cleve, R. (1990).  Towards Optimal Simulations of Formulas by Bounded-Width Programs.
Clay, R. D., & Séquin C. H. (1991).  Limiting Fault-Induced Output Errors In ANNs.
Clausen, M., Dress A., Grabmeier J., & Karpinski M. (1989).  On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials over Finite Fields.
Clark, D. D., Estrin D., Herzog S., & Shenker S. (1996).  Pricing in Computer Networks: Reshaping the Research Agenda. 97-126.
Clark, D. D., Shenker S., & Zhang L. (1992).  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism. Proceedings of the ACM SIGCOMM '92 Conference on Communications Architecture & Protocols. 14-26.
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., Krauthgamer R., et al. (2005).  Asymmetric K-Center Is Log* N-Hard to Approximate. Journal of the ACM. 52(4), 538-551.
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., & Naor S.. (2004).  Tight Lower Bounds for the Asymetric k-Center Problem. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04).
Chun, B-G., Chen K., Lee G., Katz R. H., & Shenker S. (2008).  D3: Declarative Distributed Debugging.
Chun, B-G., Maniatis P., & Shenker S. (2008).  Diverse Replication for Single-Machine Byzantine-Fault Tolerance. 287-292.
Chun, B., Hellerstein J. M., Huebsch R., Jeffery S. R., Loo B. Thau, Mardanbeigi S., et al. (2004).  Querying at Internet Scale. Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '04). 935-936.
Chun, B-G., Maniatis P., Shenker S., & Kubiatowicz J. D. (2007).  Attested Append-Only Memory: Making Adversaries Stick to their Word. ACM SIGOPS Operating Systems Review. 41(6), 189-204.
Chun, B-G., Ratnasamy S., & Kohler E. (2008).  NetComplex: A Complexity Metric for Network System Designs. Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2008). 393-406.
Chun, B-G., Maniatis P., Shenker S., & Kubiatowicz J. D. (2009).  Tiered Fault Tolerance for Long-Term Integrity. 267-282.

Pages