Lower bounds for external memory integer sorting via network coding
From MaRDI portal
Publication:5157396
Recommendations
Cites work
- A Reduction Approach to the Multiple-Unicast Conjecture in Network Coding
- A faster external memory priority queue with DecreaseKeys
- DecreaseKeys are expensive for external memory priority queues
- Deterministic sorting in O ( n log log n ) time and linear space
- How to compress interactive communication
- Network coding in undirected graphs is either very helpful or not helpful at all
- Network information flow
- On the capacity of information networks
- On the capacity of information networks
- On the capacity of multiple unicast sessions in undirected graphs
- On the cell probe complexity of dynamic membership
- Should Tables Be Sorted?
- The limits of buffering: a tight lower bound for dynamic membership in the external memory model
- Using hashing to solve the dictionary problem
This page was built for publication: Lower bounds for external memory integer sorting via network coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157396)