The following pages link to Recommended article (P1643):
Displaying 50 items.
- Efficient test \& set constructions for faulty shared memory (Q287031) (← links)
- 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters (Q287032) (← links)
- Inferring uniquely terminating regular languages from positive data (Q287033) (← links)
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions (Q287037) (← links)
- Shared authentication token secure against replay and weak key attacks (Q287040) (← links)
- Area requirement of visibility representations of trees (Q287042) (← links)
- An improved deterministic algorithm for generating different many-element random samples (Q287046) (← links)
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- Cancellation is exponentially powerful for computing the determinant (Q287054) (← links)
- Unification for infinite sets of equations between finite terms (Q287056) (← links)
- A conference key distribution system for the star configuration based on the discrete logarithm problem (Q287059) (← links)
- Maintaining transitive closure in first order after node-set and edge-set deletions (Q287062) (← links)
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- Complexity and dimension (Q287068) (← links)
- Average competitive ratios of on-line spanning trees (Q287071) (← links)
- A polynomial-time algorithm for knapsack with divisible item sizes (Q287072) (← links)
- Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa (Q287075) (← links)
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- Spanners of underlying graphs of iterated line digraphs (Q287078) (← links)
- An optimal algorithm for realizing a Delaunay triangulation (Q287080) (← links)
- On the Clark-Jacob version of SPLICE/AS (Q287082) (← links)
- On keys and normal forms (Q287084) (← links)
- Compressibility and uniform complexity (Q287086) (← links)
- On decision trees for orthants (Q287088) (← links)
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- On some factorizations of infinite words by elements of codes (Q287095) (← links)
- A note on optical routing on trees (Q287098) (← links)
- An improved lower bound for load balancing of tasks with unknown duration (Q287100) (← links)
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- An old sub-quadratic algorithm for finding extremal sets (Q287109) (← links)
- On computing representatives (Q287112) (← links)
- 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)
- 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)
