The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Using string-rewriting for solving the word problem for finitely presented groups (Q580494) (← links)
- Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
- Auxiliary variables in partial correctness programming logics (Q582037) (← links)
- Software-controlled cache coherence protocol for multicache systems (Q582060) (← links)
- An algorithm to find polygon similarity (Q582069) (← links)
- An optimal parallel algorithm for generating combinations (Q582077) (← links)
- The average-case parallel complexity of sorting (Q582080) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
- Parallel batched planar point location on the CCC (Q582096) (← links)
- On the polynomial IO-complexity (Q582102) (← links)
- The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
- Optimal merging and sorting on the EREW PRAM (Q582111) (← links)
- A note on adaptive parallel sorting (Q582114) (← links)
- Constructing sorting networks from k-sorters (Q582119) (← links)
- Symmetric quotients and domain constructions (Q582127) (← links)
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- On computing approximate convex hulls (Q584737) (← links)
- The jogger's problem (Q593786) (← links)
- Formal correctness proofs of a nondeterministic program (Q594577) (← links)
- Space as time (Q594586) (← links)
- On the arithmetic complexity of matrix Kronecker powers (Q594594) (← links)
- On the subword complexity of m-free DOL languages (Q594602) (← links)
- Boundedness testing for unambiguous context-free grammars (Q594604) (← links)
- A linear time algorithm for the Hausdorff distance between convex polygons (Q595374) (← links)
- Embedding cryptographic trapdoors in arbitrary knapsack systems (Q595612) (← links)
- Large processors are good in VLSI chips (Q595621) (← links)
- A note concerning top down program development and restricted exit control structures (Q598794) (← links)
- A note on the pumping lemma for regular languages (Q598821) (← links)
- Reduction of page swaps on the two dimensional transforms in a paging environment (Q598825) (← links)
- A note on the complexity of approximative evaluation of polynomials (Q599498) (← links)
- Finding a homomorphism between two words is NP-complete (Q599499) (← links)
- The unsolvability of some Petri net language problems (Q599503) (← links)
- A randomized algorithm for checking equivalence of circular lists (Q599509) (← links)
- Comments on the all nearest-neighbor problem for convex polygons (Q600104) (← links)
- The complexity of symmetrizing matrices (Q600245) (← links)
- Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259) (← links)
- Approximating integer programs with positive right-hand sides (Q656570) (← links)
- On the connectivity threshold for general uniform metric spaces (Q656572) (← links)
- Query containment under bag and bag-set semantics (Q656574) (← links)
- Online coloring of hypergraphs (Q656575) (← links)
- Resource efficient implementation of \(T\)-boxes in AES on virtex-5 FPGA (Q656579) (← links)
- On toughness and fractional \((g,f,n)\)-critical graphs (Q656581) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Fault-tolerant strategies in the iterated prisoner's dilemma (Q656583) (← links)
- Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal (Q656586) (← links)
- Predictability of fixed-job priority schedulers on heterogeneous multiprocessor real-time systems (Q656587) (← links)
- Conditional diagnosability of alternating group networks (Q656588) (← links)
- A new family of nonstochastic languages (Q656590) (← links)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
