The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A framework to animate string algorithms (Q671615) (← links)
- A note on fairness in I/O automata (Q671616) (← links)
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Algorithms for deciding the containment of polygons (Q671621) (← links)
- Parallel tree-contraction and Fibonacci numbers (Q671622) (← links)
- Negation-limited circuit complexity of symmetric functions (Q671626) (← links)
- An exercise in fault-containment: Self-stabilizing leader election (Q671627) (← links)
- Cryptanalysis of a public key system based on Diophantine equations (Q671931) (← links)
- A simpler derivation of schema hazard in genetic algorithms (Q671933) (← links)
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- An algorithm for ``Ulam's Game'' and its application to error correcting codes (Q671940) (← links)
- Minimizing elimination tree height can increase fill more than linearly (Q671941) (← links)
- An optimality proof for asynchronous recovery algorithms in distributed systems (Q672018) (← links)
- A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube (Q672019) (← links)
- Untiming timed languages (Q672021) (← links)
- Simulations between two reconfigurable mesh models (Q672023) (← links)
- Constraint preservation through loops (Q672025) (← links)
- Partitioning a planar assembly into two connected parts is NP-complete (Q672026) (← links)
- Collisionful keyed hash functions with selectable collisions (Q672028) (← links)
- Constraint satisfaction -- algorithms and complexity analysis (Q672029) (← links)
- Medians and centres of polyominoes (Q672091) (← links)
- Shortest routing in trivalent Cayley graph network (Q672093) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Seek distances in two-headed disk systems (Q672095) (← links)
- A characterization of the information content of a classification (Q672096) (← links)
- Routing on trees (Q672097) (← links)
- Multiple Quickselect -- Hoare's Find algorithm for several elements (Q672250) (← links)
- An attack on the Needham-Schroeder public-key authentication protocol (Q672251) (← links)
- A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254) (← links)
- A type soundness proof for variables in LCF ML (Q672255) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- On the security of recent protocols (Q672259) (← links)
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- Lower bounds for two call control problems (Q672266) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- The lazy z-buffer (Q672396) (← links)
- The pagenumber of the class of bandwidth-k graphs is \(k-1\) (Q672400) (← links)
- Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
- Some results on selectivity and self-reducibility (Q672402) (← links)
- A 3-valued wakeup protocol (Q672404) (← links)
- Iterative improvement of vertex covers (Q672405) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- A fast algorithm for string matching with mismatches (Q672410) (← links)
- Incremental constraint deletion in systems of linear constraints (Q672413) (← links)
- ECFSM-based probabilistic protocol verification (Q672485) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
