On the public citation graph
Network delay inference from additive metrics
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199903)14:2<153::aid-rsa3>3.0.co;2-ropenalex-snapshot
A few logs suffice to build (almost) all trees (I)
inferredcites →https://doi.org/10.1007/978-3-642-02008-7_32openalex-snapshot
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
inferredcites →https://doi.org/10.1007/pl00008277openalex-snapshot
The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
inferredcites →https://doi.org/10.1016/0893-9659(94)90024-8openalex-snapshot
Recovering a tree from the leaf colourations it generates under a Markov model
inferredcites →https://doi.org/10.1016/j.mbs.2005.11.003openalex-snapshot
A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
inferredcites →https://doi.org/10.1016/s0025-5564(96)00075-2openalex-snapshot
Full reconstruction of Markov models on evolutionary trees: Identifiability and consistency
inferredcites →https://doi.org/10.1080/01621459.1996.10476697openalex-snapshot
Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
inferredcites →https://doi.org/10.1080/01621459.2000.10474303openalex-snapshot
Time-Varying Network Tomography: Router Link Data
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a040454openalex-snapshot
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
inferredcites →https://doi.org/10.1093/sysbio/22.3.250openalex-snapshot
A Probability Model for Inferring Evolutionary Trees
inferredcites →https://doi.org/10.1109/18.796384openalex-snapshot
Multicast-based inference of network-internal loss characteristics
inferredcites →https://doi.org/10.1109/ciss.2008.4558692openalex-snapshot
Network tomography based on additive metrics
inferredcites →https://doi.org/10.1109/infocom.2008.16openalex-snapshot
Network Routing Topology Inference from End-to-End Measurements
inferredcites →https://doi.org/10.1109/isit.2006.261566openalex-snapshot
A Markov Random Field Approach to Multicast-Based Network Inference Problems
inferredcites →https://doi.org/10.1109/tcbb.2007.1010openalex-snapshot
Distorted Metrics on Trees and Phylogenetic Forests
inferredcites →https://doi.org/10.1109/tnet.2002.805026openalex-snapshot
Multicast-based inference of network-internal delay distributions
inferredcites →https://doi.org/10.1137/s0097539798342496openalex-snapshot
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.1214/088342304000000422openalex-snapshot
Network Tomography: Recent Developments
inferredcites →https://doi.org/10.1214/105051606000000024openalex-snapshot
Learning nonsingular phylogenies and hidden Markov models
inferredcites →https://doi.org/10.2307/2412305openalex-snapshot
A Probability Model for Inferring Evolutionary Trees
inferredcites →https://doi.org/10.5555/644108.644179openalex-snapshot
On the complexity of distance-based evolutionary tree reconstruction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10955-017-1937-1openalex-snapshot
The Tightness of the Kesten–Stigum Reconstruction Bound of Symmetric Model with Multiple Mutations
inferred← citeshttps://doi.org/10.1007/s10955-019-02228-0openalex-snapshot
Large Degree Asymptotics and the Reconstruction Threshold of the Asymmetric Binary Channels
inferred← citeshttps://doi.org/10.1007/s10955-019-02372-7openalex-snapshot
Information Reconstruction on an Infinite Tree for a $$4\times 4$$-State Asymmetric Model with Community Effects
inferred← citeshttps://doi.org/10.1007/s12351-020-00608-zopenalex-snapshot
MIP model-based heuristics for the minimum weighted tree reconstruction problem
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112836openalex-snapshot
Reconstructibility of a general DNA evolution model
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.06.014openalex-snapshot
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
inferred← citeshttps://doi.org/10.1109/allerton.2010.5706978openalex-snapshot
Consistent and efficient reconstruction of latent tree models
inferred← citeshttps://doi.org/10.1109/focs.2007.4389492openalex-snapshot
Reconstruction for Models on Random Graphs
inferred← citeshttps://doi.org/10.1109/focs.2007.58openalex-snapshot
Reconstruction for Models on Random Graphs
inferred← citeshttps://doi.org/10.1109/icc40277.2020.9149348openalex-snapshot
Waypoint-based Topology Inference
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195532openalex-snapshot
Robust multi-source network tomography using selective probes
inferred← citeshttps://doi.org/10.1109/tit.2013.2251927openalex-snapshot
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters
inferred← citeshttps://doi.org/10.1109/tnet.2020.2985908openalex-snapshot
Looking Glass of NFV: Inferring the Structure and State of NFV Network From External Observations
inferred← citeshttps://doi.org/10.1137/20m1322674openalex-snapshot
Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree
inferred← citeshttps://doi.org/10.1214/09-bjps027openalex-snapshot
Gibbs measures and phase transitions on sparse random graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.