Gordon T. Wilfong

According to our database1, Gordon T. Wilfong authored at least 74 papers between 1986 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Dynamic Switch Migration in Distributed Software-Defined Networks to Achieve Controller Load Balance.
IEEE Journal on Selected Areas in Communications, 2019

2017
On the Problem of Optimal Path Encoding for Software-Defined Networks.
IEEE/ACM Trans. Netw., 2017

Egalitarian Graph Orientations.
J. Graph Algorithms Appl., 2017

BalCon: A Distributed Elastic SDN Control via Efficient Switch Migration.
Proceedings of the 2017 IEEE International Conference on Cloud Engineering, 2017

Overlaying Conditional Circuit Clauses for Secure Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Improving robustness of next-hop routing.
J. Comb. Optim., 2016

Overlaying Circuit Clauses for Secure Computation.
IACR Cryptology ePrint Archive, 2016

2015
Optimal path encoding for software-defined networks.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Analysis of k-anonymity algorithms for streaming location data.
Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

Sparsifying network topologies for application guidance.
Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2015

Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Path switching: reduced-state flow handling in SDN using path information.
Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies, 2015

2013
PACE: Policy-Aware Application Cloud Embedding.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Hierarchical community decomposition via oblivious routing techniques.
Proceedings of the Conference on Online Social Networks, 2013

2012
The knapsack problem with neighbour constraints.
J. Discrete Algorithms, 2012

On the Efficiency of the Simplest Pricing Mechanisms in Two-Sided Markets.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Routing Regardless of Network Stability.
Proceedings of the Algorithms - ESA 2012, 2012

iBGP and Constrained Connectivity.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
The inherent difficulty of timely primary-backup replication.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

The 1-Neighbour Knapsack Problem.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Energy-efficient design and optimization of wireline access networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
On the Stable Paths Problem.
SIAM J. Discrete Math., 2010

2008
Network Formation and Routing by Strategic Agents Using Local Contracts.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A fractional model of the border gateway protocol (BGP).
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Economic modeling of global test strategy II: Software system and examples.
Bell Labs Technical Journal, 2007

Economic modeling of global test strategy I: Mathematical models.
Bell Labs Technical Journal, 2007

Degree-constrained network flows.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Design tools for transparent optical networks.
Bell Labs Technical Journal, 2006

Admission control for multihop wireless backhaul networks with QoS support.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

Designing Multihop Wireless Backhaul Networks with Delay Guarantees.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Strategic Network Formation through Peering and Service Agreements.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Strictly Nonblocking WDM Cross-connects.
SIAM J. Comput., 2005

2003
A fast technique for comparing graph representations with applications to performance evaluation.
IJDAR, 2003

2002
The stable paths problem and interdomain routing.
IEEE/ACM Trans. Netw., 2002

Evaluating the performance of table processing algorithms.
IJDAR, 2002

On the correctness of IBGP configuration.
Proceedings of the ACM SIGCOMM 2002 Conference on Applications, 2002

Route oscillations in I-BGP with route reflection.
Proceedings of the ACM SIGCOMM 2002 Conference on Applications, 2002

Analysis of the MED Oscillation Problem in BGP.
Proceedings of the 10th IEEE International Conference on Network Protocols (ICNP 2002), 2002

Wide-Sense Nonblocking WDM Cross-Connects.
Proceedings of the Algorithms, 2002

2001
Comparing Semi-Structured Documents via Graph Probing.
Proceedings of the MIS '01, 2001

Evaluating Document Analysis Results via Graph Probing.
Proceedings of the 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 2001

Why Table Ground-Truthing is Hard.
Proceedings of the 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 2001

Table structure recognition and its evaluation.
Proceedings of the Document Recognition and Retrieval VIII, 2001

2000
Comparison and Classification of Documents Based on Layout Similarity.
Inf. Retr., 2000

Strictly non-blocking WDM cross-connects for heterogeneous networks.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Strictly non-blocking WDM cross-connects.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A Safe Path Vector Protocol.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Medium-independent table detection.
Proceedings of the Document Recognition and Retrieval VII, 2000

1999
Cross-Domain Approximate String Matching.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

An Analysis of BGP Convergence Properties.
SIGCOMM, 1999

Policy Disputes in Path-Vector Protocols.
Proceedings of the Seventh Annual International Conference on Network Protocols, 1999

Document Image Layout Comparison and Classification.
Proceedings of the Fifth International Conference on Document Analysis and Recognition, 1999

Document Classification Using Layout Analysis.
Proceedings of the 10th International Workshop on Database & Expert Systems Applications, 1999

1998
Ring Routing and Wavelength Translation.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Feasibility of Design in Stereolithography.
Algorithmica, 1997

Computing Constrained Minimum-Width Annuli of Point Sets.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

On-line Algorithms for Compressing Planar Curves.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
On-Line Recognition of Handwritten Symbols.
IEEE Trans. Pattern Anal. Mach. Intell., 1996

Minimum Wavelength in an All-Optical Ring Network.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Computing the Angularity Tolerance.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1993
Feasability of Design in Stereolithography.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1991
Minimum-Speed Motions.
I. J. Robotics Res., 1991

Planning Constrained Motion.
Ann. Math. Artif. Intell., 1991

Nearest Neighbor Problems.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Graphs with variable edge costs: a model for scheduling a vehicle subject to speed and timing restraints.
Proceedings of the IEEE International Workshop on Intelligent Robots and Systems '90, 1990

1989
Guest Editor's Introduction: Robotics and Automation.
IEEE Computer, 1989

Shortest paths for autonomous vehicles.
Proceedings of the 1989 IEEE International Conference on Robotics and Automation, 1989

1988
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties.
Math. Oper. Res., 1988

Planning Constrained Motion
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Motion planning for an autonomous vehicle.
Proceedings of the 1988 IEEE International Conference on Robotics and Automation, 1988

Motion Planning in the Presence of Movable Obstacles.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

The Furthest-Site Geodesic Voronoi Diagram.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1986
Reducing Multiple Object Motion Planning to Graph Searching.
SIAM J. Comput., 1986

Coordinated motion of two robot arms.
Proceedings of the 1986 IEEE International Conference on Robotics and Automation, 1986


  Loading...