| 2008 |
|---|
| 48 | EE | Penny E. Haxell,
Gordon T. Wilfong:
A fractional model of the border gateway protocol (BGP).
SODA 2008: 193-199 |
| 47 | EE | Elliot Anshelevich,
Gordon T. Wilfong:
Network Formation and Routing by Strategic Agents Using Local Contracts.
WINE 2008: 386-393 |
| 2007 |
|---|
| 46 | EE | P. Donovan,
F. Bruce Shepherd,
Adrian Vetta,
Gordon T. Wilfong:
Degree-constrained network flows.
STOC 2007: 681-688 |
| 45 | EE | Eric S. Fisher,
Steven Fortune,
Martin K. Gladstein,
Suresh Goyal,
William B. Lyons,
James H. Mosher Jr.,
Gordon T. Wilfong:
Economic modeling of global test strategy I: Mathematical models.
Bell Labs Technical Journal 12(1): 161-173 (2007) |
| 44 | EE | Eric S. Fisher,
Steven Fortune,
Martin K. Gladstein,
Suresh Goyal,
William B. Lyons,
James H. Mosher Jr.,
Gordon T. Wilfong:
Economic modeling of global test strategy II: Software system and examples.
Bell Labs Technical Journal 12(1): 175-186 (2007) |
| 2006 |
|---|
| 43 | EE | Elliot Anshelevich,
F. Bruce Shepherd,
Gordon T. Wilfong:
Strategic Network Formation through Peering and Service Agreements.
FOCS 2006: 77-86 |
| 42 | EE | Girija J. Narlikar,
Gordon T. Wilfong,
Lisa Zhang:
Designing Multihop Wireless Backhaul Networks with Delay Guarantees.
INFOCOM 2006 |
| 41 | EE | Chandra Chekuri,
Paul Claisse,
René-Jean Essiambre,
Steven Fortune,
Daniel C. Kilper,
Wonsuck Lee,
Nachi K. Nithi,
Iraj Saniee,
F. Bruce Shepherd,
Christopher A. White,
Gordon T. Wilfong,
Lisa Zhang:
Design tools for transparent optical networks.
Bell Labs Technical Journal 11(2): 129-143 (2006) |
| 2005 |
|---|
| 40 | EE | April Rasala Lehman,
Gordon T. Wilfong:
http: //epubs.siam.org/SICOMP/volume-35/art_43425.html.
SIAM J. Comput. 35(2): 449-485 (2005) |
| 2003 |
|---|
| 39 | EE | Daniel P. Lopresti,
Gordon T. Wilfong:
A fast technique for comparing graph representations with applications to performance evaluation.
IJDAR 6(4): 219-229 (2003) |
| 2002 |
|---|
| 38 | EE | Penny E. Haxell,
April Rasala,
Gordon T. Wilfong,
Peter Winkler:
Wide-Sense Nonblocking WDM Cross-Connects.
ESA 2002: 538-549 |
| 37 | EE | Timothy Griffin,
Gordon T. Wilfong:
Analysis of the MED Oscillation Problem in BGP.
ICNP 2002: 90-99 |
| 36 | EE | Timothy Griffin,
Gordon T. Wilfong:
On the correctness of IBGP configuration.
SIGCOMM 2002: 17-29 |
| 35 | EE | Anindya Basu,
C.-H. Luke Ong,
April Rasala,
F. Bruce Shepherd,
Gordon T. Wilfong:
Route oscillations in I-BGP with route reflection.
SIGCOMM 2002: 235-247 |
| 34 | EE | Timothy Griffin,
F. Bruce Shepherd,
Gordon T. Wilfong:
The stable paths problem and interdomain routing.
IEEE/ACM Trans. Netw. 10(2): 232-243 (2002) |
| 33 | EE | Jianying Hu,
Ramanujan S. Kashi,
Daniel P. Lopresti,
Gordon T. Wilfong:
Evaluating the performance of table processing algorithms.
IJDAR 4(3): 140-153 (2002) |
| 2001 |
|---|
| 32 | EE | Daniel P. Lopresti,
Gordon T. Wilfong:
Evaluating Document Analysis Results via Graph Probing.
ICDAR 2001: 116-120 |
| 31 | EE | Jianying Hu,
Ramanujan S. Kashi,
Daniel P. Lopresti,
Gordon T. Wilfong,
George Nagy:
Why Table Ground-Truthing is Hard.
ICDAR 2001: 129-133 |
| 30 | | Daniel P. Lopresti,
Gordon T. Wilfong:
Comparing Semi-Structured Documents via Graph Probing.
Multimedia Information Systems 2001: 41-50 |
| 2000 |
|---|
| 29 | EE | Timothy Griffin,
Gordon T. Wilfong:
A Safe Path Vector Protocol.
INFOCOM 2000: 490-499 |
| 28 | EE | April Rasala,
Gordon T. Wilfong:
Strictly non-blocking WDM cross-connects.
SODA 2000: 606-615 |
| 27 | EE | April Rasala,
Gordon T. Wilfong:
Strictly non-blocking WDM cross-connects for heterogeneous networks.
STOC 2000: 514-523 |
| 26 | | Jianying Hu,
Ramanujan S. Kashi,
Gordon T. Wilfong:
Comparison and Classification of Documents Based on Layout Similarity.
Inf. Retr. 2(2/3): 227-243 (2000) |
| 1999 |
|---|
| 25 | EE | Jianying Hu,
Ramanujan S. Kashi,
Gordon T. Wilfong:
Document Classification Using Layout Analysis.
DEXA Workshop 1999: 556-560 |
| 24 | EE | Jianying Hu,
Ramanujan S. Kashi,
Gordon T. Wilfong:
Document Image Layout Comparison and Classification.
ICDAR 1999: 285-288 |
| 23 | EE | Timothy Griffin,
F. Bruce Shepherd,
Gordon T. Wilfong:
Policy Disputes in Path-Vector Protocols.
ICNP 1999: 21-30 |
| 22 | EE | Timothy Griffin,
Gordon T. Wilfong:
An Analysis of BGP Convergence Properties.
SIGCOMM 1999: 277-288 |
| 21 | EE | Daniel P. Lopresti,
Gordon T. Wilfong:
Cross-Domain Approximate String Matching.
SPIRE/CRIWG 1999: 120-127 |
| 1998 |
|---|
| 20 | | Gordon T. Wilfong,
Peter Winkler:
Ring Routing and Wavelength Translation.
SODA 1998: 333-341 |
| 19 | EE | Mark de Berg,
Prosenjit Bose,
David Bremner,
Suneeta Ramaswami,
Gordon T. Wilfong:
Computing constrained minimum-width annuli of point sets.
Computer-Aided Design 30(4): 267-275 (1998) |
| 18 | | Mark de Berg,
Henk Meijer,
Mark H. Overmars,
Gordon T. Wilfong:
Computing the Angularity Tolerance.
Int. J. Comput. Geometry Appl. 8(4): 467- (1998) |
| 1997 |
|---|
| 17 | | Gordon T. Wilfong:
On-line Algorithms for Compressing Planar Curves.
SODA 1997: 158-165 |
| 16 | | Mark de Berg,
Prosenjit Bose,
David Bremner,
Suneeta Ramaswami,
Gordon T. Wilfong:
Computing Constrained Minimum-Width Annuli of Point Sets.
WADS 1997: 392-401 |
| 15 | | 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) |
| 1996 |
|---|
| 14 | | Mark de Berg,
Henk Meijer,
Mark H. Overmars,
Gordon T. Wilfong:
Computing the Angularity Tolerance.
CCCG 1996: 331-336 |
| 13 | | Gordon T. Wilfong:
Minimum Wavelength in an All-Optical Ring Network.
ISAAC 1996: 346-355 |
| 12 | EE | Gordon T. Wilfong,
Frank Sinden,
Laurence Ruedisueli:
On-Line Recognition of Handwritten Symbols.
IEEE Trans. Pattern Anal. Mach. Intell. 18(9): 935-940 (1996) |
| 1993 |
|---|
| 11 | | 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 |
| 10 | | Boris Aronov,
Steven Fortune,
Gordon T. Wilfong:
The Furthest-Site Geodesic Voronoi Diagram.
Discrete & Computational Geometry 9: 217-255 (1993) |
| 1992 |
|---|
| 9 | | Gordon T. Wilfong:
Nearest neighbor problems.
Int. J. Comput. Geometry Appl. 2(4): 383-416 (1992) |
| 1991 |
|---|
| 8 | EE | 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.
Ann. Math. Artif. Intell. 3(1): 131-150 (1991) |
| 6 | | Steven Fortune,
Gordon T. Wilfong:
Planning Constrained Motion.
Ann. Math. Artif. Intell. 3(1): 21-82 (1991) |
| 1989 |
|---|
| 5 | | Gordon T. Wilfong:
Guest Editor's Introduction: Robotics and Automation.
IEEE Computer 22(3): 6-7 (1989) |
| 1988 |
|---|
| 4 | | Steven Fortune,
Gordon T. Wilfong:
Planning Constrained Motion
STOC 1988: 445-459 |
| 3 | EE | Boris Aronov,
Steven Fortune,
Gordon T. Wilfong:
The Furthest-Site Geodesic Voronoi Diagram.
Symposium on Computational Geometry 1988: 229-240 |
| 2 | EE | Gordon T. Wilfong:
Motion Planning in the Presence of Movable Obstacles.
Symposium on Computational Geometry 1988: 279-288 |
| 1986 |
|---|
| 1 | | John E. Hopcroft,
Gordon T. Wilfong:
Reducing Multiple Object Motion Planning to Graph Searching.
SIAM J. Comput. 15(3): 768-785 (1986) |
