Publications

Export 566 results:
Author [ Title(Asc)] Type Year
Filters: First Letter Of Last Name is V  [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 
F
Lu W, Varna AL, Wu M.  2010.  Forensic hash for multimedia information. SPIE Media Forensics and Security. :7541–0Y-7541–0Y.
Van Horn D, Mairson HG.  2008.  Flow Analysis, Linearity, and PTIME. Static Analysis. :255-269.
Van Horn D, Mairson HG.  2008.  Flow Analysis, Linearity, and PTIME. Static Analysis. :255-269.
Varadarajan R, Hristidis V, Raschid L, Vidal ME, Ibá\ nez L, Rodríguez-Drumond H.  2009.  Flexible and efficient querying and ranking on hyperlinked data sources. Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology. :553-564.
Varadarajan R, Hristidis V, Raschid L, Vidal ME, Ibá\ nez L, Rodríguez-Drumond H.  2009.  Flexible and efficient querying and ranking on hyperlinked data sources. Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology. :553-564.
Ramachandran A, Feamster N, Krishnamurthy B, Spatscheck O, Van der Merwe J.  2008.  Fishing for Phishing from the Network Stream. GT-CS-08-08
Balog K, de Vries AP, Serdyukov P, Wen J-R.  2012.  The first international workshop on entity-oriented search (EOS). SIGIR Forum. 45(2):43-50.
Varna AL, He S, Swaminathan A, M. Wu.  2009.  Fingerprinting Compressed Multimedia Signals. Information Forensics and Security, IEEE Transactions on. 4(3):330-345.
Varshney A, Kaufman A.  1996.  FINESSE: a financial information spreadsheet. Information Visualization '96, Proceedings IEEE Symposium on. :70-71,125-70-71,125.
O'Leary DP.  1987.  Fine and Medium Grained Parallel Algorithms for Matrix QR Factorization. Algorithms and Applications on Vector and Parallel ComputersAlgorithms and Applications on Vector and Parallel Computers. :347-349.
Shiloach Y, Vishkin U.  1981.  Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.
Schieber B, Vishkin U.  1988.  On finding lowest common ancestors: simplification and parallelization. VLSI Algorithms and Architectures. :111-123.
Berkman O, Vishkin U.  1994.  Finding level-ancestors in trees. Journal of Computer and System Sciences. 48(2):214-230.
Atallah M, Vishkin U.  1984.  Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.
Vishkin RETU.  1984.  Finding biconnected components and computing tree functions in logarithmic parallel time. 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998: proceedings. :12-12.
Schieber B, Vishkin U.  1990.  Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics. 29(1):97-111.
Megiddo N, Vishkin U.  1988.  On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.
Ramachandran A, Feamster N, Vempala S.  2007.  Filtering spam with behavioral blacklisting. Proceedings of the 14th ACM conference on Computer and communications security. :342-351.
Cole R, Vishkin U.  1989.  Faster optimal parallel prefix sums and list ranking. Information and Computation. 81(3):334-352.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences* 1,* 2. Journal of Computer and System Sciences. 37(1):63-78.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences.. J. COMP. SYST. SCI.. 37(1):63-78.
Landau GM, Vishkin U.  1989.  Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.
Berkman O, Schieber B, Vishkin U.  1996.  A fast parallel algorithm for finding the convex hull of a sorted point set. International Journal of Computational Geometry and Applications. 6:231-242.
Ramachandran A, Seetharaman S, Feamster N, Vazirani V.  2008.  Fast monitoring of traffic subpopulations. Proceedings of the 8th ACM SIGCOMM conference on Internet measurement. :257-270.
Sankaranarayanan J, Samet H, Varshney A.  2006.  A Fast k-Neighborhood Algorithm for Large Point-Clouds. Proceedings of the 3rd IEEE/Eurographics Symposium on Point-Based Graphics. ACM, Boston, MA, USA.

Pages