The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Bandwidth of chain graphs (Q293476) (← links)
- Improved lower bounds for the link length of rectilinear spanning paths in grids (Q293479) (← links)
- Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (Q294591) (← links)
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592) (← links)
- Consecutive retrieval property -- revisited (Q294594) (← links)
- Global avalanche characteristics and propagation criterion of balanced Boolean functions (Q294596) (← links)
- Labeling a rectilinear map more efficiently (Q294599) (← links)
- Evaluations of domino-free communication-induced checkpointing protocols (Q294603) (← links)
- Tight analysis of a self-approaching strategy for the online kernel-search problem (Q294606) (← links)
- A note on the Horton-Strahler number for random binary search trees (Q294608) (← links)
- Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
- On a hierarchy of languages generated by cooperating distributed grammar systems (Q294612) (← links)
- An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
- A model for \(k\)-nearest neighbor query processing cost in multidimensional data space (Q294618) (← links)
- Relative to a random oracle, P/poly is not measurable in EXP (Q294619) (← links)
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
- Comments on two group signatures (Q294622) (← links)
- On the covering of vertices for fault diagnosis in hypercubes (Q294624) (← links)
- Progress properties for empty \textsc{Unity} programs (Q294627) (← links)
- On the complexity of quality of service routing (Q294629) (← links)
- A separation of two randomness concepts (Q294630) (← links)
- A memory-efficient and fast Huffman decoding algorithm (Q294633) (← links)
- A multi-stack method for the fast generation of permutations with minimal length increasing subsequences (Q294635) (← links)
- Computing the optimal bridge between two convex polygons (Q294636) (← links)
- An application of ramp schemes to broadcast encryption (Q294638) (← links)
- Undecidability of partial order logics (Q294640) (← links)
- Stream cipher encryption of random access files (Q294641) (← links)
- Independent spanning trees of chordal rings (Q294645) (← links)
- Generating languages by a derivation procedure for elementary formal systems (Q294648) (← links)
- A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes (Q294649) (← links)
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- On detecting spatial regularity in noisy images (Q294654) (← links)
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← links)
- New results on MWT subgraphs (Q294658) (← links)
- The logic of ``initially'' and ``next'': complete axiomatization and complexity (Q294659) (← links)
- On the general classification of nonlinear filters of \(m\)-sequences (Q294660) (← links)
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662) (← links)
- A parallel approach to direct analog-to-residue conversion (Q294665) (← links)
- The self-indexed search algorithm: a bit-level approach to minimal perfect hashing (Q294669) (← links)
- Meeting times of random walks on graphs (Q294672) (← links)
- A refinement of replacement selection (Q294674) (← links)
- On a question of nearly minimal identification of functions (Q294675) (← links)
- Exploiting intra-object dependencies in parallel simulation (Q294676) (← links)
- A versatile divide and conquer technique for optimal string alignment (Q294680) (← links)
- On an algorithm of Zemlyachenko for subtree isomorphism (Q294684) (← links)
- Total-chromatic number and chromatic index of dually chordal graphs (Q294687) (← links)
- Common modulus and chosen-message attacks on public-key schemes with linear recurrence relations (Q294688) (← links)
- Linear complexity of the \(x^{2} \bmod p\) orbits (Q294691) (← links)
- Regularity of normed PA processes (Q294692) (← links)
- Assessment of data redundancy in fuzzy relational databases based on semantic inclusion degree (Q294693) (← links)
