The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- 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)
- Fast correlation attacks on nonlinear filter generators (Q287225) (← links)
- Fair on-line scheduling of a dynamic set of tasks on a single resource (Q287232) (← links)
- Recognizable subsets of the two letter plactic monoid (Q287233) (← links)
- An approximate model of processor communication rings under heavy load (Q287237) (← links)
- Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238) (← links)
- Characterization of extended \(\mathrm{LR}(k)\) grammars (Q287241) (← links)
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243) (← links)
- Time bounds on synchronization in a periodic distributed system (Q287245) (← links)
- Efficient access methods for image databases (Q287248) (← links)
- Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem (Q287251) (← links)
- Formal justification of underspecification for S5 (Q287254) (← links)
- Noncommutative minimization algorithms (Q287255) (← links)
- A characterization of finitary bisimulation (Q287256) (← links)
- On improving dependency implication algorithms (Q287258) (← links)
- The computational complexity of the reliability problem on distributed systems (Q287259) (← links)
- Computing a poset from its realizer (Q287260) (← links)
- Revisiting the COUNTER algorithms for list update (Q287261) (← links)
- NP-hard sets are superterse unless NP is small (Q290182) (← links)
- Optimal parallel randomized renaming (Q290183) (← links)
- On-line algorithms for the dominating set problem (Q290186) (← links)
- Containment of butterflies in networks constructed by the line digraph operation (Q290188) (← links)
- Improvements on the accelerated integer GCD algorithm (Q290191) (← links)
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks (Q290192) (← links)
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- The average height of a node in the BANG abstract directory tree (Q290196) (← links)
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer (Q290202) (← links)
- Resolving data conflicts with multiple versions and precedence relationships in real-time databases (Q290204) (← links)
- The diameter of the cube-connected cycles (Q290207) (← links)
- Monotone real circuits are more powerful than monotone Boolean circuits (Q290209) (← links)
- Linear complexity profiles and jump complexity (Q290210) (← links)
