World's Best Scientists 2026 revealed!

D-Index & Metrics

Engineering and Technology

D-Index
34
Citations
8053
World Ranking
9119
National Ranking
579

Overview

Timothy G. Griffin is affiliated with the University of Cambridge in the United Kingdom. Their research spans the fields of Computer Science and Mathematics, with a focus on both main and subfields that include Computational Theory and Mathematics, Computer Networks and Communications, Numerical Analysis, Algebra and Number Theory, and Artificial Intelligence.

The core topics of their work cover a range of areas such as Advanced Optimization Algorithms Research, Matrix Theory and Algorithms, Advanced Topics in Algebra, Distributed Systems and Fault Tolerance, Software-Defined Networks and 5G, Security and Verification in Computing, and Network Packet Processing and Optimization.

Timothy G. Griffin has authored a number of recent papers, notable among these are:

  • Formally Verified Convergence of Policy-Rich DBF Routing Protocols, 2023, IEEE/ACM Transactions on Networking
  • Dynamic asynchronous iterations, 2022, Journal of Parallel and Distributed Computing
  • Exploring chromatogram library-based data-independent acquisition analysis using EncyclopeDIA within Galaxy framework., 2020, Faculty of 1000 Research Ltd
  • Dynamic Asynchronous Iterations, 2020, arXiv (Cornell University)
  • Formally Verified Convergence of Policy-Rich DBF Routing Protocols, 2021, arXiv (Cornell University)

Their frequent co-authors include:

  • Matthew L. Daggitt (collaborated on 4 papers)
  • Pratik Jagtap
  • James M. Johnson
  • Tzu-Yi Yang
  • Matthias Fahrner

Common venues where their work has appeared include:

  • arXiv (Cornell University) with 2 publications
  • IEEE/ACM Transactions on Networking with 1 publication
  • Journal of Parallel and Distributed Computing with 1 publication
  • Faculty of 1000 Research Ltd with 1 publication

Best Publications

  • The stable paths problem and interdomain routing

    Timothy G. Griffin;F. Bruce Shepherd;Gordon Wilfong

  • A formulae-as-type notion of control

    Timothy G. Griffin

  • An analysis of BGP convergence properties

    Timothy G. Griffin;Gordon Wilfong

  • Incremental maintenance of views with duplicates

    Timothy Griffin;Leonid Libkin

  • Algorithms for deferred view maintenance

    Latha S. Colby;Timothy Griffin;Leonid Libkin;Inderpal Singh Mumick

  • On the correctness of IBGP configuration

    Timothy G. Griffin;Gordon Wilfong

  • Dynamics of hot-potato routing in IP networks

    Renata Teixeira;Aman Shaikh;Tim Griffin;Jennifer Rexford

  • An experimental analysis of BGP convergence time

    T.G. Griffin;B.J. Premore

  • Inherently safe backup routing with BGP

    Lixin Gao;T.G. Griffin;J. Rexford

  • A safe path vector protocol

    T.G. Griffin;G. Wilfong

  • Policy disputes in path-vector protocols

    T.G. Griffin;F.B. Shepherd;G. Wilfong

  • Internet routing policies and round-trip-times

    Han Zheng;Eng Keong Lua;Marcelo Pias;Timothy G. Griffin

  • Analysis of the MED oscillation problem in BGP

    T.G. Griffin;G. Wilfong

  • Child Abduction, AMBER Alert, and Crime Control Theater:

    Timothy Griffin;Monica K. Miller

  • On the accuracy of embeddings for internet coordinate systems

    Eng Keong Lua;Timothy Griffin;Marcelo Pias;Han Zheng

  • Data architecture for fetch-intensive database applications

    Timothy G. Griffin;Richard Baxter Hull;Bharat Kumar;Daniel Francis Lieuwen

  • The Interdomain Connectivity of PlanetLab Nodes

    Suman Banerjee;Timothy G. Griffin;Marcelo Pias

  • BGP beacons

    Z. Morley Mao;Randy Bush;Timothy G. Griffin;Matthew Roughan

  • Metarouting

    Unknown

  • Proceedings of the 6th International COnference

    Jaudelice de Oliveira;Maximilian Ott;Tim Griffin;Muriel Medard

  • Network sensitivity to hot-potato disruptions

    Renata Teixeira;Aman Shaikh;Tim Griffin;Geoffrey M. Voelker

  • Design principles of policy languages for path vector protocols

    Timothy G. Griffin;Aaron D. Jaggard;Vijay Ramachandran

  • Algorithms for deferred view maintenance

    Latha Colby;Timothy Griffin;Leonid Libkin;Inderpal Singh Mumick

  • Method and apparatus for exchanging routing information in a packet-based data network

    Timothy G. Griffin;Gordon Thomas Wilfong

  • An improved algorithm for the incremental recomputation of active relational expressions

    T. Griffin;L. Libkin;H. Trickey

  • TIE breaking: tunable interdomain egress selection

    Renata Teixeira;Timothy G. Griffin;Mauricio G. C. Resende;Jennifer Rexford

  • Incremental maintenance of views with duplicates

    Timothy Griffin;Leonid Libkin

Frequent Co-Authors

John Wooldredge
John Wooldredge University of Cincinnati
Gordon Wilfong
Gordon Wilfong Nokia (United States)
Leonid Libkin
Leonid Libkin University of Edinburgh
Renata Teixeira
Renata Teixeira French Institute for Research in Computer Science and Automation - INRIA
Jennifer Rexford
Jennifer Rexford Princeton University
Matthew Roughan
Matthew Roughan University of Adelaide
Richard Hull
Richard Hull Spring Hills Foundation
Mauricio G. C. Resende
Mauricio G. C. Resende University of Washington
Sonia Fahmy
Sonia Fahmy Purdue University West Lafayette

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Best Scientists Citing Timothy G. Griffin

Trending Scientists