![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
David A. Hutchinson
Person information
- affiliation: Duke University, Durham, USA
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [c12]Mohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari:
Experiments with a Parallel External Memory System. HiPC 2007: 59-70 - 2006
- [j6]Jeffrey Scott Vitter
, David A. Hutchinson:
Distribution sort with randomized cycling. J. ACM 53(4): 656-680 (2006) - 2005
- [j5]David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
:
Duality Between Prefetching and Queued Writing with Parallel Disks. SIAM J. Comput. 34(6): 1443-1463 (2005) - 2003
- [j4]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. Algorithmica 36(2): 97-122 (2003) - [j3]David A. Hutchinson, Anil Maheshwari, Norbert Zeh:
An external memory data structure for shortest path queries. Discret. Appl. Math. 126(1): 55-82 (2003) - 2002
- [j2]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Bulk Synchronous Parallel Algorithms for the External Memory Model. Theory Comput. Syst. 35(6): 567-597 (2002) - 2001
- [j1]Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Blocking in Parallel Multisearch Problems. Theory Comput. Syst. 34(2): 145-189 (2001) - [c11]David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
:
Duality between Prefetching and Queued Writing with Parallel Disks. ESA 2001: 62-73 - [c10]Jeffrey Scott Vitter, David A. Hutchinson:
Distribution sort with randomizing cycle. SODA 2001: 77-86 - [c9]David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
:
The power of duality for prefetching and sorting with parallel disks. SPAA 2001: 334-335
1990 – 1999
- 1999
- [c8]David A. Hutchinson, Anil Maheshwari, Norbert Zeh:
An External Memory Data Structure for Shortest Path Queries. COCOON 1999: 51-60 - [c7]Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich:
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. IPPS/SPDP 1999: 14-20 - [c6]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Parallel Virtual Memory. SODA 1999: 889-890 - 1998
- [c5]Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Blocking in Parallel Multisearch Problems (Extended Abstract). SPAA 1998: 98-107 - 1997
- [c4]Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. SPAA 1997: 106-115 - [c3]David A. Hutchinson, Anil Maheshwari, Jörg-Rüdiger Sack, Radu Velicescu:
Early Experiences in Implementing the Buffer Tree. WAE 1997: 92-103 - 1996
- [c2]David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighbourhood Modelling. ACM-GIS 1996: 25-34 - [c1]David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighborhood Modeling. SPAA 1996: 204-207
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint