The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Addendum to ``A fully parallel algorithm for residue to binary conversion'' (Q672490) (← links)
- A note on Mod and generalised Mod classes (Q672491) (← links)
- Fairness and partial order semantics (Q672492) (← links)
- 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
- Fair reconstruction of a secret (Q672497) (← links)
- On the generalized twisted cube (Q672499) (← links)
- On generalized twisted cubes (Q672501) (← links)
- Easy verification of behavioural subtyping in common cases (Q672503) (← links)
- Modulo classes and logarithmic advice (Q672652) (← links)
- Password authentication without using a password table (Q672653) (← links)
- Workload scheduling for multiple query processing (Q672655) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Resolving all deadlocks in distributed systems (Q672659) (← links)
- SIMPLE: An optimal disk system with two restricted heads (Q672661) (← links)
- A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (Q672662) (← links)
- Uniform partitioning of relations using histogram equalization framework: An efficient parallel hash-based join (Q672666) (← links)
- A robust multi-priority topology-independent transmission schedule for packet radio networks (Q672668) (← links)
- A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law (Q672725) (← links)
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727) (← links)
- A note on the commutative closure of star-free languages (Q672729) (← links)
- An on-line algorithm to optimize file layout in a dynamic environment (Q672733) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- On 2-QBF truth testing in parallel (Q672737) (← links)
- Conjunctive query containment with respect to views and constraints (Q672739) (← links)
- A lower bound for communication on the crossbar (Q672740) (← links)
- A generalization of binomial queues (Q672741) (← links)
- Representations and complete semiring morphisms (Q672829) (← links)
- The total interval number of a tree and the Hamiltonian completion number of its line graph (Q672831) (← links)
- A parallel algorithm for static program slicing (Q672833) (← links)
- Succinct iterative characterizations of primitive computable unary functions (Q672834) (← links)
- On the additive complexity of 2 \(\times 2\) matrix multiplication (Q672835) (← links)
- A simple sub-quadratic algorithm for computing the subset partial order (Q672836) (← links)
- An improvement on parallel computation of a maximal matching (Q672837) (← links)
- A division property of the Fibonacci word (Q672965) (← links)
- Subword complexity of a generalized Thue-Morse word (Q672966) (← links)
- On the performance guarantee of neural networks for NP-hard optimization problems (Q672967) (← links)
- Producing a top-down parse order with bottom-up parsing (Q672970) (← links)
- A simplified proof for a self-stabilizing protocol: A Game of Cards (Q672972) (← links)
- Trivalent Cayley graphs for interconnection networks (Q672973) (← links)
- \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials (Q672974) (← links)
- About the expressive power of CTL combinators (Q672975) (← links)
- The influence of graph structure on generalized dimension exchange (Q672977) (← links)
- A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy (Q672979) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Stabilizing phase-clocks (Q673003) (← links)
- On-the-fly analysis of distributed computations (Q673006) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- Exponential lower bounds for the tree-like Hajós calculus (Q673010) (← links)
