The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Reducing non-determinism of \(k\)-NN searching in non-ordered discrete data spaces (Q656596) (← links)
- Complexity of semi-stable and stage semantics in argumentation frameworks (Q656597) (← links)
- The cost of probabilistic agreement in oblivious robot networks (Q656601) (← links)
- Edge-fault-tolerant vertex-pancyclicity of augmented cubes (Q656602) (← links)
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
- Note on Max Lin-2 above average (Q656604) (← links)
- Single-machine scheduling with a nonlinear deterioration function (Q656605) (← links)
- Scheduling with job-dependent learning effects and multiple rate-modifying activities (Q656606) (← links)
- Embedding a long fault-free cycle in a crossed cube with more faulty nodes (Q656607) (← links)
- Two models of two-dimensional bandwidth problems (Q656608) (← links)
- Whole mirror duplication-random loss model and pattern avoiding permutations (Q656610) (← links)
- Minimum area joining of k compacted cells (Q671255) (← links)
- A comparison of sixteen quality metrics for object-oriented design (Q671258) (← links)
- Widest empty L-shaped corridor (Q671259) (← links)
- Veto is impossible in secret sharing schemes (Q671260) (← links)
- Codes, simplifying words, and open set condition (Q671261) (← links)
- Communication primitives for BSP computers (Q671264) (← links)
- Agent search in uniform b-ary trees: Multiple goals and unequal costs (Q671265) (← links)
- A simple, efficient algorithm for maximum finding on rings (Q671266) (← links)
- Assertions about past and future in Highways: Global flush broadcast and flush-vector-time (Q671268) (← links)
- A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach (Q671377) (← links)
- Parallel lossless image compression using Huffman and arithmetic coding (Q671379) (← links)
- A lower bound technique for the size of nondeterministic finite automata (Q671381) (← links)
- A space-efficient fast prime number sieve (Q671385) (← links)
- Optimal broadcasting in the back to back d-ary trees (Q671386) (← links)
- On-line longest fragment first parsing algorithm (Q671390) (← links)
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- Semantics-based transaction management for multidatabase systems (Q671398) (← links)
- Optimal parallel selection in sorted matrices (Q671400) (← links)
- Matching nuts and bolts faster (Q671403) (← links)
- Splicing systems with targets are computationally universal (Q671404) (← links)
- Denotational linear time semantics and sequential composition (Q671406) (← links)
- An efficient distributed algorithm for centering a spanning tree of a biconnected graph (Q671408) (← links)
- Sensitivity vs. block sensitivity (an average-case study) (Q671409) (← links)
- Unifying wp and wlp (Q671411) (← links)
- Literal shuffle on \(\omega\)-languages (Q671414) (← links)
- On-line versus off-line computation in dynamic text compression (Q671415) (← links)
- Inscribing a symmetric body in an ellipse (Q671595) (← links)
- Modelling causality via action dependencies in branching time semantics (Q671596) (← links)
- Hypercube permutations routable under all dimension orderings (Q671598) (← links)
- A distributed method to bound rollback lengths for fossil collection in time warp simulators (Q671600) (← links)
- Convergence of inconsistency algorithms for the pairwise comparisons (Q671602) (← links)
- The element distinctness problem on one-tape Turing machines (Q671603) (← links)
- Finding a shortest Hamiltonian path inside a simple polygon (Q671605) (← links)
- Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
- Embedding a ring in a hypercube with both faulty links and faulty nodes (Q671607) (← links)
- Hyperspherical neighbourhoods and pattern recognition using neural networks (Q671610) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- On the effect of local changes in the variable ordering of ordered decision diagrams (Q671612) (← links)
