The following pages link to title (P159):
Displaying 50 items.
- On building the transitive reduction of a two-dimensional poset (Q287116) (← links)
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- A simple approach for generating RSA keys (Q287121) (← links)
- On the impact of sense of direction on message complexity (Q287123) (← links)
- A permanent formula with many zero-valued terms (Q287124) (← links)
- More information theoretical inequalities to be used in secret sharing? (Q287126) (← links)
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
- A fast algorithm for stereo matching (Q287131) (← links)
- An approximation algorithm for maximum packing of 3-edge paths (Q287133) (← links)
- Partitions with minimum entropy of regions in \(\mathbb R^{2}\) (Q287135) (← links)
- Dynamic maintenance of majority information in constant time per update (Q287138) (← links)
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- Impossibility results for weak threshold networks (Q287142) (← links)
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- 3D straight-line grid drawing of 4-colorable graphs (Q287145) (← links)
- Bounded fan-out \(m\)-center problem (Q287146) (← links)
- The bit complexity of the predecessor problem (Q287147) (← links)
- Performance bounds for modeling NUMA architectures (Q287149) (← links)
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors (Q287150) (← links)
- On embedding rectangular meshes into rectangular meshes of smaller aspect ratio (Q287153) (← links)
- On universal learning algorithms (Q287154) (← links)
- Finite automata-models for the investigation of dynamical systems (Q287156) (← links)
- A nonapproximability result for finite function generation (Q287157) (← links)
- Generalized hex and logical characterizations of polynomial space (Q287159) (← links)
- A characterization of the leaf language classes (Q287160) (← links)
- Abstract derivation of transitive closure algorithms (Q287162) (← links)
- Computing OR on a randomized fixed adversary CRCW PRAM (Q287164) (← links)
- Total domination and transformation (Q287166) (← links)
- Shelf algorithms for on-line strip packing (Q287167) (← links)
- Computing strictly-second shortest paths (Q287170) (← links)
- The working set algorithm has competitive ratio less than two (Q287173) (← links)
- Updating timestamp interval for dynamic adjustment of serialization order in optimistic concurrency control-time interval (OCCTI) protocol (Q287177) (← links)
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Distributed routing in a fault-tolerant multistage interconnection network (Q287180) (← links)
- A tight bound for approximating the square root (Q287183) (← links)
- Computing a single cell in the overlay of two simple polygons (Q287185) (← links)
- I-serializability: generalized correctness for transaction-based environments (Q287187) (← links)
- On the power of a threshold gate at the top (Q287188) (← links)
- Detecting conjunctions of global predicates (Q287191) (← links)
- Logarithmic width, linear area upward drawing of AVL trees (Q287192) (← links)
- Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint (Q287196) (← links)
- Lower bounds for robust secret sharing schemes (Q287197) (← links)
- On non-smooth convex distance functions (Q287199) (← links)
- An insight on PRAM computational bounds (Q287202) (← links)
- Towards optimal two-dimensional indexing for constraint databases (Q287206) (← links)
- Billiard quorums on the grid (Q287209) (← links)
- Calculating the Hausdorff distance between curves (Q287214) (← links)
- Embedding cycles in IEH graphs (Q287217) (← links)
- Multitolerant barrier synchronization (Q287220) (← links)
