The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Quadratic-time algorithm for a string constrained LCS problem (Q436553) (← links)
- The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers (Q436555) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- The quantum query complexity of learning multilinear polynomials (Q436558) (← links)
- Concurrent non-malleable statistically hiding commitment (Q436560) (← links)
- Recursive sum-product algorithm for generalized outer-planar graphs (Q436564) (← links)
- On the nonnegative rank of distance matrices (Q436566) (← links)
- Efficient precomputation schemes of \(kP+lQ\) (Q436568) (← links)
- Deterministic network exploration by a single agent with Byzantine tokens (Q436569) (← links)
- A note on a maximum \(k\)-subset intersection problem (Q436571) (← links)
- On the bounds of feedback numbers of \((n,k)\)-star graphs (Q436576) (← links)
- A short note on ``Proportionate flowshops with general position-dependent processing times'' (Q436577) (← links)
- Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
- On the size of the subset partial order (Q436580) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- A novel elementary construction of matching vectors (Q436582) (← links)
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication (Q436584) (← links)
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Efficient algorithms for local ranking (Q436589) (← links)
- Erratum to ``Minimum cost flows with minimum quantities'' (Q436590) (← links)
- A self-stabilizing algorithm to maximal 2-packing with improved complexity (Q436592) (← links)
- Computing generalized ham-sandwich cuts (Q436593) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- List update with probabilistic locality of reference (Q436596) (← links)
- A \(K\)-trivial set which is not jump traceable at certain orders (Q436598) (← links)
- Optimal randomized algorithm for a generalized ski-rental with interest rate (Q436599) (← links)
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- Acyclic chromatic indices of fully subdivided graphs (Q436602) (← links)
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← links)
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata (Q436610) (← links)
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks (Q436612) (← links)
- One-round identity-based key exchange with perfect forward security (Q436613) (← links)
- Regular set of representatives for time-constrained MSC graphs (Q436617) (← links)
- Embedding a mesh of trees in the crossed cube (Q436621) (← links)
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus (Q436622) (← links)
- A lower bound on the size of resolution proofs of the Ramsey theorem (Q436623) (← links)
- An alternate proof of Statman's finite completeness theorem (Q436624) (← links)
- Fast brief practical DFA minimization (Q437674) (← links)
- Optimal strategies for the list update problem under the MRM alternative cost model (Q437676) (← links)
- Local correction of juntas (Q437678) (← links)
- Analysis of the false-positive error rate of tagged fragment marking scheme (Q437680) (← links)
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations (Q437681) (← links)
- Computing hypergraph width measures exactly (Q437685) (← links)
- Properties of enhanced mobile membranes via coloured Petri nets (Q437686) (← links)
- Parameterized Eulerian strong component arc deletion problem on tournaments (Q437687) (← links)
- Routing and wavelength assignment for 3-ary \(n\)-cube in array-based optical network (Q437690) (← links)
- On the rectangle method in proofs of robustness of tensor products (Q437691) (← links)
