Pages that link to "Item:Q3936210"
From MaRDI portal
The following pages link to A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation (Q3936210):
Displaying 42 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- On oblivious branching programs of linear length (Q804285) (← links)
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- Incremental branching programs (Q929291) (← links)
- Choice-memory tradeoff in allocations (Q990388) (← links)
- Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer (Q1065546) (← 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)
- Upper bounds for time-space trade-offs in sorting and selection (Q1101238) (← links)
- Meanders and their applications in lower bounds arguments (Q1115606) (← links)
- A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
- Time-space tradeoffs for algebraic problems on general sequential machines (Q1176102) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- Lower bounds on the length of universal traversal sequences (Q1201151) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- The computational complexity of universal hashing (Q1208411) (← links)
- Time-space tradeoffs for set operations (Q1210542) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Bi-criteria optimization of decision trees with applications to data analysis (Q1754136) (← links)
- A general class of resource tradeoffs (Q1837531) (← links)
- Determinism versus nondeterminism for linear time RAMs with memory restrictions (Q1869934) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← 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)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Efficient simulation of synchronous systems by multi-speed systems (Q3025325) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- On time versus space III (Q3745280) (← links)
- On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? (Q4000866) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)
- Trade-offs between communication throughput and parallel time (Q5906374) (← links)
