The following pages link to (Q4837112):
Displaying 18 items.
- Towards exact geometric computation (Q676577) (← links)
- Failed disk recovery in double erasure RAID arrays (Q924549) (← links)
- Sorting in linear time? (Q1273863) (← links)
- Large-scale addition of machine real numbers: Accuracy estimates (Q1349932) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- Polynomial transformations and data-independent neighborhood functions (Q1887061) (← links)
- RMR-efficient implementations of comparison primitives using read and write operations (Q1938362) (← links)
- Variable selection and sensitivity analysis using dynamic trees, with an application to computer code performance tuning (Q1951519) (← links)
- Asymptotically optimal erasure-resilient codes for large disk arrays. (Q1972905) (← links)
- High-performance implementation of discontinuous Galerkin methods with application in fluid flow (Q2230451) (← links)
- The ArchC architecture description language and tools (Q2506243) (← links)
- (Q2995450) (← links)
- On Distributed Program Specification and Synthesis in Architectures with Cycles (Q3613067) (← links)
- (Q4201891) (← links)
- Detecting intraday financial market states using temporal clustering (Q4554234) (← links)
- How to couple from the past using a read-once source of randomness (Q4943355) (← links)
- Sorting and searching revisted (Q5054812) (← links)
- Worst-case efficient external-memory priority queues (Q5054847) (← links)
