default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilip Tee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c8]Robert Harper, Philip Tee
:
Structural Network Metrics and Incident Generation. NOMS 2022: 1-6- 2021
- [j6]Robert Harper, Philip Tee:
Balancing capacity and epidemic spread in the global airline network. Appl. Netw. Sci. 6(1): 94 (2021)
2010 – 2019
- 2019
- [j5]Philip Tee, Allan Balmain:
Critical behavior of spatial networks as a model of paracrine signaling in tumorigenesis. Appl. Netw. Sci. 4(1): 47:1-47:21 (2019) - [j4]Antoine Messager, George Parisis, Istvan Z. Kiss, Robert Harper, Phil Tee, Luc Berthouze:
Inferring Functional Connectivity From Time-Series of Events in Large Scale Network Deployments. IEEE Trans. Netw. Serv. Manag. 16(3): 857-870 (2019) - [c7]Robert Harper, Philip Tee:
A Method for Temporal Event Correlation. IM 2019: 13-18 - [c6]Antoine Messager, George Parisis, Istvan Z. Kiss, Robert Harper, Phil Tee, Luc Berthouze:
Functional Topology Inference from Network Events. IM 2019: 619-623 - 2018
- [j3]Philip Tee, George Parisis, Luc Berthouze, Ian Wakeman:
Relating Vertex and Global Graph Entropy in Randomly Generated Graphs. Entropy 20(7): 481 (2018) - [c5]Philip Tee, Allan Balmain:
Phase Transitions in Spatial Networks as a Model of Cellular Symbiosis. COMPLEX NETWORKS (2) 2018: 586-597 - [c4]Robert Harper, Philip Tee:
Cookbook, a recipe for fault localization. NOMS 2018: 1-6 - [c3]Antoine Messager, George Parisis, Robert Harper, Philip Tee, Istvan Z. Kiss, Luc Berthouze:
Network events in a large commercial network: What can we learn? NOMS 2018: 1-6 - [i2]Antoine Messager, George Parisis, Istvan Z. Kiss, Robert Harper, Phil Tee, Luc Berthouze:
Inferring the time-varying functional connectivity of large-scale computer networks from emitted events. CoRR abs/1802.04036 (2018) - 2017
- [b1]Philip Tee:
The role of graph entropy in fault localization and network evolution. University of Sussex, Falmer, East Sussex, UK, 2017 - [j2]Philip Tee, George Parisis, Ian Wakeman:
Vertex Entropy As a Critical Node Measure in Network Monitoring. IEEE Trans. Netw. Serv. Manag. 14(3): 646-660 (2017) - [j1]Philip Tee, George Parisis, Ian Wakeman:
Correction to "Vertex Entropy as a Critical Node Measure in Network Monitoring". IEEE Trans. Netw. Serv. Manag. 14(4): 1185 (2017) - [c2]Robert Harper, Philip Tee:
The application of Neural Networks to predicting the root cause of service failures. IM 2017: 953-958 - 2016
- [c1]Phil Tee, George Parisis, Ian Wakeman:
Towards an approximate graph entropy measure for identifying incidents in network event data. NOMS 2016: 1049-1054 - [i1]Phil Tee, Ian Wakeman, George Parisis, Jonathan Dawes:
Is Preferential Attachment the 2nd Law of Thermodynamics in Disguise? CoRR abs/1612.03115 (2016)
Coauthor Index
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-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
