Publications

Export 7151 results:
Author Title Type [ Year(Desc)]
2001
Browne H, Bederson BB, Plaisant C, Druin A.  2001.  Designing an Interactive Message Board as a Technology Probe for Family Communication. Technical Reports of the Computer Science Department.
Shankar U, Talwar K, Foster JS, Wagner D.  2001.  Detecting format string vulnerabilities with type qualifiers. Proceedings of the 10th conference on USENIX Security Symposium-Volume 10. :16-16.
Varshney A, Kalaiah A.  2001.  Differential point rendering. Proceedings of 12th Eurographics Workshop on Rendering. :139-50.
Shneiderman B.  2001.  The Digital University: Building a Learning Community.
Spencer JH, Srinivasan A, Tetali P.  2001.  The discrepancy of permutation families. Unpublished manuscript.
Beynon MD, Kurc T, Catalyurek U, Chang C, Sussman A, Saltz J.  2001.  Distributed processing of very large datasets with DataCutter. Parallel Computing. 27(11):1457-1478.
Srinivasan A.  2001.  Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
Srinivasan A.  2001.  Domatic partitions and the Lovász local lemma. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :922-923.
Fu K, Sit E, Smith K, Feamster N.  2001.  Dos and don'ts of client authentication on the web. Proceedings of the 10th conference on USENIX Security Symposium - Volume 10. :19-19.
Tang L, Shneiderman B.  2001.  Dynamic Aggregation to Support Pattern Discovery: A Case Study with Web Logs. Discovery ScienceDiscovery Science. 2226:464-469.
Dang G, North C, Shneiderman B.  2001.  Dynamic queries and brushing on choropleth maps. Fifth International Conference on Information Visualisation, 2001. Proceedings. :757-764.
Krishnamurthy S, Sanders WH, Cukier M.  2001.  A dynamic replica selection algorithm for tolerating timing faults. :107-116.
M. Wu, Joyce RA, Wong H-S, Guan L, Kung S-Y.  2001.  Dynamic resource allocation via video content and short-term traffic statistics. Multimedia, IEEE Transactions on. 3(2):186-199.
Hicks MW, Moore JT, Nettles S.  2001.  Dynamic software updating. Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation. :13-23.
Basili VR.  2001.  Editorial: Open source and empirical software engineering. Empirical Software Engineering. 6(3):193-194.
Maneewongvatana S, Mount D.  2001.  On the efficiency of nearest neighbor searching with data clustered in lower dimensions. Computational Science—ICCS 2001. :842-851.
Kumaran K, Srinivasan A, Wang Q, Lanning S, Ramakrishnan KG.  2001.  Efficient algorithms for location and sizing problems in network design. IEEE Global Telecommunications Conference, 2001. GLOBECOM '01. 4:2586-2590vol.4-2586-2590vol.4.
Di Crescenzo G, Katz J, Ostrovsky R, Smith A.  2001.  Efficient and Non-interactive Non-malleable Commitment. Advances in Cryptology — EUROCRYPT 2001Advances in Cryptology — EUROCRYPT 2001. 2045:40-59.
Duraiswami R, Gumerov NA, Zotkin DN, Davis LS.  2001.  Efficient evaluation of reverberant sound fields. Applications of Signal Processing to Audio and Acoustics, 2001 IEEE Workshop on the. :203-206.
Habash N, Dorr BJ, Traum D.  2001.  Efficient Language Independent Generation from Lexical Conceptual Structure.
Bhat GS, Cleaveland R, Groce A.  2001.  Efficient Model Checking Via Buchi Tableau Automata⋆. Computer aided verification: 13th International conference, CAV 2001, Paris, France, July 18-22, 2001: proceedings. 2102:38-38.
Ryu KD, Hollingsworth J, Keleher PJ.  2001.  Efficient network and I/O throttling for fine-grain cycle stealing. Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '01. :3-3.
Katz J, Ostrovsky R, Yung M.  2001.  Efficient password-authenticated key exchange using human-memorable passwords. Advances in Cryptology—EUROCRYPT 2001. :475-494.
Pop M, Duncan C, Barequet G, Goodrich M, Huang W, Kumar S.  2001.  Efficient perspective-accurate silhouette computation and applications. Proceedings of the seventeenth annual symposium on Computational geometry. :60-68.
Mount D, Netanyahu NS.  2001.  Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.

Pages