The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images (Q673013) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- A parallel tree difference algorithm (Q673225) (← links)
- Term rewriting and Hoare logic -- Coded rewriting (Q673226) (← links)
- NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
- Approximate triclique coloring for register allocation (Q673230) (← links)
- A grid embedding into the star graph for image analysis solutions (Q673233) (← links)
- On the security of image encryption method (Q673234) (← links)
- Square rooting by iterative multiply-additions (Q673237) (← links)
- Comment on ``Bounds on the number of functions satisfying the Strict Avalanche Criterion'' (Q673240) (← links)
- A new privacy homomorphism and applications (Q673242) (← links)
- Sorting permutations by block-interchanges (Q673336) (← links)
- A finite-difference sieve to count paths and cycles by length (Q673337) (← links)
- Hamilton cycles in Trivalent Cayley graphs (Q673339) (← links)
- Perfectly overlapped merging and sorting on a two-way linear array (Q673341) (← links)
- Scheduling on a single processor with variable speed (Q673343) (← links)
- Space-optimal hidden line elimination for rectangles (Q673345) (← links)
- Approximately satisfied properties of systems and simple language homomorphisms (Q673348) (← links)
- Formal derivation of an algorithm for distributed phase synchronization (Q673351) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- Partial functions and logics: A warning (Q673461) (← links)
- Compact embedding of binary trees into hypercubes (Q673463) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Lazy update: An efficient implementation of LRU stacks (Q673467) (← links)
- Approximately matching context-free languages (Q673469) (← links)
- An improved algorithm for computing the edit distance of run-length coded strings (Q673470) (← links)
- Weighted search in the plane (Q673472) (← links)
- On the index of positive programmed formal languages (Q673473) (← links)
- Message terminating algorithms for anonymous rings of unknown size (Q673475) (← links)
- Deriving global virtual time algorithms from conservative simulation protocols (Q673478) (← links)
- A note on construction of treaps and Cartesian trees (Q673479) (← links)
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599) (← links)
- On finding solutions for extended Horn formulas (Q673602) (← links)
- Efficient management of multiple outstanding timeouts (Q673605) (← links)
- Using synthetic perturbations and statistical screening to assay shared-memory programs (Q673609) (← links)
- Scheduling with time-dependent execution times (Q673610) (← links)
- Four types of noise in data for PAC learning (Q673611) (← links)
- Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614) (← links)
- Knapsack problems for NL (Q673615) (← links)
- Scheduling jobs with varying processing times (Q673617) (← links)
- A note on P-selective sets and closeness (Q673619) (← links)
- A new solution for Thue's problem (Q673665) (← links)
- Recognizing strict 2-threshold graphs in O(m) time (Q673666) (← links)
- A note on uniformly limited ET0L systems with unique interpretation (Q673667) (← links)
- A learning-theoretic characterization of classes of recursive functions (Q673668) (← links)
- Decoding residue codes (Q673670) (← links)
- A note on the size of a multicast tree in hypercubes (Q673671) (← links)
- Random generation of words in an algebraic language in linear binary space (Q673672) (← links)
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
