default search action
Brian Wheatman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu:
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. Proc. VLDB Endow. 17(9): 2307-2320 (2024) - [c12]Helen Xu
, Amanda Li
BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees (Abstract). HOPC@SPAA 2024 - [c11]Tim Kaler, Xuhao Chen, Brian Wheatman, Dorothy Curtis, Bruce Hoppe, Tao B. Schardl, Charles E. Leiserson:
Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises. IPDPS (Workshops) 2024: 391-394 - [c10]Brian Wheatman
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers. PPoPP 2024: 348-363 - [i3]Brian Wheatman, Meghana Madhyastha, Randal C. Burns:
Masked Matrix Multiplication for Emergent Sparsity. CoRR abs/2402.14118 (2024) - [i2]Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu:
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. CoRR abs/2405.11671 (2024) - 2023
- [j1]Helen Xu
BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees. Proc. VLDB Endow. 16(11): 2976-2989 (2023) - [c9]Brian Wheatman
Optimizing Search Layouts in Packed Memory Arrays. ALENEX 2023: 148-161 - [i1]Brian Wheatman, Randal C. Burns, Aydin Buluç
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers. CoRR abs/2305.05055 (2023) - 2021
- [c8]Brian Wheatman
A Parallel Packed Memory Array to Store Dynamic Graphs. ALENEX 2021: 31-45 - [c7]Brian Wheatman
Streaming Sparse Graphs using Efficient Dynamic Sets. IEEE BigData 2021: 284-294 - [c6]Brian Wheatman
RADICS: Runtime Assurance of Distributed Intelligent Control Systems. DSN Workshops 2021: 182-187 - [c5]Prashant Pandey, Brian Wheatman
Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs. SIGMOD Conference 2021: 1372-1385 - 2020
- [c4]Tim Kaler, Brian Wheatman
High-Throughput Image Alignment for Connectomics using Frugal Snap Judgments. HPEC 2020: 1-9
2010 – 2019
- 2019
- [c3]Tim Kaler, Brian Wheatman
High-throughput image alignment for connectomics using frugal snap judgments: poster. PPoPP 2019: 433-434 - 2018
- [c2]Brian Wheatman
Packed Compressed Sparse Row: A Dynamic Graph Representation. HPEC 2018: 1-7 - 2016
- [c1]Brian Wheatman
Electricity Demand and Population Dynamics Prediction from Mobile Phone Metadata. SBP-BRiMS 2016: 196-205
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-11 00:09 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: