iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/b/GEBlelloch.rss
dblp: Guy E. Blelloch https://dblp.org/pid/b/GEBlelloch.html dblp person page RSS feed Thu, 31 Oct 2024 20:18:12 +0100 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Guy E. Blellochhttps://dblp.org/pid/b/GEBlelloch.html14451 Lock-Free Locks Revisited (Abstract).https://doi.org/10.1145/3670684.3673415, , :
Lock-Free Locks Revisited (Abstract). HOPC@SPAA ]]>https://dblp.org/rec/conf/hopc/Ben-DavidBW24Mon, 01 Jan 2024 00:00:00 +0100 Teaching Parallel Algorithms Using the Binary-Forking Model.https://doi.org/10.1109/IPDPSW63119.2024.00080, , :
Teaching Parallel Algorithms Using the Binary-Forking Model. IPDPS (Workshops) : 346-351]]>https://dblp.org/rec/conf/ipps/Blelloch0024Mon, 01 Jan 2024 00:00:00 +0100 VERLIB: Concurrent Versioned Pointers.https://doi.org/10.1145/3627535.3638501, :
VERLIB: Concurrent Versioned Pointers. PPoPP : 200-214]]>https://dblp.org/rec/conf/ppopp/BlellochW24Mon, 01 Jan 2024 00:00:00 +0100 ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms.https://doi.org/10.1145/3627535.3638475, , , , , , :
ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms. PPoPP : 270-285]]>https://dblp.org/rec/conf/ppopp/ManoharSBD0S024Mon, 01 Jan 2024 00:00:00 +0100 Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees.https://doi.org/10.1145/3626183.3659976, :
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees. SPAA : 247-258]]>https://dblp.org/rec/conf/spaa/AndersonB24Mon, 01 Jan 2024 00:00:00 +0100 Parallel Minimum Cuts in O(m log2 n) Work and Low Depth.https://doi.org/10.1145/3565557, :
Parallel Minimum Cuts in O(m log2 n) Work and Low Depth. ACM Trans. Parallel Comput. 10(4): 18:1-18:28 ()]]>https://dblp.org/rec/journals/topc/AndersonB23Fri, 01 Dec 2023 00:00:00 +0100 Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract).https://doi.org/10.1145/3597635.3598027, , :
Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract). HOPC@SPAA : 9-10]]>https://dblp.org/rec/conf/hopc/AndersonBW23Sun, 01 Jan 2023 00:00:00 +0100 PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract).https://doi.org/10.1145/3597635.3598029, , , , , , :
PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract). HOPC@SPAA : 13-14]]>https://dblp.org/rec/conf/hopc/KangZBD0MG23Sun, 01 Jan 2023 00:00:00 +0100 The Geometry of Tree-Based Sorting.https://doi.org/10.4230/LIPIcs.ICALP.2023.26, :
The Geometry of Tree-Based Sorting. ICALP : 26:1-26:19]]>https://dblp.org/rec/conf/icalp/BlellochD23Sun, 01 Jan 2023 00:00:00 +0100 Practically and Theoretically Efficient Garbage Collection for Multiversioning.https://doi.org/10.1145/3572848.3577508, , , :
Practically and Theoretically Efficient Garbage Collection for Multiversioning. PPoPP : 66-78]]>https://dblp.org/rec/conf/ppopp/WeiBFR23Sun, 01 Jan 2023 00:00:00 +0100 PIM-trie: A Skew-resistant Trie for Processing-in-Memory.https://doi.org/10.1145/3558481.3591070, , , , , , :
PIM-trie: A Skew-resistant Trie for Processing-in-Memory. SPAA : 1-14]]>https://dblp.org/rec/conf/spaa/KangZBD0MG23Sun, 01 Jan 2023 00:00:00 +0100 Are Parallel Algorithms Ready for Prime Time?https://doi.org/10.1145/3558481.3591068:
Are Parallel Algorithms Ready for Prime Time? SPAA : 63]]>https://dblp.org/rec/conf/spaa/Blelloch23Sun, 01 Jan 2023 00:00:00 +0100 Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis.https://doi.org/10.48550/arXiv.2305.04359, , , , , , :
Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis. CoRR abs/2305.04359 ()]]>https://dblp.org/rec/journals/corr/abs-2305-04359Sun, 01 Jan 2023 00:00:00 +0100 Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span.https://doi.org/10.48550/arXiv.2306.08786, :
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span. CoRR abs/2306.08786 ()]]>https://dblp.org/rec/journals/corr/abs-2306-08786Sun, 01 Jan 2023 00:00:00 +0100 PIM-tree: A Skew-resistant Index for Processing-in-Memory.https://www.vldb.org/pvldb/vol16/p946-kang.pdf, , , , , , :
PIM-tree: A Skew-resistant Index for Processing-in-Memory. Proc. VLDB Endow. 16(4): 946-958 ()]]>https://dblp.org/rec/journals/pvldb/KangZBD0MG22Sat, 01 Jan 2022 00:00:00 +0100 Joinable Parallel Balanced Binary Trees.https://doi.org/10.1145/3512769, , :
Joinable Parallel Balanced Binary Trees. ACM Trans. Parallel Comput. 9(2): 7:1-7:41 ()]]>https://dblp.org/rec/journals/topc/BlellochFS22Sat, 01 Jan 2022 00:00:00 +0100 Parallel Nearest Neighbors in Low Dimensions with Batch Updates.https://doi.org/10.1137/1.9781611977042.16, :
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. ALENEX : 195-208]]>https://dblp.org/rec/conf/alenex/BlellochD22Sat, 01 Jan 2022 00:00:00 +0100 Turning manual concurrent memory reclamation into automatic reference counting.https://doi.org/10.1145/3519939.3523730, , :
Turning manual concurrent memory reclamation into automatic reference counting. PLDI : 61-75]]>https://dblp.org/rec/conf/pldi/AndersonBW22Sat, 01 Jan 2022 00:00:00 +0100 PaC-trees: supporting parallel and compressed purely-functional collections.https://doi.org/10.1145/3519939.3523733, , , :
PaC-trees: supporting parallel and compressed purely-functional collections. PLDI : 108-121]]>https://dblp.org/rec/conf/pldi/DhulipalaB0022Sat, 01 Jan 2022 00:00:00 +0100 Fast and Fair Randomized Wait-Free Locks.https://doi.org/10.1145/3519270.3538448, :
Fast and Fair Randomized Wait-Free Locks. PODC : 187-197]]>https://dblp.org/rec/conf/podc/Ben-DavidB22Sat, 01 Jan 2022 00:00:00 +0100 Parallel block-delayed sequences.https://doi.org/10.1145/3503221.3508434, , , :
Parallel block-delayed sequences. PPoPP : 61-75]]>https://dblp.org/rec/conf/ppopp/WestrickRAB22Sat, 01 Jan 2022 00:00:00 +0100 Lock-free locks revisited.https://doi.org/10.1145/3503221.3508433, , :
Lock-free locks revisited. PPoPP : 278-293]]>https://dblp.org/rec/conf/ppopp/Ben-DavidBW22Sat, 01 Jan 2022 00:00:00 +0100 FliT: a library for simple and efficient persistent algorithms.https://doi.org/10.1145/3503221.3508436, , , , :
FliT: a library for simple and efficient persistent algorithms. PPoPP : 309-321]]>https://dblp.org/rec/conf/ppopp/WeiB0BP22Sat, 01 Jan 2022 00:00:00 +0100 The problem-based benchmark suite (PBBS), V2.https://doi.org/10.1145/3503221.3508422, , , , :
The problem-based benchmark suite (PBBS), V2. PPoPP : 445-447]]>https://dblp.org/rec/conf/ppopp/AndersonBDD022Sat, 01 Jan 2022 00:00:00 +0100 Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact).https://doi.org/10.5281/zenodo.7475441, , , :
Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact).  note: work in progress]]>https://dblp.org/rec/data/10/WeiBFR22Thu, 01 Dec 2022 00:00:00 +0100 Lock-Free Locks Revisited.https://arxiv.org/abs/2201.00813, , :
Lock-Free Locks Revisited. CoRR abs/2201.00813 ()]]>https://dblp.org/rec/journals/corr/abs-2201-00813Sat, 01 Jan 2022 00:00:00 +0100 Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting.https://doi.org/10.48550/arXiv.2204.05985, , :
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting. CoRR abs/2204.05985 ()]]>https://dblp.org/rec/journals/corr/abs-2204-05985Sat, 01 Jan 2022 00:00:00 +0100 PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections.https://doi.org/10.48550/arXiv.2204.06077, , , :
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections. CoRR abs/2204.06077 ()]]>https://dblp.org/rec/journals/corr/abs-2204-06077Sat, 01 Jan 2022 00:00:00 +0100 PIM-tree: A Skew-resistant Index for Processing-in-Memory.https://doi.org/10.48550/arXiv.2211.10516, , , , , , :
PIM-tree: A Skew-resistant Index for Processing-in-Memory. CoRR abs/2211.10516 ()]]>https://dblp.org/rec/journals/corr/abs-2211-10516Sat, 01 Jan 2022 00:00:00 +0100 Practically and Theoretically Efficient Garbage Collection for Multiversioning.https://doi.org/10.48550/arXiv.2212.13557, , , :
Practically and Theoretically Efficient Garbage Collection for Multiversioning. CoRR abs/2212.13557 ()]]>https://dblp.org/rec/journals/corr/abs-2212-13557Sat, 01 Jan 2022 00:00:00 +0100 Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.https://doi.org/10.1145/3434393, , :
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. ACM Trans. Parallel Comput. 8(1): 4:1-4:70 ()]]>https://dblp.org/rec/journals/topc/DhulipalaBS21Fri, 01 Jan 2021 00:00:00 +0100 The Read-Only Semi-External Model.https://doi.org/10.1137/1.9781611976489.6, , , , , :
The Read-Only Semi-External Model. APOCS : 70-84]]>https://dblp.org/rec/conf/apocs/BlellochDGGMS21Fri, 01 Jan 2021 00:00:00 +0100 Is Asymptotic Cost Analysis Useful in Developing Practical Parallel Algorithms.https://doi.org/10.1109/IPDPS49936.2021.00076:
Is Asymptotic Cost Analysis Useful in Developing Practical Parallel Algorithms. IPDPS : 681]]>https://dblp.org/rec/conf/ipps/Blelloch21Fri, 01 Jan 2021 00:00:00 +0100 Concurrent deferred reference counting with constant-time overhead.https://doi.org/10.1145/3453483.3454060, , :
Concurrent deferred reference counting with constant-time overhead. PLDI : 526-541]]>https://dblp.org/rec/conf/pldi/AndersonBW21Fri, 01 Jan 2021 00:00:00 +0100 Constant-time snapshots with applications to concurrent data structures.https://doi.org/10.1145/3437801.3441602, , , , , :
Constant-time snapshots with applications to concurrent data structures. PPoPP : 31-46]]>https://dblp.org/rec/conf/ppopp/WeiBBFR021Fri, 01 Jan 2021 00:00:00 +0100 SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures.https://doi.org/10.1145/3409964.3461780, , , , :
SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. SPAA : 1-7]]>https://dblp.org/rec/conf/spaa/BlellochDMVY21Fri, 01 Jan 2021 00:00:00 +0100 Efficient Parallel Self-Adjusting Computation.https://doi.org/10.1145/3409964.3461799, , , :
Efficient Parallel Self-Adjusting Computation. SPAA : 59-70]]>https://dblp.org/rec/conf/spaa/AndersonBBA21Fri, 01 Jan 2021 00:00:00 +0100 Parallel Minimum Cuts in O(m log2n) Work and Low Depth.https://doi.org/10.1145/3409964.3461797, :
Parallel Minimum Cuts in O(m log2n) Work and Low Depth. SPAA : 71-82]]>https://dblp.org/rec/conf/spaa/AndersonB21Fri, 01 Jan 2021 00:00:00 +0100 The Processing-in-Memory Model.https://doi.org/10.1145/3409964.3461816, , , , , :
The Processing-in-Memory Model. SPAA : 295-306]]>https://dblp.org/rec/conf/spaa/KangGBD0M21Fri, 01 Jan 2021 00:00:00 +0100 Space and Time Bounded Multiversion Garbage Collection.https://doi.org/10.4230/LIPIcs.DISC.2021.12, , , , , :
Space and Time Bounded Multiversion Garbage Collection. DISC : 12:1-12:20]]>https://dblp.org/rec/conf/wdag/Ben-DavidBFRSW21Fri, 01 Jan 2021 00:00:00 +0100 Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth.https://arxiv.org/abs/2102.05301, :
Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth. CoRR abs/2102.05301 ()]]>https://dblp.org/rec/journals/corr/abs-2102-05301Fri, 01 Jan 2021 00:00:00 +0100 Efficient Parallel Self-Adjusting Computation.https://arxiv.org/abs/2105.06712, , , :
Efficient Parallel Self-Adjusting Computation. CoRR abs/2105.06712 ()]]>https://dblp.org/rec/journals/corr/abs-2105-06712Fri, 01 Jan 2021 00:00:00 +0100 Space and Time Bounded Multiversion Garbage Collection.https://arxiv.org/abs/2108.02775, , , , , :
Space and Time Bounded Multiversion Garbage Collection. CoRR abs/2108.02775 ()]]>https://dblp.org/rec/journals/corr/abs-2108-02775Fri, 01 Jan 2021 00:00:00 +0100 FliT: A Library for Simple and Efficient Persistent Algorithms.https://arxiv.org/abs/2108.04202, , , , :
FliT: A Library for Simple and Efficient Persistent Algorithms. CoRR abs/2108.04202 ()]]>https://dblp.org/rec/journals/corr/abs-2108-04202Fri, 01 Jan 2021 00:00:00 +0100 Fast and Fair Lock-Free Locks.https://arxiv.org/abs/2108.04520, :
Fast and Fair Lock-Free Locks. CoRR abs/2108.04520 ()]]>https://dblp.org/rec/journals/corr/abs-2108-04520Fri, 01 Jan 2021 00:00:00 +0100 The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model.https://arxiv.org/abs/2110.11836, :
The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model. CoRR abs/2110.11836 ()]]>https://dblp.org/rec/journals/corr/abs-2110-11836Fri, 01 Jan 2021 00:00:00 +0100 Parallel Nearest Neighbors in Low Dimensions with Batch Updates.https://arxiv.org/abs/2111.04182, :
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. CoRR abs/2111.04182 ()]]>https://dblp.org/rec/journals/corr/abs-2111-04182Fri, 01 Jan 2021 00:00:00 +0100 Parallelism in Randomized Incremental Algorithms.https://doi.org/10.1145/3402819, , , :
Parallelism in Randomized Incremental Algorithms. J. ACM 67(5): 27:1-27:27 ()]]>https://dblp.org/rec/journals/jacm/BlellochGSS20Wed, 01 Jan 2020 00:00:00 +0100 Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs.http://www.vldb.org/pvldb/vol13/p1598-dhulipala.pdf, , , , , , :
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. Proc. VLDB Endow. 13(9): 1598-1613 ()]]>https://dblp.org/rec/journals/pvldb/DhulipalaMKGBGS20Wed, 01 Jan 2020 00:00:00 +0100 Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract].https://doi.org/10.1137/1.9781611976021.8, :
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]. APOCS : 105-119]]>https://dblp.org/rec/conf/apocs/BlellochG20Wed, 01 Jan 2020 00:00:00 +0100 Parallel Batch-Dynamic Trees via Change Propagation.https://doi.org/10.4230/LIPIcs.ESA.2020.2, , , , :
Parallel Batch-Dynamic Trees via Change Propagation. ESA : 2:1-2:23]]>https://dblp.org/rec/conf/esa/AcarABDW20Wed, 01 Jan 2020 00:00:00 +0100 NVTraverse: in NVRAM data structures, the destination is more important than the journey.https://doi.org/10.1145/3385412.3386031, , , , :
NVTraverse: in NVRAM data structures, the destination is more important than the journey. PLDI : 377-392]]>https://dblp.org/rec/conf/pldi/FriedmanBWBP20Wed, 01 Jan 2020 00:00:00 +0100 The Graph Based Benchmark Suite (GBBS).https://doi.org/10.1145/3398682.3399168, , , , :
The Graph Based Benchmark Suite (GBBS). GRADES-NDA@SIGMOD : 11:1-11:8]]>https://dblp.org/rec/conf/sigmod/DhulipalaSTBS20Wed, 01 Jan 2020 00:00:00 +0100 Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model.https://doi.org/10.1145/3350755.3400241, , :
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. SPAA : 51-61]]>https://dblp.org/rec/conf/spaa/AndersonBT20Wed, 01 Jan 2020 00:00:00 +0100 Optimal Parallel Algorithms in the Binary-Forking Model.https://doi.org/10.1145/3350755.3400227, , , :
Optimal Parallel Algorithms in the Binary-Forking Model. SPAA : 89-102]]>https://dblp.org/rec/conf/spaa/BlellochF0020Wed, 01 Jan 2020 00:00:00 +0100 Randomized Incremental Convex Hull is Highly Parallel.https://doi.org/10.1145/3350755.3400255, , , :
Randomized Incremental Convex Hull is Highly Parallel. SPAA : 103-115]]>https://dblp.org/rec/conf/spaa/BlellochGSS20Wed, 01 Jan 2020 00:00:00 +0100 ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines.https://doi.org/10.1145/3350755.3400254, , :
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. SPAA : 507-509]]>https://dblp.org/rec/conf/spaa/BlellochAD20Wed, 01 Jan 2020 00:00:00 +0100 LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS.https://doi.org/10.4230/LIPIcs.DISC.2020.5, :
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. DISC : 5:1-5:17]]>https://dblp.org/rec/conf/wdag/BlellochW20Wed, 01 Jan 2020 00:00:00 +0100 Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time.https://doi.org/10.4230/LIPIcs.DISC.2020.51, :
Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. DISC : 51:1-51:3]]>https://dblp.org/rec/conf/wdag/BlellochW20aWed, 01 Jan 2020 00:00:00 +0100 Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020.https://doi.org/10.1137/1.9781611976007, :
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020. SIAM , ISBN 978-1-61197-600-7 [contents]]]>https://dblp.org/rec/conf/alenex/2020Wed, 01 Jan 2020 00:00:00 +0100 Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees.https://arxiv.org/abs/2002.05129, , , , :
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. CoRR abs/2002.05129 ()]]>https://dblp.org/rec/journals/corr/abs-2002-05129Wed, 01 Jan 2020 00:00:00 +0100 Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model.https://arxiv.org/abs/2002.05710, , :
Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model. CoRR abs/2002.05710 ()]]>https://dblp.org/rec/journals/corr/abs-2002-05710Wed, 01 Jan 2020 00:00:00 +0100 Concurrent Reference Counting and Resource Management in Wait-free Constant Time.https://arxiv.org/abs/2002.07053, :
Concurrent Reference Counting and Resource Management in Wait-free Constant Time. CoRR abs/2002.07053 ()]]>https://dblp.org/rec/journals/corr/abs-2002-07053Wed, 01 Jan 2020 00:00:00 +0100 NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey.https://arxiv.org/abs/2004.02841, , , , :
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey. CoRR abs/2004.02841 ()]]>https://dblp.org/rec/journals/corr/abs-2004-02841Wed, 01 Jan 2020 00:00:00 +0100 Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures.https://arxiv.org/abs/2007.02372, , , , , :
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. CoRR abs/2007.02372 ()]]>https://dblp.org/rec/journals/corr/abs-2007-02372Wed, 01 Jan 2020 00:00:00 +0100 Concurrent Fixed-Size Allocation and Free in Constant Time.https://arxiv.org/abs/2008.04296, :
Concurrent Fixed-Size Allocation and Free in Constant Time. CoRR abs/2008.04296 ()]]>https://dblp.org/rec/journals/corr/abs-2008-04296Wed, 01 Jan 2020 00:00:00 +0100 On Supporting Efficient Snapshot Isolation for Hybrid Workloads with Multi-Versioned Indexes.http://www.vldb.org/pvldb/vol13/p211-sun.pdf, , , :
On Supporting Efficient Snapshot Isolation for Hybrid Workloads with Multi-Versioned Indexes. Proc. VLDB Endow. 13(2): 211-225 ()]]>https://dblp.org/rec/journals/pvldb/0001BLP19Tue, 01 Jan 2019 00:00:00 +0100 Unfair Scheduling Patterns in NUMA Architectures.https://doi.org/10.1109/PACT.2019.00024, , :
Unfair Scheduling Patterns in NUMA Architectures. PACT : 205-218]]>https://dblp.org/rec/conf/IEEEpact/Ben-DavidSB19Tue, 01 Jan 2019 00:00:00 +0100 Batch-Parallel Euler Tour Trees.https://doi.org/10.1137/1.9781611975499.8, , :
Batch-Parallel Euler Tour Trees. ALENEX : 92-106]]>https://dblp.org/rec/conf/alenex/TsengDB19Tue, 01 Jan 2019 00:00:00 +0100 Parallel Range, Segment and Rectangle Queries with Augmented Maps.https://doi.org/10.1137/1.9781611975499.13, :
Parallel Range, Segment and Rectangle Queries with Augmented Maps. ALENEX : 159-173]]>https://dblp.org/rec/conf/alenex/0001B19Tue, 01 Jan 2019 00:00:00 +0100 Low-latency graph streaming using compressed purely-functional trees.https://doi.org/10.1145/3314221.3314598, , :
Low-latency graph streaming using compressed purely-functional trees. PLDI : 918-934]]>https://dblp.org/rec/conf/pldi/DhulipalaBS19Tue, 01 Jan 2019 00:00:00 +0100 Making concurrent algorithms detectable: poster.https://doi.org/10.1145/3293883.3299991, , , :
Making concurrent algorithms detectable: poster. PPoPP : 419-420]]>https://dblp.org/rec/conf/ppopp/Ben-DavidBFW19Tue, 01 Jan 2019 00:00:00 +0100 Implementing parallel and concurrent tree structures.https://doi.org/10.1145/3293883.3302576, :
Implementing parallel and concurrent tree structures. PPoPP : 447-450]]>https://dblp.org/rec/conf/ppopp/0001B19Tue, 01 Jan 2019 00:00:00 +0100 Multiversion Concurrency with Bounded Delay and Precise Garbage Collection.https://doi.org/10.1145/3323165.3323185, , , :
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. SPAA : 241-252]]>https://dblp.org/rec/conf/spaa/Ben-DavidB0W19Tue, 01 Jan 2019 00:00:00 +0100 Delay-Free Concurrency on Faulty Persistent Memory.https://doi.org/10.1145/3323165.3323187, , , :
Delay-Free Concurrency on Faulty Persistent Memory. SPAA : 253-264]]>https://dblp.org/rec/conf/spaa/Ben-DavidBFW19Tue, 01 Jan 2019 00:00:00 +0100 Parallel Batch-Dynamic Graph Connectivity.https://doi.org/10.1145/3323165.3323196, , , :
Parallel Batch-Dynamic Graph Connectivity. SPAA : 381-392]]>https://dblp.org/rec/conf/spaa/AcarABD19Tue, 01 Jan 2019 00:00:00 +0100 Optimal Parallel Algorithms in the Binary-Forking Model.http://arxiv.org/abs/1903.04650, , , :
Optimal Parallel Algorithms in the Binary-Forking Model. CoRR abs/1903.04650 ()]]>https://dblp.org/rec/journals/corr/abs-1903-04650Tue, 01 Jan 2019 00:00:00 +0100 Parallel Batch-Dynamic Graph Connectivity.http://arxiv.org/abs/1903.08794, , , :
Parallel Batch-Dynamic Graph Connectivity. CoRR abs/1903.08794 ()]]>https://dblp.org/rec/journals/corr/abs-1903-08794Tue, 01 Jan 2019 00:00:00 +0100 Low-Latency Graph Streaming Using Compressed Purely-Functional Trees.http://arxiv.org/abs/1904.08380, , :
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees. CoRR abs/1904.08380 ()]]>https://dblp.org/rec/journals/corr/abs-1904-08380Tue, 01 Jan 2019 00:00:00 +0100 Semi-Asymmetric Parallel Graph Algorithms for NVRAMs.http://arxiv.org/abs/1910.12310, , , , , , :
Semi-Asymmetric Parallel Graph Algorithms for NVRAMs. CoRR abs/1910.12310 ()]]>https://dblp.org/rec/journals/corr/abs-1910-12310Tue, 01 Jan 2019 00:00:00 +0100 LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS.http://arxiv.org/abs/1911.09671, :
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS. CoRR abs/1911.09671 ()]]>https://dblp.org/rec/journals/corr/abs-1911-09671Tue, 01 Jan 2019 00:00:00 +0100 Algorithmic Building Blocks for Asymmetric Memories.https://doi.org/10.4230/LIPIcs.ESA.2018.44, , :
Algorithmic Building Blocks for Asymmetric Memories. ESA : 44:1-44:15]]>https://dblp.org/rec/conf/esa/0001SB18Mon, 01 Jan 2018 00:00:00 +0100 Implicit Decomposition for Write-Efficient Connectivity Algorithms.https://doi.org/10.1109/IPDPS.2018.00081, , , , , , :
Implicit Decomposition for Write-Efficient Connectivity Algorithms. IPDPS : 711-722]]>https://dblp.org/rec/conf/ipps/Ben-DavidBFG0MS18Mon, 01 Jan 2018 00:00:00 +0100 PAM: parallel augmented maps.https://doi.org/10.1145/3178487.3178509, , :
PAM: parallel augmented maps. PPoPP : 290-304]]>https://dblp.org/rec/conf/ppopp/SunFB18Mon, 01 Jan 2018 00:00:00 +0100 Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry.https://doi.org/10.1145/3210377.3210380, , , :
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. SPAA : 235-246]]>https://dblp.org/rec/conf/spaa/Blelloch0SS18Mon, 01 Jan 2018 00:00:00 +0100 The Parallel Persistent Memory Model.https://doi.org/10.1145/3210377.3210381, , , , :
The Parallel Persistent Memory Model. SPAA : 247-258]]>https://dblp.org/rec/conf/spaa/BlellochG0MS18Mon, 01 Jan 2018 00:00:00 +0100 Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.https://doi.org/10.1145/3210377.3210414, , :
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. SPAA : 393-404]]>https://dblp.org/rec/conf/spaa/DhulipalaBS18Mon, 01 Jan 2018 00:00:00 +0100 Efficient Single Writer Concurrency.http://arxiv.org/abs/1803.08617, , , :
Efficient Single Writer Concurrency. CoRR abs/1803.08617 ()]]>https://dblp.org/rec/journals/corr/abs-1803-08617Mon, 01 Jan 2018 00:00:00 +0100 Parallel Range and Segment Queries with Augmented Maps.http://arxiv.org/abs/1803.08621, :
Parallel Range and Segment Queries with Augmented Maps. CoRR abs/1803.08621 ()]]>https://dblp.org/rec/journals/corr/abs-1803-08621Mon, 01 Jan 2018 00:00:00 +0100 Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.http://arxiv.org/abs/1805.05208, , :
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. CoRR abs/1805.05208 ()]]>https://dblp.org/rec/journals/corr/abs-1805-05208Mon, 01 Jan 2018 00:00:00 +0100 The Parallel Persistent Memory Model.http://arxiv.org/abs/1805.05580, , , , :
The Parallel Persistent Memory Model. CoRR abs/1805.05580 ()]]>https://dblp.org/rec/journals/corr/abs-1805-05580Mon, 01 Jan 2018 00:00:00 +0100 Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry.http://arxiv.org/abs/1805.05592, , , :
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. CoRR abs/1805.05592 ()]]>https://dblp.org/rec/journals/corr/abs-1805-05592Mon, 01 Jan 2018 00:00:00 +0100 Making Concurrent Algorithms Detectable.http://arxiv.org/abs/1806.04780, , :
Making Concurrent Algorithms Detectable. CoRR abs/1806.04780 ()]]>https://dblp.org/rec/journals/corr/abs-1806-04780Mon, 01 Jan 2018 00:00:00 +0100 Algorithmic Building Blocks for Asymmetric Memories.http://arxiv.org/abs/1806.10370, , :
Algorithmic Building Blocks for Asymmetric Memories. CoRR abs/1806.10370 ()]]>https://dblp.org/rec/journals/corr/abs-1806-10370Mon, 01 Jan 2018 00:00:00 +0100 Parallelism in Randomized Incremental Algorithms.http://arxiv.org/abs/1810.05303, , , :
Parallelism in Randomized Incremental Algorithms. CoRR abs/1810.05303 ()]]>https://dblp.org/rec/journals/corr/abs-1810-05303Mon, 01 Jan 2018 00:00:00 +0100 Batch-Parallel Euler Tour Trees.http://arxiv.org/abs/1810.10738, , :
Batch-Parallel Euler Tour Trees. CoRR abs/1810.10738 ()]]>https://dblp.org/rec/journals/corr/abs-1810-10738Mon, 01 Jan 2018 00:00:00 +0100 Technical Perspective: Functional compilers.https://doi.org/10.1145/3060595:
Technical Perspective: Functional compilers. Commun. ACM 60(5): 82 ()]]>https://dblp.org/rec/journals/cacm/Blelloch17Sun, 01 Jan 2017 00:00:00 +0100 Parallel lightweight wavelet tree, suffix array and FM-index construction.https://doi.org/10.1016/j.jda.2017.04.001, , :
Parallel lightweight wavelet tree, suffix array and FM-index construction. J. Discrete Algorithms 43: 2-17 ()]]>https://dblp.org/rec/journals/jda/LabeitSB17Sun, 01 Jan 2017 00:00:00 +0100 Optimally Scheduling Jobs with Multiple Tasks.https://doi.org/10.1145/3152042.3152055, , , :
Optimally Scheduling Jobs with Multiple Tasks. SIGMETRICS Perform. Evaluation Rev. 45(2): 36-38 ()]]>https://dblp.org/rec/journals/sigmetrics/ScullyBHS17Sun, 01 Jan 2017 00:00:00 +0100 Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies.https://doi.org/10.1109/HiPC.2017.00023, , :
Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies. HiPC : 124-133]]>https://dblp.org/rec/conf/hipc/BlellochGS17Sun, 01 Jan 2017 00:00:00 +0100 Efficient Construction of Probabilistic Tree Embeddings.https://doi.org/10.4230/LIPIcs.ICALP.2017.26, , :
Efficient Construction of Probabilistic Tree Embeddings. ICALP : 26:1-26:14]]>https://dblp.org/rec/conf/icalp/Blelloch0S17Sun, 01 Jan 2017 00:00:00 +0100 Some Sequential Algorithms are Almost Always Parallel.https://doi.org/10.1145/3087801.3087871:
Some Sequential Algorithms are Almost Always Parallel. PODC : 1]]>https://dblp.org/rec/conf/podc/Blelloch17Sun, 01 Jan 2017 00:00:00 +0100 Analyzing Contention and Backoff in Asynchronous Shared Memory.https://doi.org/10.1145/3087801.3087828, :
Analyzing Contention and Backoff in Asynchronous Shared Memory. PODC : 53-62]]>https://dblp.org/rec/conf/podc/Ben-DavidB17Sun, 01 Jan 2017 00:00:00 +0100 Parallel functional arrays.https://doi.org/10.1145/3009837.3009869, , :
Parallel functional arrays. POPL : 706-718]]>https://dblp.org/rec/conf/popl/KumarBH17Sun, 01 Jan 2017 00:00:00 +0100 Some Sequential Algorithms are Almost Always Parallel.https://doi.org/10.1145/3087556.3087602:
Some Sequential Algorithms are Almost Always Parallel. SPAA : 141]]>https://dblp.org/rec/conf/spaa/Blelloch17Sun, 01 Jan 2017 00:00:00 +0100 Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing.https://doi.org/10.1145/3087556.3087580, , :
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. SPAA : 293-304]]>https://dblp.org/rec/conf/spaa/DhulipalaBS17Sun, 01 Jan 2017 00:00:00 +0100 Implicit Decomposition for Write-Efficient Connectivity Algorithms.http://arxiv.org/abs/1710.02637, , , , , , :
Implicit Decomposition for Write-Efficient Connectivity Algorithms. CoRR abs/1710.02637 ()]]>https://dblp.org/rec/journals/corr/abs-1710-02637Sun, 01 Jan 2017 00:00:00 +0100 Experimental Analysis of Space-Bounded Schedulers.https://doi.org/10.1145/2938389, , , , :
Experimental Analysis of Space-Bounded Schedulers. ACM Trans. Parallel Comput. 3(1): 8:1-8:27 ()]]>https://dblp.org/rec/journals/topc/SimhadriBFGK16Fri, 01 Jan 2016 00:00:00 +0100 Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction.https://doi.org/10.1109/DCC.2016.117, , :
Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction. DCC : 33-42]]>https://dblp.org/rec/conf/dcc/LabeitSB16Fri, 01 Jan 2016 00:00:00 +0100 Efficient Algorithms with Asymmetric Read and Write Costs.https://doi.org/10.4230/LIPIcs.ESA.2016.14, , , , :
Efficient Algorithms with Asymmetric Read and Write Costs. ESA : 14:1-14:18]]>https://dblp.org/rec/conf/esa/BlellochFG0S16Fri, 01 Jan 2016 00:00:00 +0100 Hierarchical memory management for parallel programs.https://doi.org/10.1145/2951913.2951935, , , :
Hierarchical memory management for parallel programs. ICFP : 392-406]]>https://dblp.org/rec/conf/icfp/RaghunathanMAB16Fri, 01 Jan 2016 00:00:00 +0100 Parallel Algorithms for Asymmetric Read-Write Costs.https://doi.org/10.1145/2935764.2935767, , , , , , :
Parallel Algorithms for Asymmetric Read-Write Costs. SPAA : 145-156]]>https://dblp.org/rec/conf/spaa/Ben-DavidBFG0MS16Fri, 01 Jan 2016 00:00:00 +0100 Just Join for Parallel Ordered Sets.https://doi.org/10.1145/2935764.2935768, , :
Just Join for Parallel Ordered Sets. SPAA : 253-264]]>https://dblp.org/rec/conf/spaa/BlellochFS16Fri, 01 Jan 2016 00:00:00 +0100 Parallel Shortest Paths Using Radius Stepping.https://doi.org/10.1145/2935764.2935765, , , :
Parallel Shortest Paths Using Radius Stepping. SPAA : 443-454]]>https://dblp.org/rec/conf/spaa/Blelloch0ST16Fri, 01 Jan 2016 00:00:00 +0100 Parallelism in Randomized Incremental Algorithms.https://doi.org/10.1145/2935764.2935766, , , :
Parallelism in Randomized Incremental Algorithms. SPAA : 467-478]]>https://dblp.org/rec/conf/spaa/Blelloch0SS16Fri, 01 Jan 2016 00:00:00 +0100 Parallel Ordered Sets Using Join.http://arxiv.org/abs/1602.02120, , :
Parallel Ordered Sets Using Join. CoRR abs/1602.02120 ()]]>https://dblp.org/rec/journals/corr/BlellochFS16Fri, 01 Jan 2016 00:00:00 +0100 Parallel Shortest-Paths Using Radius Stepping.http://arxiv.org/abs/1602.03881, , , :
Parallel Shortest-Paths Using Radius Stepping. CoRR abs/1602.03881 ()]]>https://dblp.org/rec/journals/corr/Blelloch0ST16Fri, 01 Jan 2016 00:00:00 +0100 Sorting with Asymmetric Read and Write Costs.http://arxiv.org/abs/1603.03505, , , , :
Sorting with Asymmetric Read and Write Costs. CoRR abs/1603.03505 ()]]>https://dblp.org/rec/journals/corr/BlellochFG0S16Fri, 01 Jan 2016 00:00:00 +0100 A New Efficient Construction on Probabilistic Tree Embeddings.http://arxiv.org/abs/1605.04651, , :
A New Efficient Construction on Probabilistic Tree Embeddings. CoRR abs/1605.04651 ()]]>https://dblp.org/rec/journals/corr/Blelloch0S16Fri, 01 Jan 2016 00:00:00 +0100 PAM: Parallel Augmented Maps.http://arxiv.org/abs/1612.05665, , :
PAM: Parallel Augmented Maps. CoRR abs/1612.05665 ()]]>https://dblp.org/rec/journals/corr/SunFB16aFri, 01 Jan 2016 00:00:00 +0100 Cache efficient functional algorithms.https://doi.org/10.1145/2776825, :
Cache efficient functional algorithms. Commun. ACM 58(7): 101-108 ()]]>https://dblp.org/rec/journals/cacm/BlellochH15Thu, 01 Jan 2015 00:00:00 +0100 Ray Specialized Contraction on Bounding Volume Hierarchies.https://doi.org/10.1111/cgf.12769, , :
Ray Specialized Contraction on Bounding Volume Hierarchies. Comput. Graph. Forum 34(7): 309-318 ()]]>https://dblp.org/rec/journals/cgf/0001HB15Thu, 01 Jan 2015 00:00:00 +0100 Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+.https://doi.org/10.1109/DCC.2015.8, , :
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+. DCC : 403-412]]>https://dblp.org/rec/conf/dcc/ShunDB15Thu, 01 Jan 2015 00:00:00 +0100 Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm.https://doi.org/10.1007/978-3-662-48350-3_10, , :
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. ESA : 106-117]]>https://dblp.org/rec/conf/esa/BaumstarkBS15Thu, 01 Jan 2015 00:00:00 +0100 Coupling Memory and Computation for Locality Management.https://doi.org/10.4230/LIPIcs.SNAPL.2015.1, , , , :
Coupling Memory and Computation for Locality Management. SNAPL : 1-14]]>https://dblp.org/rec/conf/snapl/AcarBFMR15Thu, 01 Jan 2015 00:00:00 +0100 Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel.https://doi.org/10.1137/1.9781611973730.30, , , , :
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. SODA : 431-448]]>https://dblp.org/rec/conf/soda/ShunGBFG15Thu, 01 Jan 2015 00:00:00 +0100 Sorting with Asymmetric Read and Write Costs.https://doi.org/10.1145/2755573.2755604, , , , :
Sorting with Asymmetric Read and Write Costs. SPAA : 1-12]]>https://dblp.org/rec/conf/spaa/BlellochFGGS15Thu, 01 Jan 2015 00:00:00 +0100 A Top-Down Parallel Semisort.https://doi.org/10.1145/2755573.2755597, , , :
A Top-Down Parallel Semisort. SPAA : 24-34]]>https://dblp.org/rec/conf/spaa/GuSSB15Thu, 01 Jan 2015 00:00:00 +0100 Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015.https://doi.org/10.1145/2755573, :
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015. ACM , ISBN 978-1-4503-3588-1 [contents]]]>https://dblp.org/rec/conf/spaa/2015Thu, 01 Jan 2015 00:00:00 +0100 Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm.http://arxiv.org/abs/1507.01926, , :
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. CoRR abs/1507.01926 ()]]>https://dblp.org/rec/journals/corr/BaumstarkBS15Thu, 01 Jan 2015 00:00:00 +0100 Efficient Algorithms under Asymmetric Read and Write Costs.http://arxiv.org/abs/1511.01038, , , , :
Efficient Algorithms under Asymmetric Read and Write Costs. CoRR abs/1511.01038 ()]]>https://dblp.org/rec/journals/corr/BlellochFG0S15Thu, 01 Jan 2015 00:00:00 +0100 Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.https://doi.org/10.1007/s00224-013-9444-5, , , , , :
Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. Theory Comput. Syst. 55(3): 521-554 ()]]>https://dblp.org/rec/journals/mst/BlellochGKMPT14Wed, 01 Jan 2014 00:00:00 +0100 A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction.https://doi.org/10.1145/2661653, :
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction. ACM Trans. Parallel Comput. 1(1): 8:1-8:20 ()]]>https://dblp.org/rec/journals/topc/ShunB14Wed, 01 Jan 2014 00:00:00 +0100 Experimental analysis of space-bounded schedulers.https://doi.org/10.1145/2612669.2612678, , , , :
Experimental analysis of space-bounded schedulers. SPAA : 30-41]]>https://dblp.org/rec/conf/spaa/SimhadriBFGK14Wed, 01 Jan 2014 00:00:00 +0100 Phase-concurrent hash tables for determinism.https://doi.org/10.1145/2612669.2612687, :
Phase-concurrent hash tables for determinism. SPAA : 96-107]]>https://dblp.org/rec/conf/spaa/ShunB14Wed, 01 Jan 2014 00:00:00 +0100 A simple and practical linear-work parallel algorithm for connectivity.https://doi.org/10.1145/2612669.2612692, , :
A simple and practical linear-work parallel algorithm for connectivity. SPAA : 143-153]]>https://dblp.org/rec/conf/spaa/ShunDB14Wed, 01 Jan 2014 00:00:00 +0100 Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest.https://doi.org/10.1007/978-3-319-07959-2_11, , :
Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest. SEA : 123-137]]>https://dblp.org/rec/conf/wea/KyrolaSB14Wed, 01 Jan 2014 00:00:00 +0100 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014.https://doi.org/10.1145/2612669, :
26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014. ACM , ISBN 978-1-4503-2821-0 [contents]]]>https://dblp.org/rec/conf/spaa/2014Wed, 01 Jan 2014 00:00:00 +0100 Coalescent-Based Method for Learning Parameters of Admixture Events from Large-Scale Genetic Variation Data.https://doi.org/10.1109/TCBB.2013.98, , , :
Coalescent-Based Method for Learning Parameters of Admixture Events from Large-Scale Genetic Variation Data. IEEE ACM Trans. Comput. Biol. Bioinform. 10(5): 1137-1149 ()]]>https://dblp.org/rec/journals/tcbb/TsaiBRS13Tue, 01 Jan 2013 00:00:00 +0100 Efficient BVH Construction via Approximate Agglomerative Clustering.https://doi.org/10.1145/2492045.2492054, , , :
Efficient BVH Construction via Approximate Agglomerative Clustering. High Performance Graphics : 81-88]]>https://dblp.org/rec/conf/egh/GuHFB13Tue, 01 Jan 2013 00:00:00 +0100 Topic 12: Theory and Algorithms for Parallel Computation - (Introduction).https://doi.org/10.1007/978-3-642-40047-6_64, , , :
Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). Euro-Par : 645-646]]>https://dblp.org/rec/conf/europar/ItalianoMBT13Tue, 01 Jan 2013 00:00:00 +0100 Program-centric cost models for locality.https://doi.org/10.1145/2492408.2492417, , , :
Program-centric cost models for locality. MSPC@PLDI : 6:1-6:2]]>https://dblp.org/rec/conf/pldi/BlellochFGS13Tue, 01 Jan 2013 00:00:00 +0100 Cache and I/O efficent functional algorithms.https://doi.org/10.1145/2429069.2429077, :
Cache and I/O efficent functional algorithms. POPL : 39-50]]>https://dblp.org/rec/conf/popl/BlellochH13Tue, 01 Jan 2013 00:00:00 +0100 Ligra: a lightweight graph processing framework for shared memory.https://doi.org/10.1145/2442516.2442530, :
Ligra: a lightweight graph processing framework for shared memory. PPoPP : 135-146]]>https://dblp.org/rec/conf/ppopp/ShunB13Tue, 01 Jan 2013 00:00:00 +0100 Reducing contention through priority updates.https://doi.org/10.1145/2442516.2442554, , , :
Reducing contention through priority updates. PPoPP : 299-300]]>https://dblp.org/rec/conf/ppopp/ShunBFG13Tue, 01 Jan 2013 00:00:00 +0100 Reducing contention through priority updates.https://doi.org/10.1145/2486159.2486189, , , :
Reducing contention through priority updates. SPAA : 152-163]]>https://dblp.org/rec/conf/spaa/ShunBFG13Tue, 01 Jan 2013 00:00:00 +0100 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013.https://doi.org/10.1145/2486159, :
25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013. ACM , ISBN 978-1-4503-1572-2 [contents]]]>https://dblp.org/rec/conf/spaa/2013Tue, 01 Jan 2013 00:00:00 +0100 Introduction to special issue ALENEX'10.https://doi.org/10.1145/2133803.2184447, :
Introduction to special issue ALENEX'10. ACM J. Exp. Algorithmics 17(1) ()]]>https://dblp.org/rec/journals/jea/BlellochH12Sun, 01 Jan 2012 00:00:00 +0100 Problem Based Benchmarks.https://dblp.org/pid/b/GEBlelloch.html:
Problem Based Benchmarks. ANALCO ]]>https://dblp.org/rec/conf/analco/Blelloch12Sun, 01 Jan 2012 00:00:00 +0100 Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data.https://doi.org/10.1145/2382936.2382948, , , :
Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data. BCB : 90-97]]>https://dblp.org/rec/conf/bcb/TsaiBSR12Sun, 01 Jan 2012 00:00:00 +0100 Non-monotonic Self-Adjusting Computation.https://doi.org/10.1007/978-3-642-28869-2_24, , :
Non-monotonic Self-Adjusting Computation. ESOP : 476-496]]>https://dblp.org/rec/conf/esop/Ley-WildAB12Sun, 01 Jan 2012 00:00:00 +0100 GraphChi: Large-Scale Graph Computation on Just a PC.https://www.usenix.org/conference/osdi12/technical-sessions/presentation/kyrola, , :
GraphChi: Large-Scale Graph Computation on Just a PC. OSDI : 31-46]]>https://dblp.org/rec/conf/osdi/KyrolaBG12Sun, 01 Jan 2012 00:00:00 +0100 Internally deterministic parallel algorithms can be fast.https://doi.org/10.1145/2145816.2145840, , , :
Internally deterministic parallel algorithms can be fast. PPoPP : 181-192]]>https://dblp.org/rec/conf/ppopp/BlellochFGS12Sun, 01 Jan 2012 00:00:00 +0100 Brief announcement: the problem based benchmark suite.https://doi.org/10.1145/2312005.2312018, , , , , , :
Brief announcement: the problem based benchmark suite. SPAA : 68-70]]>https://dblp.org/rec/conf/spaa/ShunBFGKST12Sun, 01 Jan 2012 00:00:00 +0100 Parallel and I/O efficient set covering algorithms.https://doi.org/10.1145/2312005.2312024, , :
Parallel and I/O efficient set covering algorithms. SPAA : 82-90]]>https://dblp.org/rec/conf/spaa/BlellochST12Sun, 01 Jan 2012 00:00:00 +0100 Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design.https://doi.org/10.1145/2312005.2312045, , :
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. SPAA : 205-213]]>https://dblp.org/rec/conf/spaa/BlellochGT12Sun, 01 Jan 2012 00:00:00 +0100 Greedy sequential maximal independent set and matching are parallel on average.https://doi.org/10.1145/2312005.2312058, , :
Greedy sequential maximal independent set and matching are parallel on average. SPAA : 308-317]]>https://dblp.org/rec/conf/spaa/BlellochFS12Sun, 01 Jan 2012 00:00:00 +0100 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012.https://doi.org/10.1145/2312005, :
24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012. ACM , ISBN 978-1-4503-1213-4 [contents]]]>https://dblp.org/rec/conf/spaa/2012Sun, 01 Jan 2012 00:00:00 +0100 Greedy Sequential Maximal Independent Set and Matching are Parallel on Average.http://arxiv.org/abs/1202.3205, , :
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. CoRR abs/1202.3205 ()]]>https://dblp.org/rec/journals/corr/abs-1202-3205Sun, 01 Jan 2012 00:00:00 +0100 Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny.https://doi.org/10.1089/cmb.2010.0254, , , :
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny. J. Comput. Biol. 18(3): 445-457 ()]]>https://dblp.org/rec/journals/jcb/MisraBRS11Sat, 01 Jan 2011 00:00:00 +0100 An Optimization-Based Sampling Scheme for Phylogenetic Trees.https://doi.org/10.1089/cmb.2011.0164, , , :
An Optimization-Based Sampling Scheme for Phylogenetic Trees. J. Comput. Biol. 18(11): 1599-1609 ()]]>https://dblp.org/rec/journals/jcb/MisraBRS11aSat, 01 Jan 2011 00:00:00 +0100 A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure.https://doi.org/10.1109/TCBB.2011.23, , , :
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. IEEE ACM Trans. Comput. Biol. Bioinform. 8(4): 918-928 ()]]>https://dblp.org/rec/journals/tcbb/TsaiBRS11Sat, 01 Jan 2011 00:00:00 +0100 A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction.https://doi.org/10.1137/1.9781611972917.5, :
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. ALENEX : 48-58]]>https://dblp.org/rec/conf/alenex/BlellochS11Sat, 01 Jan 2011 00:00:00 +0100 An Optimization-Based Sampling Scheme for Phylogenetic Trees.https://doi.org/10.1007/978-3-642-20036-6_23, , , :
An Optimization-Based Sampling Scheme for Phylogenetic Trees. RECOMB : 252-266]]>https://dblp.org/rec/conf/recomb/MisraBRS11Sat, 01 Jan 2011 00:00:00 +0100 Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs.https://doi.org/10.1145/1989493.1989496, , , , , :
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA : 13-22]]>https://dblp.org/rec/conf/spaa/BlellochGKMPT11Sat, 01 Jan 2011 00:00:00 +0100 Linear-work greedy parallel approximate set cover and variants.https://doi.org/10.1145/1989493.1989497, , :
Linear-work greedy parallel approximate set cover and variants. SPAA : 23-32]]>https://dblp.org/rec/conf/spaa/BlellochPT11Sat, 01 Jan 2011 00:00:00 +0100 Scheduling irregular parallel computations on hierarchical caches.https://doi.org/10.1145/1989493.1989553, , , :
Scheduling irregular parallel computations on hierarchical caches. SPAA : 355-366]]>https://dblp.org/rec/conf/spaa/BlellochFGS11Sat, 01 Jan 2011 00:00:00 +0100 NESL.https://doi.org/10.1007/978-0-387-09766-4_225:
NESL. Encyclopedia of Parallel Computing : 1278-1283]]>https://dblp.org/rec/reference/parallel/Blelloch11Sat, 01 Jan 2011 00:00:00 +0100 Selective Memoization.http://arxiv.org/abs/1106.0447, , :
Selective Memoization. CoRR abs/1106.0447 ()]]>https://dblp.org/rec/journals/corr/abs-1106-0447Sat, 01 Jan 2011 00:00:00 +0100 Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.http://arxiv.org/abs/1111.1750, , , , , :
Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. CoRR abs/1111.1750 ()]]>https://dblp.org/rec/journals/corr/abs-1111-1750Sat, 01 Jan 2011 00:00:00 +0100 Space profiling for parallel functional programs.https://doi.org/10.1017/S0956796810000146, , , :
Space profiling for parallel functional programs. J. Funct. Program. 20(5-6): 417-461 ()]]>https://dblp.org/rec/journals/jfp/SpoonhowerBHG08Fri, 01 Jan 2010 00:00:00 +0100 Succinct Representations of Separable Graphs.https://doi.org/10.1007/978-3-642-13509-5_13, :
Succinct Representations of Separable Graphs. CPM : 138-150]]>https://dblp.org/rec/conf/cpm/BlellochF10Fri, 01 Jan 2010 00:00:00 +0100 Functional parallel algorithms.https://doi.org/10.1145/1863543.1863579:
Functional parallel algorithms. ICFP : 247-248]]>https://dblp.org/rec/conf/icfp/Blelloch10Fri, 01 Jan 2010 00:00:00 +0100 A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure.https://doi.org/10.1007/978-3-642-13078-6_20, , , :
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. ISBRA : 167-178]]>https://dblp.org/rec/conf/isbra/TsaiBRS10Fri, 01 Jan 2010 00:00:00 +0100 Traceable data types for self-adjusting computation.https://doi.org/10.1145/1806596.1806650, , , , :
Traceable data types for self-adjusting computation. PLDI : 483-496]]>https://dblp.org/rec/conf/pldi/AcarBLTT10Fri, 01 Jan 2010 00:00:00 +0100 Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny.https://doi.org/10.1007/978-3-642-12683-3_24, , , :
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny. RECOMB : 369-383]]>https://dblp.org/rec/conf/recomb/MisraBRS10Fri, 01 Jan 2010 00:00:00 +0100 Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid.https://doi.org/10.1109/SC.2010.29, , , :
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. SC : 1-12]]>https://dblp.org/rec/conf/sc/BlellochKMT10Fri, 01 Jan 2010 00:00:00 +0100 Low depth cache-oblivious algorithms.https://doi.org/10.1145/1810479.1810519, , :
Low depth cache-oblivious algorithms. SPAA : 189-199]]>https://dblp.org/rec/conf/spaa/BlellochGS10Fri, 01 Jan 2010 00:00:00 +0100 Parallel approximation algorithms for facility-location problems.https://doi.org/10.1145/1810479.1810535, :
Parallel approximation algorithms for facility-location problems. SPAA : 315-324]]>https://dblp.org/rec/conf/spaa/BlellochT10Fri, 01 Jan 2010 00:00:00 +0100 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010.https://doi.org/10.1137/1.9781611972900, :
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010. SIAM , ISBN 978-0-898719-31-4 [contents]]]>https://dblp.org/rec/conf/alenex/2010Fri, 01 Jan 2010 00:00:00 +0100 Parallel Approximation Algorithms for Facility-Location Problems.http://arxiv.org/abs/1006.1923, :
Parallel Approximation Algorithms for Facility-Location Problems. CoRR abs/1006.1923 ()]]>https://dblp.org/rec/journals/corr/abs-1006-1923Fri, 01 Jan 2010 00:00:00 +0100 An experimental analysis of self-adjusting computation.https://doi.org/10.1145/1596527.1596530, , , , :
An experimental analysis of self-adjusting computation. ACM Trans. Program. Lang. Syst. 32(1): 3:1-3:53 ()]]>https://dblp.org/rec/journals/toplas/AcarBBHT09Thu, 01 Jan 2009 00:00:00 +0100 Parallel thinking.https://doi.org/10.1145/1504176.1504177:
Parallel thinking. PPoPP : 1-2]]>https://dblp.org/rec/conf/ppopp/Blelloch09Thu, 01 Jan 2009 00:00:00 +0100 Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures.https://doi.org/10.1145/1583991.1584019, , , :
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. SPAA : 91-100]]>https://dblp.org/rec/conf/spaa/SpoonhowerBGH09Thu, 01 Jan 2009 00:00:00 +0100 Brief announcement: low depth cache-oblivious sorting.https://doi.org/10.1145/1583991.1584024, , :
Brief announcement: low depth cache-oblivious sorting. SPAA : 121-123]]>https://dblp.org/rec/conf/spaa/BlellochGS09Thu, 01 Jan 2009 00:00:00 +0100 Compact dictionaries for variable-length keys and data with applications.https://doi.org/10.1145/1361192.1361194, :
Compact dictionaries for variable-length keys and data with applications. ACM Trans. Algorithms 4(2): 17:1-17:25 ()]]>https://dblp.org/rec/journals/talg/BlandfordB08Tue, 01 Jan 2008 00:00:00 +0100 Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference.https://doi.org/10.1109/TCBB.2008.26, , , , :
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 323-331 ()]]>https://dblp.org/rec/journals/tcbb/SridharLBRS08Tue, 01 Jan 2008 00:00:00 +0100 Robust Kinetic Convex Hulls in 3D.https://doi.org/10.1007/978-3-540-87744-8_3, , , :
Robust Kinetic Convex Hulls in 3D. ESA : 29-40]]>https://dblp.org/rec/conf/esa/AcarBTT08Tue, 01 Jan 2008 00:00:00 +0100 A New Combinatorial Approach for Sparse Graph Problems.https://doi.org/10.1007/978-3-540-70575-8_10, , :
A New Combinatorial Approach for Sparse Graph Problems. ICALP (1) : 108-120]]>https://dblp.org/rec/conf/icalp/BlellochVW08Tue, 01 Jan 2008 00:00:00 +0100 Space profiling for parallel functional programs.https://doi.org/10.1145/1411204.1411240, , , :
Space profiling for parallel functional programs. ICFP : 253-264]]>https://dblp.org/rec/conf/icfp/SpoonhowerBHG08Tue, 01 Jan 2008 00:00:00 +0100 Provably good multicore cache performance for divide-and-conquer algorithms.http://dl.acm.org/citation.cfm?id=1347082.1347137, , , , , :
Provably good multicore cache performance for divide-and-conquer algorithms. SODA : 501-510]]>https://dblp.org/rec/conf/soda/BlellochCGRCK08Tue, 01 Jan 2008 00:00:00 +0100 Space-efficient dynamic orthogonal point location, segment intersection, and range reporting.http://dl.acm.org/citation.cfm?id=1347082.1347180:
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. SODA : 894-903]]>https://dblp.org/rec/conf/soda/Blelloch08Tue, 01 Jan 2008 00:00:00 +0100 Combinable memory-block transactions.https://doi.org/10.1145/1378533.1378537, , :
Combinable memory-block transactions. SPAA : 23-34]]>https://dblp.org/rec/conf/spaa/BlellochGV08Tue, 01 Jan 2008 00:00:00 +0100 Uniquely Represented Data Structures for Computational Geometry.https://doi.org/10.1007/978-3-540-69903-3_4, , :
Uniquely Represented Data Structures for Computational Geometry. SWAT : 17-28]]>https://dblp.org/rec/conf/swat/BlellochGV08Tue, 01 Jan 2008 00:00:00 +0100 Direct maximum parsimony phylogeny reconstruction from genotype data.https://doi.org/10.1186/1471-2105-8-472, , , , :
Direct maximum parsimony phylogeny reconstruction from genotype data. BMC Bioinform. 8 ()]]>https://dblp.org/rec/journals/bmcbi/SridharLBRS07Mon, 01 Jan 2007 00:00:00 +0100 Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.https://doi.org/10.1109/TCBB.2007.1070, , , , , :
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 561-571 ()]]>https://dblp.org/rec/journals/tcbb/SridharDBHRS07Mon, 01 Jan 2007 00:00:00 +0100 Kinetic 3D convex hulls via self-adjusting computation.https://doi.org/10.1145/1247069.1247093, , :
Kinetic 3D convex hulls via self-adjusting computation. SCG : 129-130]]>https://dblp.org/rec/conf/compgeom/AcarBT07Mon, 01 Jan 2007 00:00:00 +0100 Strongly History-Independent Hashing with Applications.https://doi.org/10.1109/FOCS.2007.36, :
Strongly History-Independent Hashing with Applications. FOCS : 272-282]]>https://dblp.org/rec/conf/focs/BlellochG07Mon, 01 Jan 2007 00:00:00 +0100 Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming.https://doi.org/10.1007/978-3-540-72031-7_4, , , , :
Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming. ISBRA : 37-48]]>https://dblp.org/rec/conf/isbra/SridharLBRS07Mon, 01 Jan 2007 00:00:00 +0100 Scheduling threads for constructive cache sharing on CMPs.https://doi.org/10.1145/1248377.1248396, , , , , , , , , , :
Scheduling threads for constructive cache sharing on CMPs. SPAA : 105-115]]>https://dblp.org/rec/conf/spaa/ChenGKLABFFHMW07Mon, 01 Jan 2007 00:00:00 +0100 Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming, DAMP 2007, Nice, France, January 16, 2007.https://dblp.org/pid/b/GEBlelloch.html, :
Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming, DAMP 2007, Nice, France, January 16, 2007. ACM , ISBN 978-1-59593-690-5 [contents]]]>https://dblp.org/rec/conf/popl/2007dampMon, 01 Jan 2007 00:00:00 +0100 Adaptive functional programming.https://doi.org/10.1145/1186632.1186634, , :
Adaptive functional programming. ACM Trans. Program. Lang. Syst. 28(6): 990-1034 ()]]>https://dblp.org/rec/journals/toplas/AcarBH06Sun, 01 Jan 2006 00:00:00 +0100 Engineering a compact parallel delaunay algorithm in 3D.https://doi.org/10.1145/1137856.1137900, , :
Engineering a compact parallel delaunay algorithm in 3D. SCG : 292-300]]>https://dblp.org/rec/conf/compgeom/BlandfordBK06Sun, 01 Jan 2006 00:00:00 +0100 Kinetic Algorithms Via Self-adjusting Computation.https://doi.org/10.1007/11841036_57, , , :
Kinetic Algorithms Via Self-adjusting Computation. ESA : 636-647]]>https://dblp.org/rec/conf/esa/AcarBTV06Sun, 01 Jan 2006 00:00:00 +0100 Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.https://doi.org/10.1007/11786986_58, , , , , :
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. ICALP (1) : 667-678]]>https://dblp.org/rec/conf/icalp/BlellochDHRSS06Sun, 01 Jan 2006 00:00:00 +0100 Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees.https://doi.org/10.1007/11758525_107, , , , , :
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. International Conference on Computational Science (2) : 799-806]]>https://dblp.org/rec/conf/iccS/SridharDBHRS06Sun, 01 Jan 2006 00:00:00 +0100 An experimental analysis of self-adjusting computation.https://doi.org/10.1145/1133981.1133993, , , :
An experimental analysis of self-adjusting computation. PLDI : 96-107]]>https://dblp.org/rec/conf/pldi/AcarBBT06Sun, 01 Jan 2006 00:00:00 +0100 Parallel depth first vs. work stealing schedulers on CMP architectures.https://doi.org/10.1145/1148109.1148167, , , , , , , , , , :
Parallel depth first vs. work stealing schedulers on CMP architectures. SPAA : 330]]>https://dblp.org/rec/conf/spaa/LiaskovitisCGABFFHKMW06Sun, 01 Jan 2006 00:00:00 +0100 Compact representations of simplicial meshes in two and three dimensions.https://doi.org/10.1142/S0218195905001580, , , :
Compact representations of simplicial meshes in two and three dimensions. Int. J. Comput. Geom. Appl. 15(1): 3-24 ()]]>https://dblp.org/rec/journals/ijcga/BlandfordBCK05Sat, 01 Jan 2005 00:00:00 +0100 An Experimental Analysis of Change Propagation in Dynamic Trees.http://www.siam.org/meetings/alenex05/papers/04uacar.pdf, , :
An Experimental Analysis of Change Propagation in Dynamic Trees. ALENEX/ANALCO : 41-54]]>https://dblp.org/rec/conf/alenex/AcarBV05Sat, 01 Jan 2005 00:00:00 +0100 Dictionaries using variable-length keys and data, with applications.http://dl.acm.org/citation.cfm?id=1070432.1070434, :
Dictionaries using variable-length keys and data, with applications. SODA : 1-10]]>https://dblp.org/rec/conf/soda/BlandfordB05Sat, 01 Jan 2005 00:00:00 +0100 Using page residency to balance tradeoffs in tracing garbage collection.https://doi.org/10.1145/1064979.1064989, , :
Using page residency to balance tradeoffs in tracing garbage collection. VEE : 57-67]]>https://dblp.org/rec/conf/vee/SpoonhowerBH05Sat, 01 Jan 2005 00:00:00 +0100 A Library for Self-Adjusting Computation.https://doi.org/10.1016/j.entcs.2005.11.043, , , , :
A Library for Self-Adjusting Computation. ML : 127-154]]>https://dblp.org/rec/journals/entcs/AcarBBHT06Sat, 01 Jan 2005 00:00:00 +0100 An Experimental Analysis of a Compact Graph Representation.https://dblp.org/pid/b/GEBlelloch.html, , :
An Experimental Analysis of a Compact Graph Representation. ALENEX/ANALC : 49-61]]>https://dblp.org/rec/conf/alenex/BlandfordBK04Thu, 01 Jan 2004 00:00:00 +0100 Compact representations of ordered sets.http://dl.acm.org/citation.cfm?id=982792.982795, :
Compact representations of ordered sets. SODA : 11-19]]>https://dblp.org/rec/conf/soda/BlandfordB04Thu, 01 Jan 2004 00:00:00 +0100 Dynamizing static algorithms, with applications to dynamic trees and history independence.http://dl.acm.org/citation.cfm?id=982792.982871, , , , :
Dynamizing static algorithms, with applications to dynamic trees and history independence. SODA : 531-540]]>https://dblp.org/rec/conf/soda/AcarBHVW04Thu, 01 Jan 2004 00:00:00 +0100 Effectively sharing a cache among threads.https://doi.org/10.1145/1007912.1007948, :
Effectively sharing a cache among threads. SPAA : 235-244]]>https://dblp.org/rec/conf/spaa/BlellochG04Thu, 01 Jan 2004 00:00:00 +0100 Automatic Generation of Staged Geometric Predicates.https://doi.org/10.1023/A:1025876920522, , :
Automatic Generation of Staged Geometric Predicates. High. Order Symb. Comput. 16(4): 379-400 ()]]>https://dblp.org/rec/journals/lisp/NanevskiBH03Wed, 01 Jan 2003 00:00:00 +0100 Scalable Room Synchronizations.https://doi.org/10.1007/s00224-003-1081-y, , :
Scalable Room Synchronizations. Theory Comput. Syst. 36(5): 397-430 ()]]>https://dblp.org/rec/journals/mst/BlellochCG03Wed, 01 Jan 2003 00:00:00 +0100 Compact Representations of Simplicial Meshes in Two and Three Dimensions.http://imr.sandia.gov/papers/abstracts/Bl278.html, , , :
Compact Representations of Simplicial Meshes in Two and Three Dimensions. IMR : 135-146]]>https://dblp.org/rec/conf/imr/BlandfordBCK03Wed, 01 Jan 2003 00:00:00 +0100 Selective memoization.https://doi.org/10.1145/604131.604133, , :
Selective memoization. POPL : 14-25]]>https://dblp.org/rec/conf/popl/AcarBH03Wed, 01 Jan 2003 00:00:00 +0100 Space-efficient finger search on degree-balanced search trees.http://dl.acm.org/citation.cfm?id=644108.644169, , :
Space-efficient finger search on degree-balanced search trees. SODA : 374-383]]>https://dblp.org/rec/conf/soda/BlellochMW03Wed, 01 Jan 2003 00:00:00 +0100 Compact representations of separable graphs.http://dl.acm.org/citation.cfm?id=644108.644219, , :
Compact representations of separable graphs. SODA : 679-688]]>https://dblp.org/rec/conf/soda/BlandfordBK03Wed, 01 Jan 2003 00:00:00 +0100 The Data Locality of Work Stealing.https://doi.org/10.1007/s00224-002-1057-3, , :
The Data Locality of Work Stealing. Theory Comput. Syst. 35(3): 321-347 ()]]>https://dblp.org/rec/journals/mst/AcarBB02Tue, 01 Jan 2002 00:00:00 +0100 Index Compression through Document Reordering.https://doi.org/10.1109/DCC.2002.999972, :
Index Compression through Document Reordering. DCC : 342-351]]>https://dblp.org/rec/conf/dcc/BlandfordB02Tue, 01 Jan 2002 00:00:00 +0100 Adaptive functional programming.https://doi.org/10.1145/503272.503296, , :
Adaptive functional programming. POPL : 247-259]]>https://dblp.org/rec/conf/popl/AcarBH02Tue, 01 Jan 2002 00:00:00 +0100 Persistent triangulations Journal of Functional Programming.https://doi.org/10.1017/S0956796801004087, , , , , :
Persistent triangulations Journal of Functional Programming. J. Funct. Program. 11(5): 441-466 ()]]>https://dblp.org/rec/journals/jfp/BlellochBCHMW01Mon, 01 Jan 2001 00:00:00 +0100 Automatic Generation of Staged Geometric Predicates.https://doi.org/10.1145/507635.507662, , :
Automatic Generation of Staged Geometric Predicates. ICFP : 217-228]]>https://dblp.org/rec/conf/icfp/NanevskiBH01Mon, 01 Jan 2001 00:00:00 +0100 A Parallel, Real-Time Garbage Collector.https://doi.org/10.1145/378795.378823, :
A Parallel, Real-Time Garbage Collector. PLDI : 125-136]]>https://dblp.org/rec/conf/pldi/ChengB01Mon, 01 Jan 2001 00:00:00 +0100 Room synchronizations.https://doi.org/10.1145/378580.378605, , :
Room synchronizations. SPAA : 122-133]]>https://dblp.org/rec/conf/spaa/BlellochCG01Mon, 01 Jan 2001 00:00:00 +0100 A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces.https://doi.org/10.1109/SC.2000.10045, , , , , :
A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces. SC : 26]]>https://dblp.org/rec/conf/sc/AntakiBGMMW00Sat, 01 Jan 2000 00:00:00 +0100 The data locality of work stealing.https://doi.org/10.1145/341800.341801, , :
The data locality of work stealing. SPAA : 1-12]]>https://dblp.org/rec/conf/spaa/AcarBB00Sat, 01 Jan 2000 00:00:00 +0100 Design and Implementation of a Practical Parallel Delaunay Algorithm.https://doi.org/10.1007/PL00008262, , , :
Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica 24(3-4): 243-269 ()]]>https://dblp.org/rec/journals/algorithmica/BlellochMHT99Fri, 01 Jan 1999 00:00:00 +0100 Provably Efficient Scheduling for Languages with Fine-Grained Parallelism.https://doi.org/10.1145/301970.301974, , :
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. J. ACM 46(2): 281-321 ()]]>https://dblp.org/rec/journals/jacm/BlellochGM99Fri, 01 Jan 1999 00:00:00 +0100 Pipelining with Futures.https://doi.org/10.1007/s002240000117, :
Pipelining with Futures. Theory Comput. Syst. 32(3): 213-239 ()]]>https://dblp.org/rec/journals/mst/BlellochR99Fri, 01 Jan 1999 00:00:00 +0100 Space-Efficient Scheduling of Nested Parallelism.https://doi.org/10.1145/314602.314607, :
Space-Efficient Scheduling of Nested Parallelism. ACM Trans. Program. Lang. Syst. 21(1): 138-173 ()]]>https://dblp.org/rec/journals/toplas/NarlikarB99Fri, 01 Jan 1999 00:00:00 +0100 A Provably Time-Efficient Parallel Implementation of Full Speculation.https://doi.org/10.1145/316686.316690, :
A Provably Time-Efficient Parallel Implementation of Full Speculation. ACM Trans. Program. Lang. Syst. 21(2): 240-285 ()]]>https://dblp.org/rec/journals/toplas/GreinerB99Fri, 01 Jan 1999 00:00:00 +0100 On Bounding Time and Space for Multiprocessor Garbage Collection.https://doi.org/10.1145/301618.301648, :
On Bounding Time and Space for Multiprocessor Garbage Collection. PLDI : 104-117]]>https://dblp.org/rec/conf/pldi/BlellochC99Fri, 01 Jan 1999 00:00:00 +0100 On bounding time and space for multiprocessor garbage collection (with retrospective).https://doi.org/10.1145/989393.989456, :
On bounding time and space for multiprocessor garbage collection (with retrospective). Best of PLDI : 626-641]]>https://dblp.org/rec/conf/pldi/BlellochC99aFri, 01 Jan 1999 00:00:00 +0100 Parallel Algorithms.https://doi.org/10.1201/9781420049503-c48, :
Parallel Algorithms. Algorithms and Theory of Computation Handbook ]]>https://dblp.org/rec/books/crc/99/BlellochM99Fri, 01 Jan 1999 00:00:00 +0100 An Experimental Analysis of Parallel Sorting Algorithms.https://doi.org/10.1007/s002240000083, :
An Experimental Analysis of Parallel Sorting Algorithms. Theory Comput. Syst. 31(2): 135-167 ()]]>https://dblp.org/rec/journals/mst/BlellochL98Thu, 01 Jan 1998 00:00:00 +0100 Pthreads for Dynamic and Irregular Parallelism.https://doi.org/10.1109/SC.1998.10005, :
Pthreads for Dynamic and Irregular Parallelism. SC : 31]]>https://dblp.org/rec/conf/sc/NarlikarB98Thu, 01 Jan 1998 00:00:00 +0100 Fast Set Operations Using Treaps.https://doi.org/10.1145/277651.277660, :
Fast Set Operations Using Treaps. SPAA : 16-26]]>https://dblp.org/rec/conf/spaa/BlellochR98Thu, 01 Jan 1998 00:00:00 +0100 Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors.https://doi.org/10.1109/71.615440, , , :
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. IEEE Trans. Parallel Distributed Syst. 8(9): 943-958 ()]]>https://dblp.org/rec/journals/tpds/BlellochGMZ97Wed, 01 Jan 1997 00:00:00 +0100 Space-Efficient Implementation of Nested Parallelism.https://doi.org/10.1145/263764.263770, :
Space-Efficient Implementation of Nested Parallelism. PPoPP : 25-36]]>https://dblp.org/rec/conf/ppopp/NarlikarB97Wed, 01 Jan 1997 00:00:00 +0100 Space-Efficient Scheduling of Parallelism with Synchronization Variables.https://doi.org/10.1145/258492.258494, , , :
Space-Efficient Scheduling of Parallelism with Synchronization Variables. SPAA : 12-23]]>https://dblp.org/rec/conf/spaa/BlellochGNM97Wed, 01 Jan 1997 00:00:00 +0100 Pipelining with Futures.https://doi.org/10.1145/258492.258517, :
Pipelining with Futures. SPAA : 249-259]]>https://dblp.org/rec/conf/spaa/BlellochR97Wed, 01 Jan 1997 00:00:00 +0100 Parallel Algorithms.https://dblp.org/pid/b/GEBlelloch.html, :
Parallel Algorithms. The Computer Science and Engineering Handbook : 277-315]]>https://dblp.org/rec/books/crc/tucker97/BlellochM97Wed, 01 Jan 1997 00:00:00 +0100 Programming Parallel Algorithms.https://doi.org/10.1145/227234.227246:
Programming Parallel Algorithms. Commun. ACM 39(3): 85-97 ()]]>https://dblp.org/rec/journals/cacm/Blelloch96Mon, 01 Jan 1996 00:00:00 +0100 A Comparison of Sorting Algorithms for the Connection Machine CM-2.https://dblp.org/pid/b/GEBlelloch.html, , , , , :
A Comparison of Sorting Algorithms for the Connection Machine CM-2. Commun. ACM 39(12es): 273-297 ()]]>https://dblp.org/rec/journals/cacm/BlellochLMPSZ96Mon, 01 Jan 1996 00:00:00 +0100 Parallel Algorithms.https://doi.org/10.1145/234313.234339, :
Parallel Algorithms. ACM Comput. Surv. 28(1): 51-54 ()]]>https://dblp.org/rec/journals/csur/BlellochM96Mon, 01 Jan 1996 00:00:00 +0100 Developing a Practical Projection-Based Parallel Delaunay Algorithm.https://doi.org/10.1145/237218.237357, , :
Developing a Practical Projection-Based Parallel Delaunay Algorithm. SCG : 186-195]]>https://dblp.org/rec/conf/compgeom/BlellochMT96Mon, 01 Jan 1996 00:00:00 +0100 A Provable Time and Space Efficient Implementation of NESL.https://doi.org/10.1145/232627.232650, :
A Provable Time and Space Efficient Implementation of NESL. ICFP : 213-225]]>https://dblp.org/rec/conf/icfp/BlellochG96Mon, 01 Jan 1996 00:00:00 +0100 A Provably Time-Efficient Parallel Implementation of Full Speculation.https://doi.org/10.1145/237721.237797, :
A Provably Time-Efficient Parallel Implementation of Full Speculation. POPL : 309-321]]>https://dblp.org/rec/conf/popl/GreinerB96Mon, 01 Jan 1996 00:00:00 +0100 Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, Padua, Italy, June 24-26, 1996.https://doi.org/10.1145/237502:
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, Padua, Italy, June 24-26, 1996. ACM , ISBN 0-89791-809-6 [contents]]]>https://dblp.org/rec/conf/spaa/1996Mon, 01 Jan 1996 00:00:00 +0100 Solving Linear Recurrences with Loop Raking.https://doi.org/10.1006/jpdc.1995.1031, , :
Solving Linear Recurrences with Loop Raking. J. Parallel Distributed Comput. 25(1): 91-97 ()]]>https://dblp.org/rec/journals/jpdc/BlellochCZ95Sun, 01 Jan 1995 00:00:00 +0100 Parallelism in Sequential Functional Languages.https://doi.org/10.1145/224164.224210, :
Parallelism in Sequential Functional Languages. FPCA : 226-237]]>https://dblp.org/rec/conf/fpca/BlellochG95Sun, 01 Jan 1995 00:00:00 +0100 Provably Efficient Scheduling for Languages with Fine-Grained Parallelism.https://doi.org/10.1145/215399.215403, , :
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. SPAA : 1-12]]>https://dblp.org/rec/conf/spaa/BlellochGM95Sun, 01 Jan 1995 00:00:00 +0100 Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors.https://doi.org/10.1145/215399.215425, , , :
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. SPAA : 84-94]]>https://dblp.org/rec/conf/spaa/BlellochGMZ95Sun, 01 Jan 1995 00:00:00 +0100 Parallel Solutions to Geometric Problems in the Scan Model of Computation.https://doi.org/10.1016/S0022-0000(05)80023-6, :
Parallel Solutions to Geometric Problems in the Scan Model of Computation. J. Comput. Syst. Sci. 48(1): 90-115 ()]]>https://dblp.org/rec/journals/jcss/BlellochL94Sat, 01 Jan 1994 00:00:00 +0100 Implementation of a Portable Nested Data-Parallel Language.https://doi.org/10.1006/jpdc.1994.1038, , , , :
Implementation of a Portable Nested Data-Parallel Language. J. Parallel Distributed Comput. 21(1): 4-14 ()]]>https://dblp.org/rec/journals/jpdc/BlellochHSZC94Sat, 01 Jan 1994 00:00:00 +0100 A practical comparison of N-body algorithms.https://doi.org/10.1090/dimacs/030/06, :
A practical comparison of N-body algorithms. Parallel Algorithms : 81-96]]>https://dblp.org/rec/conf/dimacs/BlellochN94Sat, 01 Jan 1994 00:00:00 +0100 Specification of Parallel Algorithms, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 9-11, 1994.https://doi.org/10.1090/dimacs/018, , :
Specification of Parallel Algorithms, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 9-11, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 18, DIMACS/AMS , ISBN 978-0-8218-0253-3 [contents]]]>https://dblp.org/rec/conf/dimacs/dimacs18Sat, 01 Jan 1994 00:00:00 +0100 Implementation of a Portable Nested Data-Parallel Language.https://doi.org/10.1145/155332.155343, , , , :
Implementation of a Portable Nested Data-Parallel Language. PPoPP : 102-111]]>https://dblp.org/rec/conf/ppopp/BlellochCHSZ93Fri, 01 Jan 1993 00:00:00 +0100 Solving Linear Recurrences with Loop Raking.https://doi.org/10.1109/IPPS.1992.223009, , :
Solving Linear Recurrences with Loop Raking. IPPS : 416-424]]>https://dblp.org/rec/conf/ipps/BlellochCZ92Wed, 01 Jan 1992 00:00:00 +0100 Collection-oriented languages.https://doi.org/10.1109/5.92044, :
Collection-oriented languages. Proc. IEEE 79(4): 504-523 ()]]>https://dblp.org/rec/journals/pieee/SipelsteinB91Tue, 01 Jan 1991 00:00:00 +0100 Size and Access Inference for Data-Parallel Programs.https://doi.org/10.1145/113445.113457, , :
Size and Access Inference for Data-Parallel Programs. PLDI : 130-144]]>https://dblp.org/rec/conf/pldi/ChatterjeeBF91Tue, 01 Jan 1991 00:00:00 +0100 Radix sort for vector multiprocessors.https://doi.org/10.1145/125826.126164, :
Radix sort for vector multiprocessors. SC : 712-721]]>https://dblp.org/rec/conf/sc/ZaghaB91Tue, 01 Jan 1991 00:00:00 +0100 A Comparison of Sorting Algorithms for the Connection Machine CM-2.https://doi.org/10.1145/113379.113380, , , , , :
A Comparison of Sorting Algorithms for the Connection Machine CM-2. SPAA : 3-16]]>https://dblp.org/rec/conf/spaa/BlellochLMPSZ91Tue, 01 Jan 1991 00:00:00 +0100 Vector Models for Data-Parallel Computing.https://dblp.org/pid/b/GEBlelloch.html:
Vector Models for Data-Parallel Computing. MIT Press , ISBN 0-262-02313-X]]>https://dblp.org/rec/books/mit/Blelloch90Mon, 01 Jan 1990 00:00:00 +0100 Compiling Collection-Oriented Languages onto Massively Parallel Computers.https://doi.org/10.1016/0743-7315(90)90087-6, :
Compiling Collection-Oriented Languages onto Massively Parallel Computers. J. Parallel Distributed Comput. 8(2): 119-134 ()]]>https://dblp.org/rec/journals/jpdc/BlellochS90Mon, 01 Jan 1990 00:00:00 +0100 Scan primitives for vector computers.https://doi.org/10.1109/SUPERC.1990.130084, , :
Scan primitives for vector computers. SC : 666-675]]>https://dblp.org/rec/conf/sc/ChatterjeeBZ90Mon, 01 Jan 1990 00:00:00 +0100 Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine.https://doi.org/10.1109/34.21793, , :
Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine. IEEE Trans. Pattern Anal. Mach. Intell. 11(3): 244-257 ()]]>https://dblp.org/rec/journals/pami/LittleBC89Sun, 01 Jan 1989 00:00:00 +0100 Scans as Primitive Parallel Operations.https://doi.org/10.1109/12.42122:
Scans as Primitive Parallel Operations. IEEE Trans. Computers 38(11): 1526-1538 ()]]>https://dblp.org/rec/journals/tc/Blelloch89Sun, 01 Jan 1989 00:00:00 +0100 Four Vector-Matrix Primitives.https://doi.org/10.1145/72935.72966, , , :
Four Vector-Matrix Primitives. SPAA : 292-302]]>https://dblp.org/rec/conf/spaa/AgrawalBKP89Sun, 01 Jan 1989 00:00:00 +0100 Scans as Primitive Parallel Operations.https://dblp.org/pid/b/GEBlelloch.html:
Scans as Primitive Parallel Operations. ICPP : 355-362]]>https://dblp.org/rec/conf/icpp/Blelloch87Thu, 01 Jan 1987 00:00:00 +0100 Network Learning on the Connection Machine.http://ijcai.org/Proceedings/87-1/Papers/066.pdf, :
Network Learning on the Connection Machine. IJCAI : 323-326]]>https://dblp.org/rec/conf/ijcai/BlellochR87Thu, 01 Jan 1987 00:00:00 +0100 CIS: A Massively Concurrent Rule-Based System.http://www.aaai.org/Library/AAAI/1986/aaai86-123.php:
CIS: A Massively Concurrent Rule-Based System. AAAI : 735-741]]>https://dblp.org/rec/conf/aaai/Blelloch86Wed, 01 Jan 1986 00:00:00 +0100