Edward T. Bullmore

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Danielle S. Bassett

> Home > Persons > Edward T. Bullmore

Publications

2010
[j32]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ploscb/BassettGMWMB10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ploscb/BassettGMWMB10
Danielle S. Bassett, Daniel Greenfield, Andreas Meyer-Lindenberg, Daniel R. Weinberger, Simon W. Moore, Edward T. Bullmore:
Efficient Physical Embedding of Topologically Complex Information Processing Networks in Brains and Computer Circuits. PLoS Comput. Biol. 6(4) (2010)
2009
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/neuroimage/BullmoreBBFKMS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/neuroimage/BullmoreBBFKMS09
Ed Bullmore, Anna Barnes, Danielle S. Bassett, Alex Fornito, Manfred G. Kitzbichler, David Meunier, John Suckling:
Generic aspects of complexity in brain imaging data and other biological systems. NeuroImage 47(3): 1125-1134 (2009)
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/neuroimage/DeukerBSCNRB09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/neuroimage/DeukerBSCNRB09
Lorena Deuker, Edward T. Bullmore, Marie L. Smith, Søren R. Christensen, Pradeep J. Nathan, Brigitte Rockstroh, Danielle S. Bassett:
Reproducibility of graph metrics of human brain functional networks. NeuroImage 47(4): 1460-1468 (2009)

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.