Dunster proves the remaining odd-n cases of Brannan's coefficient conjecture, with a computer-assisted numerical verification on the final small parameter range.
hub
10 Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, and Lasse Wulf
17 Pith papers cite this work. Polarity classification is still indexing.
17
Pith papers citing it
hub tools
citation-role summary
dataset 2
background 1
baseline 1
citation-polarity summary
representative citing papers
Introduces three linearizable GPU concurrent queues: an adapted wait-free queue using segments, a bounded lock-free queue with wave-batched paths, and a bounded wait-free queue using 64-bit CAS operations.
Hybrid sketching saves up to 97% space on dense graphs and 15% on sparse ones by sketching dense cores and storing sparse parts exactly, with new BalloonSketch reducing sketch sizes up to 8x.
Refined SS-RRR methods with a reliable tune-free removal of spurious Ritz values improve accuracy and efficiency for computing eigenpairs of large Hermitian matrices in a target region.
AsyncSparse presents BCSR and WCSR kernels that use TMA and warp specialization to accelerate SpMM, outperforming prior libraries by 1.47-6.24x on SuiteSparse and achieving 2.66x end-to-end speedup on Qwen2.5-7B at 90% block sparsity.
A new partitioning algorithm that provably load-balances arbitrary sparse tensor algebra expressions by generalizing parallel merging to multi-operand, multi-dimensional hierarchical structures, implemented in a compiler framework.
PackSELL packs delta-encoded indices and values into single words with tunable bit allocation, delivering up to 1.63x faster FP16 SpMV and FP32-accurate performance exceeding FP16 cuSPARSE while reducing memory traffic.
Introduces Distributed Level-Blocked MPK combining RACE cache blocking with MPI, reporting substantial speedups up to 4x on 832 cores for matrix power kernels across scientific sparse matrices.
BLEST is a Tensor Core-accelerated BFS framework using BVSS representation and optimized MMA layouts that reports average speedups of 22x over GAP on real-world graphs.
SNMPBB adapts nonmonotone projected Barzilai-Borwein methods to symmetric NMF, proving convergence and demonstrating 6x speedups over SymANLS on synthetic data plus competitive or better results on real clustering benchmarks and large matrices.
A Douglas-Rachford splitting algorithm with closed-form projection computes substantially sparser symmetric generalized inverses than the Moore-Penrose pseudoinverse for sparse symmetric matrices.
ReBaHFC refines PaToH outputs with the new HyperFlowCutter flow algorithm to deliver hypergraph bipartition quality close to KaHyPar and hMETIS while running an order of magnitude faster.
Presents a scalable randomized algorithm for geometric crossing minimization, including a theoretical approximation guarantee for vertex repositioning and experimental results on graphs with up to 13,000 edges.
A GNN framework learns spectral embeddings of sparse matrices to minimize a fill-in surrogate and produces competitive reorderings versus classical graph algorithms.
Integrating RACE into Trilinos applies algebraic temporal blocking to MPK in s-step GMRES, polynomial preconditioners, and AMG, yielding up to 3x speedups on multi-core CPUs for MPK-dominated algorithms.
Rust sparse kernels match Eigen and PSBLAS performance for CSC formats but trail PETSc's blocked CSR optimizations.
PROMISE tool automates mixed-precision tuning with user-defined floating-point formats, validated on linear solvers and Rodinia benchmarks showing many variables can use lower precision safely.
citing papers explorer
-
The general Brannan coefficient conjecture II: Meijer-function approximations
Dunster proves the remaining odd-n cases of Brannan's coefficient conjecture, with a computer-assisted numerical verification on the final small parameter range.
-
Scalable Concurrent Queues for GPU
Introduces three linearizable GPU concurrent queues: an adapted wait-free queue using segments, a bounded lock-free queue with wave-batched paths, and a bounded wait-free queue using 64-bit CAS operations.
-
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
Hybrid sketching saves up to 97% space on dense graphs and 15% on sparse ones by sketching dense cores and storing sparse parts exactly, with new BalloonSketch reducing sketch sizes up to 8x.
-
A refined CJ--SS--RR method with a reliable removal approach of spurious Ritz values for the Hermitian eigenvalue problem
Refined SS-RRR methods with a reliable tune-free removal of spurious Ritz values improve accuracy and efficiency for computing eigenpairs of large Hermitian matrices in a target region.
-
AsyncSparse: Accelerating Sparse Matrix-Matrix Multiplication on Asynchronous GPU Architectures
AsyncSparse presents BCSR and WCSR kernels that use TMA and warp specialization to accelerate SpMM, outperforming prior libraries by 1.47-6.24x on SuiteSparse and achieving 2.66x end-to-end speedup on Qwen2.5-7B at 90% block sparsity.
-
Partitioning Unstructured Sparse Tensor Algebra for Load-Balanced Parallel Execution
A new partitioning algorithm that provably load-balances arbitrary sparse tensor algebra expressions by generalizing parallel merging to multi-operand, multi-dimensional hierarchical structures, implemented in a compiler framework.
-
PackSELL: A Sparse Matrix Format for Precision-Agnostic High-Performance SpMV
PackSELL packs delta-encoded indices and values into single words with tunable bit allocation, delivering up to 1.63x faster FP16 SpMV and FP32-accurate performance exceeding FP16 cuSPARSE while reducing memory traffic.
-
Cache Blocking of Distributed-Memory Parallel Matrix Power Kernels
Introduces Distributed Level-Blocked MPK combining RACE cache blocking with MPI, reporting substantial speedups up to 4x on 832 cores for matrix power kernels across scientific sparse matrices.
-
Graph Traversal on Tensor Cores: A BFS Framework for Modern GPUs
BLEST is a Tensor Core-accelerated BFS framework using BVSS representation and optimized MMA layouts that reports average speedups of 22x over GAP on real-world graphs.
-
A Nonmonotone Gradient-Based Algorithm for Symmetric Nonnegative Matrix Factorization and Graph Clustering
SNMPBB adapts nonmonotone projected Barzilai-Borwein methods to symmetric NMF, proving convergence and demonstrating 6x speedups over SymANLS on synthetic data plus competitive or better results on real clustering benchmarks and large matrices.
-
Sparse symmetric generalized inverses for sparse symmetric matrices
A Douglas-Rachford splitting algorithm with closed-form projection computes substantially sparser symmetric generalized inverses than the Moore-Penrose pseudoinverse for sparse symmetric matrices.
-
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
ReBaHFC refines PaToH outputs with the new HyperFlowCutter flow algorithm to deliver hypergraph bipartition quality close to KaHyPar and hMETIS while running an order of magnitude faster.
-
Geometric Crossing-Minimization -- A Scalable Randomized Approach
Presents a scalable randomized algorithm for geometric crossing minimization, including a theoretical approximation guarantee for vertex repositioning and experimental results on graphs with up to 13,000 edges.
-
Bridging the Gap between Sparse Matrix Reordering and Factorization: A Deep Learning Framework for Fill-in Reduction
A GNN framework learns spectral embeddings of sparse matrices to minimize a fill-in surrogate and produces competitive reorderings versus classical graph algorithms.
-
Algebraic Temporal Blocking for Sparse Iterative Solvers on Multi-Core CPUs
Integrating RACE into Trilinos applies algebraic temporal blocking to MPK in s-step GMRES, polynomial preconditioners, and AMG, yielding up to 3x speedups on multi-core CPUs for MPK-dominated algorithms.
-
Evaluating Rust for Sparse Matrix Kernels in Scientific Computing
Rust sparse kernels match Eigen and PSBLAS performance for CSC formats but trail PETSc's blocked CSR optimizations.
-
Floating-point autotuning with customized precisions
PROMISE tool automates mixed-precision tuning with user-defined floating-point formats, validated on linear solvers and Rodinia benchmarks showing many variables can use lower precision safely.