Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
The input/output complexity of sorting and related problems
Communications of the ACM
A data structure for dynamic trees
Journal of Computer and System Sciences
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
An introduction to parallel algorithms
An introduction to parallel algorithms
An optimal parallel algorithm for maximal matching
Information Processing Letters
Probabilistic recurrence relations
Journal of the ACM (JACM)
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient parallel algorithms for some graph problems
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Dynamic and i/o-efficient algorithms for computational geometry and graph problems: theoretical and experimental results
Libckpt: transparent checkpointing under Unix
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The Link Database: Fast Access to Graphs of the Web
DCC '02 Proceedings of the Data Compression Conference
Preface: A brief overview of network algorithms
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Semi-external LTL Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Spectra of the Spike Flow Graphs of Recurrent Neural Networks
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Theoretical model for mesoscopic-level scale-free self-organization of functional brain networks
IEEE Transactions on Neural Networks
kNN-Borůvka-GPU: a fast and scalable MST construction from kNN graphs on GPU
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Fast and memory-efficient minimum spanning tree on the GPU
International Journal of Computational Science and Engineering
| Hi-index | 0.01 |
We present a new approach for designing external graph algorithms and use it to design simple external algorithms for computing connected components, minimum spanning trees, bottleneck minimum spanning trees, and maximal matchings in undirected graphs and multi-graphs. Our I/O bounds compete with those of previous approaches. Unlike previous approaches, ours is purely functional--without side effects--and is thus amenable to standard checkpointing and programming language optimization techniques. This is an important practical consideration for applications that may take hours to run.