![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Gordon T. Wilfong
Person information
- affiliation: Bell Labs
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j31]Glencora Borradaile, Theresa Migler, Gordon T. Wilfong:
Density decompositions of networks. J. Graph Algorithms Appl. 23(4): 625-651 (2019) - [j30]Yang Xu
, Marco Cello, I-Chih Wang
, Anwar Walid, Gordon T. Wilfong, Charles H.-P. Wen
, Mario Marchese, H. Jonathan Chao:
Dynamic Switch Migration in Distributed Software-Defined Networks to Achieve Controller Load Balance. IEEE J. Sel. Areas Commun. 37(3): 515-529 (2019) - 2017
- [j29]Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang:
Egalitarian Graph Orientations. J. Graph Algorithms Appl. 21(4): 687-708 (2017) - [j28]Adiseshu Hari, Urs Niesen
, Gordon T. Wilfong:
On the Problem of Optimal Path Encoding for Software-Defined Networks. IEEE/ACM Trans. Netw. 25(1): 189-198 (2017) - [c52]W. Sean Kennedy, Vladimir Kolesnikov, Gordon T. Wilfong:
Overlaying Conditional Circuit Clauses for Secure Computation. ASIACRYPT (2) 2017: 499-528 - [c51]Marco Cello, Yang Xu
, Anwar Walid, Gordon T. Wilfong, H. Jonathan Chao, Mario Marchese
:
BalCon: A Distributed Elastic SDN Control via Efficient Switch Migration. IC2E 2017: 40-50 - 2016
- [j27]Glencora Borradaile, W. Sean Kennedy, Gordon T. Wilfong, Lisa Zhang:
Improving robustness of next-hop routing. J. Comb. Optim. 31(3): 1206-1220 (2016) - [i9]W. Sean Kennedy, Vladimir Kolesnikov, Gordon T. Wilfong:
Overlaying Circuit Clauses for Secure Computation. IACR Cryptol. ePrint Arch. 2016: 685 (2016) - 2015
- [c50]Adiseshu Hari, T. V. Lakshman, Gordon T. Wilfong:
Path switching: reduced-state flow handling in SDN using path information. CoNEXT 2015: 36:1-36:7 - [c49]F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong:
Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. FOCS 2015: 748-758 - [c48]Michael Scharf, Gordon T. Wilfong, Lisa Zhang:
Sparsifying network topologies for application guidance. IM 2015: 234-242 - [c47]Matthew Andrews, Gordon T. Wilfong, Lisa Zhang:
Analysis of k-anonymity algorithms for streaming location data. INFOCOM Workshops 2015: 1-6 - [c46]Adiseshu Hari, Urs Niesen, Gordon T. Wilfong:
Optimal path encoding for software-defined networks. ISIT 2015: 2361-2365 - [i8]Adiseshu Hari, Urs Niesen, Gordon T. Wilfong:
Optimal Path Encoding for Software-Defined Networks. CoRR abs/1507.07217 (2015) - 2014
- [j26]Bundit Laekhanukit
, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. Algorithmica 70(3): 561-593 (2014) - [i7]Glencora Borradaile, Theresa Migler, Gordon T. Wilfong:
Density decompositions of networks. CoRR abs/1405.1001 (2014) - [i6]Glencora Borradaile, William Sean Kennedy, Gordon T. Wilfong, Lisa Zhang:
Improving Robustness of Next-Hop Routing. CoRR abs/1411.2873 (2014) - 2013
- [c45]William Sean Kennedy, Jamie Morgenstern, Gordon T. Wilfong, Lisa Zhang:
Hierarchical community decomposition via oblivious routing techniques. COSN 2013: 107-118 - [c44]Li Erran Li, Vahid Liaghat, Hongze Zhao, MohammadTaghi Hajiaghayi, Dan Li, Gordon T. Wilfong, Yang Richard Yang, Chuanxiong Guo
:
PACE: Policy-Aware Application Cloud Embedding. INFOCOM 2013: 638-646 - 2012
- [j25]Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, Gordon T. Wilfong:
The Inherent Difficulty of Timely Primary-Backup Replication. Bell Labs Tech. J. 17(2): 15-24 (2012) - [j24]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The knapsack problem with neighbour constraints. J. Discrete Algorithms 16: 224-235 (2012) - [c43]Michael Dinitz, Gordon T. Wilfong:
iBGP and Constrained Connectivity. APPROX-RANDOM 2012: 122-133 - [c42]Bundit Laekhanukit
, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. ESA 2012: 719-730 - [c41]Volodymyr Kuleshov, Gordon T. Wilfong:
On the Efficiency of the Simplest Pricing Mechanisms in Two-Sided Markets. WINE 2012: 284-297 - [i5]Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. CoRR abs/1207.0043 (2012) - [i4]Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang:
Egalitarian Graph Orientations. CoRR abs/1212.2178 (2012) - 2011
- [j23]Elliot Anshelevich
, F. Bruce Shepherd, Gordon T. Wilfong:
Strategic network formation through peering and service agreements. Games Econ. Behav. 73(1): 17-38 (2011) - [c40]Sourjya Bhaumik, David Chuck, Girija J. Narlikar, Gordon T. Wilfong:
Energy-efficient design and optimization of wireline access networks. INFOCOM 2011: 451-455 - [c39]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The 1-Neighbour Knapsack Problem. IWOCA 2011: 71-84 - [c38]Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, Gordon T. Wilfong:
The inherent difficulty of timely primary-backup replication. PODC 2011: 349-350 - [i3]Sourjya Bhaumik, David Chuck, Girija J. Narlikar, Gordon T. Wilfong:
Energy-Efficient Design and Optimization of Wireline Access Networks. CoRR abs/1101.2717 (2011) - [i2]Michael Dinitz, Gordon T. Wilfong:
iBGP and Constrained Connectivity. CoRR abs/1107.2299 (2011) - 2010
- [j22]Penny E. Haxell, Gordon T. Wilfong:
On the Stable Paths Problem. SIAM J. Discret. Math. 24(3): 1137-1152 (2010) - [j21]Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang:
Designing multihop wireless backhaul networks with delay guarantees. Wirel. Networks 16(1): 237-254 (2010)
2000 – 2009
- 2009
- [i1]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
Approximation Algorithms for Constrained Knapsack Problems. CoRR abs/0910.0777 (2009) - 2008
- [c37]Penny E. Haxell, Gordon T. Wilfong:
A fractional model of the border gateway protocol (BGP). SODA 2008: 193-199 - [c36]Elliot Anshelevich
, Gordon T. Wilfong:
Network Formation and Routing by Strategic Agents Using Local Contracts. WINE 2008: 386-393 - 2007
- [j20]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 Tech. J. 12(1): 161-173 (2007) - [j19]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 Tech. J. 12(1): 175-186 (2007) - [c35]Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong:
Degree-constrained network flows. STOC 2007: 681-688 - 2006
- [j18]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 Tech. J. 11(2): 129-143 (2006) - [c34]Elliot Anshelevich
, F. Bruce Shepherd, Gordon T. Wilfong:
Strategic Network Formation through Peering and Service Agreements. FOCS 2006: 77-86 - [c33]Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang:
Designing Multihop Wireless Backhaul Networks with Delay Guarantees. INFOCOM 2006 - [c32]Seungjoon Lee, Girija J. Narlikar, Martin Pal, Gordon T. Wilfong, Lisa Zhang:
Admission control for multihop wireless backhaul networks with QoS support. WCNC 2006: 92-97 - 2005
- [j17]April Rasala Lehman, Gordon T. Wilfong:
Strictly Nonblocking WDM Cross-connects. SIAM J. Comput. 35(2): 449-485 (2005) - 2003
- [j16]Daniel P. Lopresti, Gordon T. Wilfong:
A fast technique for comparing graph representations with applications to performance evaluation. Int. J. Document Anal. Recognit. 6(4): 219-229 (2003) - [p2]Daniel Lopresti, Gordon T. Wilfong:
Applications of Graph Probing to Web Document Analysis. Web Document Analysis 2003: 19-38 - 2002
- [j15]Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong:
Evaluating the performance of table processing algorithms. Int. J. Document Anal. Recognit. 4(3): 140-153 (2002) - [j14]Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong:
The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10(2): 232-243 (2002) - [c31]Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler:
Wide-Sense Nonblocking WDM Cross-Connects. ESA 2002: 538-549 - [c30]Timothy Griffin, Gordon T. Wilfong:
Analysis of the MED Oscillation Problem in BGP. ICNP 2002: 90-99 - [c29]Timothy Griffin, Gordon T. Wilfong:
On the correctness of IBGP configuration. SIGCOMM 2002: 17-29 - [c28]Anindya Basu, Chih-Hao Luke Ong
, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong:
Route oscillations in I-BGP with route reflection. SIGCOMM 2002: 235-247 - 2001
- [c27]Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong:
Table structure recognition and its evaluation. Document Recognition and Retrieval 2001: 44-55 - [c26]Daniel P. Lopresti, Gordon T. Wilfong:
Evaluating Document Analysis Results via Graph Probing. ICDAR 2001: 116-120 - [c25]Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong, George Nagy
:
Why Table Ground-Truthing is Hard. ICDAR 2001: 129-133 - [c24]Daniel P. Lopresti, Gordon T. Wilfong:
Comparing Semi-Structured Documents via Graph Probing. Multimedia Information Systems 2001: 41-50 - 2000
- [j13]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) - [c23]Jianying Hu, Ramanujan S. Kashi, Daniel P. Lopresti, Gordon T. Wilfong:
Medium-independent table detection. Document Recognition and Retrieval 2000: 291- - [c22]Timothy Griffin, Gordon T. Wilfong:
A Safe Path Vector Protocol. INFOCOM 2000: 490-499 - [c21]April Rasala, Gordon T. Wilfong:
Strictly non-blocking WDM cross-connects. SODA 2000: 606-615 - [c20]April Rasala, Gordon T. Wilfong:
Strictly non-blocking WDM cross-connects for heterogeneous networks. STOC 2000: 514-523
1990 – 1999
- 1999
- [c19]Jianying Hu, Ramanujan S. Kashi, Gordon T. Wilfong:
Document Classification Using Layout Analysis. DEXA Workshop 1999: 556-560 - [c18]Jianying Hu, Ramanujan S. Kashi, Gordon T. Wilfong:
Document Image Layout Comparison and Classification. ICDAR 1999: 285-288 - [c17]Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong:
Policy Disputes in Path-Vector Protocols. ICNP 1999: 21-30 - [c16]Timothy Griffin, Gordon T. Wilfong:
An Analysis of BGP Convergence Properties. SIGCOMM 1999: 277-288 - [c15]Daniel P. Lopresti, Gordon T. Wilfong:
Cross-Domain Approximate String Matching. SPIRE/CRIWG 1999: 120-127 - 1998
- [j12]Mark de Berg, Prosenjit Bose
, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong:
Computing constrained minimum-width annuli of point sets. Comput. Aided Des. 30(4): 267-275 (1998) - [j11]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. 8(4): 467-482 (1998) - [c14]Gordon T. Wilfong, Peter Winkler:
Ring Routing and Wavelength Translation. SODA 1998: 333-341 - 1997
- [j10]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) - [c13]Gordon T. Wilfong:
On-line Algorithms for Compressing Planar Curves. SODA 1997: 158-165 - [c12]Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong:
Computing Constrained Minimum-Width Annuli of Point Sets. WADS 1997: 392-401 - 1996
- [j9]Gordon T. Wilfong, Frank W. Sinden, Laurence W. Ruedisueli:
On-Line Recognition of Handwritten Symbols. IEEE Trans. Pattern Anal. Mach. Intell. 18(9): 935-940 (1996) - [c11]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. CCCG 1996: 331-336 - [c10]Gordon T. Wilfong:
Minimum Wavelength in an All-Optical Ring Network. ISAAC 1996: 346-355 - 1993
- [j8]Boris Aronov
, Steven Fortune, Gordon T. Wilfong:
The Furthest-Site Geodesic Voronoi Diagram. Discret. Comput. Geom. 9: 217-255 (1993) - [c9]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 - 1992
- [j7]Gordon T. Wilfong:
Nearest neighbor problems. Int. J. Comput. Geom. Appl. 2(4): 383-416 (1992) - 1991
- [j6]Steven Fortune, Gordon T. Wilfong:
Planning Constrained Motion. Ann. Math. Artif. Intell. 3(1): 21-82 (1991) - [j5]Gordon T. Wilfong:
Motion Planning in the Presence of Movable Obstacles. Ann. Math. Artif. Intell. 3(1): 131-150 (1991) - [j4]Boris Aronov
, Steven Fortune, Gordon T. Wilfong:
Minimum-Speed Motions. Int. J. Robotics Res. 10(3): 228-239 (1991) - [c8]Gordon T. Wilfong:
Nearest Neighbor Problems. SCG 1991: 224-233 - 1990
- [c7]Gordon T. Wilfong:
Graphs with variable edge costs: a model for scheduling a vehicle subject to speed and timing restraints. IROS 1990: 73-79 - [p1]Gordon T. Wilfong:
Motion Planning for an Autonomous Vehicle. Autonomous Robot Vehicles 1990: 391-395 - [e1]Ingemar J. Cox, Gordon T. Wilfong:
Autonomous Robot Vehicles. Springer 1990, ISBN 9781461389996 [contents]
1980 – 1989
- 1989
- [j3]Gordon T. Wilfong:
Guest Editor's Introduction: Robotics and Automation. Computer 22(3): 6-7 (1989) - [c6]Gordon T. Wilfong:
Shortest paths for autonomous vehicles. ICRA 1989: 15-20 - 1988
- [j2]Michael R. Garey, Robert E. Tarjan, Gordon T. Wilfong:
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties. Math. Oper. Res. 13(2): 330-348 (1988) - [c5]Boris Aronov
, Steven Fortune, Gordon T. Wilfong:
The Furthest-Site Geodesic Voronoi Diagram. SCG 1988: 229-240 - [c4]Gordon T. Wilfong:
Motion Planning in the Presence of Movable Obstacles. SCG 1988: 279-288 - [c3]Gordon T. Wilfong:
Motion planning for an autonomous vehicle. ICRA 1988: 529-533 - [c2]Steven Fortune, Gordon T. Wilfong:
Planning Constrained Motion. STOC 1988: 445-459 - 1986
- [j1]John E. Hopcroft, Gordon T. Wilfong:
Reducing Multiple Object Motion Planning to Graph Searching. SIAM J. Comput. 15(3): 768-785 (1986) - [c1]Steven Fortune, Gordon T. Wilfong, Chee Yap:
Coordinated motion of two robot arms. ICRA 1986: 1216-1223 - 1984
- [b1]Gordon T. Wilfong:
Multiple Object Motion Planning. Cornell University, USA, 1984
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint