Pages that link to "Item:Q3210181"
From MaRDI portal
The following pages link to A general Sequential Time-Space Tradeoff for Finding Unique Elements (Q3210181):
Displaying 27 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- On the time-space tradeoff for sorting with linear queries (Q799115) (← links)
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- Runtime analysis of the \((1+1)\) EA on computing unique input output sequences (Q903582) (← links)
- Choice-memory tradeoff in allocations (Q990388) (← links)
- A simple proof of a time-space trade-off for sorting with linear comparisons (Q1079376) (← links)
- Two time-space tradeoffs for element distinctness (Q1095660) (← links)
- Time-space tradeoffs for set operations (Q1210542) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- Determinism versus nondeterminism for linear time RAMs with memory restrictions (Q1869934) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Finding median in read-only memory on integer input (Q2342680) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Priority Queues and Sorting for Read-Only Data (Q4922111) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)
- Time-space tradeoffs for SAT on nonuniform machines (Q5956015) (← links)
