Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Stephen W. Poole

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 Jonathan W. Berry

> Home > Persons > Stephen W. Poole

Publications

2014
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/MattsonBBBDFFGGHKLLPPRSWY14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/MattsonBBBDFFGGHKLLPPRSWY14
Tim Mattson, David A. Bader, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen W. Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo:
Standards for Graph Algorithm Primitives. CoRR abs/1408.0393 (2014)
2013
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/hpec/MattsonBBBDFFGGHKLLPPRSWY13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hpec/MattsonBBBDFFGGHKLLPPRSWY13
Tim Mattson, David A. Bader, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo:
Standards for graph algorithm primitives. HPEC 2013: 1-2

a service of

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.