scientific article; zbMATH DE number 176491
From MaRDI portal
Publication:4035655
zbMATH Open0765.90042MaRDI QIDQ4035655FDOQ4035655
Authors: Jeffrey Scott Vitter 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Communication networks in operations research (90B18)
Cited In (23)
- Title not available (Why is that?)
- Merging sorted runs using large main memory
- Delegating RAM Computations
- Out-of-core computing on mesh connected computers
- Title not available (Why is that?)
- A general lower bound on the I/O-complexity of comparison-based algorithms
- Cache and I/O efficent functional algorithms
- Title not available (Why is that?)
- Efficient computation of optimal space-time performance curves for memory hierarchies
- A comparison of sequential Delaunay triangulation algorithms.
- Optimizing database architecture for the new bottleneck: memory access
- On characterizing the data access complexity of programs
- Large-scale sorting in uniform memory hierarchies
- Title not available (Why is that?)
- Strong I/O lower bounds for binomial and FFT computation graphs
- Trade-offs between communication throughput and parallel time
- Array organization in parallel memories
- The buffer tree: A new technique for optimal I/O-algorithms
- Topology B-trees and their applications
- Title not available (Why is that?)
- Extending the Hong-Kung model to memory hierarchies
- A new model for large memories
- Efficient data storage in large nanoarrays
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035655)
