default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas Gerard Edmonds
Person information
- affiliation: Indiana University, Bloomington, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Ying Sheng, Sudeep Gandhe, Bhargav Kanagal, Nick Edmonds, Zachary Fisher, Sandeep Tata, Aarush Selvan:
Measuring an LLM's Proficiency at using APIs: A Query Generation Strategy. KDD 2024: 5680-5689- 2022
- [c11]Yichao Zhou, Ying Sheng, Nguyen Vo, Nick Edmonds, Sandeep Tata:
Learning Transferable Node Representations for Attribute Extraction from Web Documents. WSDM 2022: 1479-1487 - [p1]Nicholas Gerard Edmonds, Andrew Lumsdaine:
The Parallel Boost Graph Library 2.0. Massive Graph Analytics 2022: 459-481 - 2021
- [i1]Yichao Zhou, Ying Sheng, Nguyen Vo, Nick Edmonds, Sandeep Tata:
Simplified DOM Trees for Transferable Attribute Extraction from the Web. CoRR abs/2101.02415 (2021)
2010 – 2019
- 2019
- [j2]Michael J. Whittaker, Nick Edmonds, Sandeep Tata, James B. Wendt
, Marc Najork:
Online Template Induction for Machine-Generated Emails. Proc. VLDB Endow. 12(11): 1235-1248 (2019) - 2015
- [c10]Marcin Zalewski, Nicholas Gerard Edmonds, Andrew Lumsdaine:
Declarative Patterns for Imperative Distributed Graph Algorithms. IPDPS Workshops 2015: 796-803 - 2013
- [c9]Nicholas Gerard Edmonds, Jeremiah Willcock, Andrew Lumsdaine:
Expressing graph algorithms using generalized active messages. ICS 2013: 283-292 - [c8]Nick Edmonds, Jeremiah Willcock, Andrew Lumsdaine:
Expressing graph algorithms using generalized active messages. PPoPP 2013: 289-290 - 2011
- [c7]Jeremiah Willcock, Torsten Hoefler, Nicholas Gerard Edmonds, Andrew Lumsdaine:
Active pebbles: parallel programming for data-driven applications. ICS 2011: 235-244 - [c6]Jeremiah Willcock, Torsten Hoefler, Nicholas Gerard Edmonds, Andrew Lumsdaine:
Active pebbles: a programming model for highly parallel fine-grained data-driven computations. PPoPP 2011: 305-306 - 2010
- [c5]Jeremiah Willcock, Torsten Hoefler, Nicholas Gerard Edmonds, Andrew Lumsdaine:
AM++: a generalized active message framework. PACT 2010: 401-410 - [c4]Nick Edmonds, Torsten Hoefler, Andrew Lumsdaine:
A space-efficient parallel algorithm for computing betweenness centrality in distributed memory. HiPC 2010: 1-10 - [c3]Nick Edmonds, Douglas P. Gregor, Andrew Lumsdaine:
Extensible PGAS semantics for C++. PGAS 2010: 12
2000 – 2009
- 2006
- [c2]Nick Edmonds, Alex Breuer, Douglas P. Gregor, Andrew Lumsdaine:
Single-Source Shortest Paths with the Parallel Boost Graph Library. The Shortest Path Problem 2006: 219-248 - 2005
- [j1]Jesse Davis, Douglas Stark, Nicholas Gerard Edmonds:
Method Of Interaction In A Modular Architecture For Sensor Systems (Mass). Int. J. Softw. Eng. Knowl. Eng. 15(2): 419-426 (2005) - [c1]Nicholas Gerard Edmonds, Douglas Stark, Jesse Davis:
Mass: modular architecture for sensor systems. IPSN 2005: 393-397
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-08-28 23:30 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:
