A general Sequential Time-Space Tradeoff for Finding Unique Elements
From MaRDI portal
Publication:3210181
Recommendations
- A Time-Space Tradeoff for Element Distinctness
- scientific article; zbMATH DE number 3980480
- Near-Optimal Time-Space Tradeoff for Element Distinctness
- Two time-space tradeoffs for element distinctness
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Space-time trade-offs for the shortest unique substring problem
- scientific article; zbMATH DE number 2087050
- Deterministic time-space trade-offs for \(k\)-SUM
- Upper bounds for time-space trade-offs in sorting and selection
- On the space complexity of some algorithms for sequence comparison
Cited in
(31)- Extra space during initialization of succinct data structures and dynamical initializable arrays
- A Time-Space Tradeoff for Element Distinctness
- A simple proof of a time-space trade-off for sorting with linear comparisons
- Finding the Median (Obliviously) with Bounded Space
- A framework for in-place graph algorithms
- Runtime analysis of the \((1+1)\) EA on computing unique input output sequences
- Selection from read-only memory with limited workspace
- Strictly in-place algorithms for permuting and inverting permutations
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle
- Tight time-space lower bounds for finding multiple collision pairs and their applications
- Graph properties checkable in linear time in the number of vertices
- scientific article; zbMATH DE number 2119639 (Why is no real title available?)
- Priority queues and sorting for read-only data
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Time-space tradeoffs in algebraic complexity theory
- Near-Optimal Time-Space Tradeoff for Element Distinctness
- Space-efficient biconnected components and recognition of outerplanar graphs
- Determinism versus nondeterminism for linear time RAMs with memory restrictions
- Approximation in (Poly-) Logarithmic Space
- Choice-memory tradeoff in allocations
- Frameworks for designing in-place graph algorithms
- Time-space tradeoffs for SAT on nonuniform machines
- Two time-space tradeoffs for element distinctness
- Approximation in (poly-) logarithmic space
- On the time-space tradeoff for sorting with linear queries
- A survey on priority queues
- Finding median in read-only memory on integer input
- Time-space tradeoffs for set operations
- On lower bounds for read-\(k\)-times branching programs
- scientific article; zbMATH DE number 3980480 (Why is no real title available?)
- Time-space tradeoffs for branching programs
This page was built for publication: A general Sequential Time-Space Tradeoff for Finding Unique Elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210181)
