Publications

Export 566 results:
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is V  [Clear All Filters]
Conference Papers
Naishlos D, Nuzman J, Tseng CW, Vishkin U.  2000.  Evaluating multi-threading in the prototype XMT environment. Proc. 4th Workshop on Multi-Threaded Execution, Architecture and Compliation (MTEAC2000).
Sehgal V, Getoor L, Viechnicki PD.  2006.  Entity resolution in geospatial data integration. Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems. :83-90.
Weinberg M, Candler R, Chandorkar S, Varsanik J, Kenny T, Duwel A.  2009.  Energy loss in MEMS resonators and the impact on inertial and RF devices. :688-695.
Perry DE, Porter A, Votta LG.  2000.  Empirical studies of software engineering: a roadmap. Proceedings of the conference on The future of Software engineering. :345-355.
Karr A, Porter A, Votta L.  1996.  An empirical exploration of code evolution. International Workshop on Empirical Studies of Software Maintenance.
Lacroix Z, Raschid L, Vidal ME.  2004.  Efficient techniques to explore and rank paths in life science data sources. Data Integration in the Life Sciences. :187-202.
Landau GM, Vishkin U.  1985.  Efficient string matching in the presence of errors. Foundations of Computer Science, 1985., 26th Annual Symposium on. :126-136.
Ramachandran V, Vishkin U.  1988.  Efficient parallel triconnectivity in logarithmic time. VLSI Algorithms and Architectures. :33-42.
Sahinalp SC, Vishkin U.  1996.  Efficient approximate and dynamic matching of patterns using a labeling paradigm. Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on. :320-328.
Xia JC, Varshney A.  1996.  Dynamic view-dependent simplification for polygonal models. Visualization '96. Proceedings.. :327-334.
Wagstrom P, Martino J, von Kaenel J, Chetty M, Thomas J, Jones L.  2011.  A Dive into Online Community Properties. CSCW '11. :725-728.
Vishkin U.  1990.  Deterministic sampling—a new technique for fast pattern matching. Proceedings of the twenty-second annual ACM symposium on Theory of computing. :170-180.
Cole R, Vishkin U.  1986.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. Proceedings of the eighteenth annual ACM symposium on Theory of computing. :206-219.
Varshney A, Brooks Jr FP, Manocha D, Wright WV, Richardson DC.  1995.  Defining, Computing, and Visualizing Molecular Interfaces. Proceedings of the 6th conference on Visualization '95. :36–-36–.
Hui A, Vaczlavik L, De Floriani L.  2006.  A decomposition-based representation for 3D simplicial complexes. Proceedings of the fourth Eurographics symposium on Geometry processing. :101-110.
Varna AL, Swaminathan A, M. Wu.  2008.  A decision theoretic framework for analyzing binary hash-based content identification systems. Proceedings of the 8th ACM workshop on Digital rights management. :67-76.
Van Horn D, Mairson HG.  2008.  Deciding kCFA is Complete for EXPTIME. ICFP '08 Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming. :275-282.
Mihaila G, Naumann F, Raschid L, Vidal ME.  2005.  A data model and query language to explore enhanced links and paths in life science sources. Proceedings of the ACM SIGMOD Workshop on The Web and Databases (WebDB).
Matias Y, Vishkin U.  1991.  Converting high probability into nearly-constant time—with applications to parallel hashing. Proceedings of the twenty-third annual ACM symposium on Theory of computing. :307-316.
El-Sana J, Varshney A.  1997.  Controlled simplification of genus for polygonal models. Visualization '97., Proceedings. :403-410.
Swaminathan A, Mao Y, Su G-M, Gou H, Varna AL, He S, M. Wu, Oard D.  2007.  Confidentiality-preserving rank-ordered search. Proceedings of the 2007 ACM workshop on Storage security and survivability. :7-12.
Chandra AK, Stockmeyer LJ, Vishkin U.  1982.  A complexity theory for unbounded fan-in parallelism. 23rd Annual Symposium on Foundations of Computer Science. :1-13.
Berthier R, Korman D, Cukier M, Hiltunen M, Vesonder G, Sheleheda D.  2008.  On the Comparison of Network Attack Datasets: An Empirical Analysis. :39-48.
Shen CC, Kupershtok R, Yang B, Vanin FM, Shao X, Sheth D, Goldsman N, Balzano Q, Bhattacharyya SS.  2007.  Compact, low power wireless sensor network system for line crossing recognition. Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on. :2506-2509.
Cormode G, Paterson M, Sahinalp S C, Vishkin U.  2000.  Communication complexity of document exchange. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :197-206.

Pages