| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Gordon T. Wilfong 27 Jianying Hu , Ramanujan Kashi , Daniel P. Lopresti , Gordon T. Wilfong: Evaluating the performance of table processing algorithms. IJDAR 4 (3): 140-153 (2002) 26 Daniel P. Lopresti , Gordon T. Wilfong: Comparing Semi-Structured Documents via Graph Probing. Multimedia Information Systems 2001 : 41-50 25 Timothy Griffin , Gordon T. Wilfong: A Safe Path Vector Protocol. INFOCOM 2000 : 490-499 24 April Rasala , Gordon T. Wilfong: Strictly non-blocking WDM cross-connects. SODA 2000 : 606-615 23 April Rasala , Gordon T. Wilfong: Strictly non-blocking WDM cross-connects for heterogeneous networks. STOC 2000 : 514-523 22 Jianying Hu , Ramanujan Kashi , Gordon T. Wilfong: Comparison and Classification of Documents Based on Layout Similarity. Information Retrieval 2 (2/3): 227-243 (2000) 21 Jianying Hu , Ramanujan Kashi , Gordon T. Wilfong: Document Classification Using Layout Analysis. DEXA Workshop 1999 : 556-560 20 Timothy Griffin , F. Bruce Shepherd , Gordon T. Wilfong: Policy Disputes in Path-Vector Protocols. ICNP 1999 : 21-30 19 Timothy Griffin , Gordon T. Wilfong: An Analysis of BGP Convergence Properties. SIGCOMM 1999 : 277-288 18 Daniel P. Lopresti , Gordon T. Wilfong: Cross-Domain Approximate String Matching. SPIRE/CRIWG 1999 : 120-127 17 Gordon T. Wilfong, Peter Winkler : Ring Routing and Wavelength Translation. SODA 1998 : 333-341 16 Mark de Berg , Henk Meijer , Mark H. Overmars , Gordon T. Wilfong: Computing the Angularity Tolerance. International Journal of Computational Geometry and Applications 8 (4): 467- (1998) 15 Gordon T. Wilfong: On-line Algorithms for Compressing Planar Curves. SODA 1997 : 158-165 14 Mark de Berg , Prosenjit Bose , David Bremner , Suneeta Ramaswami , Gordon T. Wilfong: Computing Constrained Minimum-Width Annuli of Point Sets. WADS 1997 : 392-401 13 Boudewijn Asberg , Gregoria Blanco , Prosenjit Bose , Jesus Garcia-Lopez , Mark H. Overmars , Godfried T. Toussaint , Gordon T. Wilfong, Binhai Zhu : Feasibility of Design in Stereolithography. Algorithmica 19 (1/2): 61-83 (1997) 12 Gordon T. Wilfong: Minimum Wavelength in an All-Optical Ring Network. ISAAC 1996 : 346-355 11 Gordon T. Wilfong, Frank Sinden , Laurence Ruedisueli : On-Line Recognition of Handwritten Symbols. IEEE Transactions on Pattern Analysis and Machine Intelligence 18 (9): 935-940 (1996) 10 Boudewijn Asberg , Gregoria Blanco , Prosenjit Bose , Jesus Garcia-Lopez , Mark H. Overmars , Godfried T. Toussaint , Gordon T. Wilfong, Binhai Zhu : Feasability of Design in Stereolithography. FSTTCS 1993 : 228-237 9 Gordon T. Wilfong: Nearest neighbor problems. International Journal of Computational Geometry and Applications 2 (4): 383-416 (1992) 8 Gordon T. Wilfong: Nearest Neighbor Problems. Symposium on Computational Geometry 1991 : 224-233 7 Gordon T. Wilfong: Motion Planning in the Presence of Movable Obstacles. Annals of Mathematics and Artificial Intelligence 3 (1): 0- (1991) 6 Steven Fortune , Gordon T. Wilfong: Planning Constrained Motion. Annals of Mathematics and Artificial Intelligence 3 (1): 21-82 (1991) 5 Gordon T. Wilfong: Guest Editor's Introduction: Robotics and Automation. IEEE Computer 22 (3): 6-7 (1989) 4 Steven Fortune , Gordon T. Wilfong: Planning Constrained Motion. STOC 1988 : 445-459 3 Boris Aronov , Steven Fortune , Gordon T. Wilfong: The Furthest-Site Geodesic Voronoi Diagram. Symposium on Computational Geometry 1988 : 229-240 2 Gordon T. Wilfong: Motion Planning in the Presence of Movable Obstacles. Symposium on Computational Geometry 1988 : 279-288 1 John E. Hopcroft , Gordon T. Wilfong: Reducing Multiple Object Motion Planning to Graph Searching. SIAM J. Comput. 15 (3): 768-785 (1986)  DiSC'02 © 2003 Association for Computing Machinery |
