The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Processing a multimedia join through the method of nearest neighbor search (Q294889) (← links)
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling (Q318911) (← links)
- Clique-heavy subgraphs and pancyclicity of 2-connected graphs (Q318913) (← links)
- Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918) (← links)
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- Non-cooperative capacitated facility location games (Q318924) (← links)
- Area-universal drawings of biconnected outerplane graphs (Q344510) (← links)
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- A short note on Merlin-Arthur protocols for subset sum (Q344519) (← links)
- Merging almost sorted sequences yields a 24-sorter (Q344521) (← links)
- Good self-dual generalized quasi-cyclic codes exist (Q344524) (← links)
- Ciphertext-only attack on \(d\times d\) Hill in \(O(d 13^d)\) (Q344527) (← links)
- Optimal suffix sorting and LCP array construction for constant alphabets (Q344531) (← links)
- Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- Fully polynomial-time computation of maximum likelihood trajectories in Markov chains (Q344537) (← links)
- Periodicity in rectangular arrays (Q344541) (← links)
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543) (← links)
- Residuation for bipolar preferences in soft constraints (Q344546) (← links)
- A note on Thue games (Q344549) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Group-based collective keyword querying in road networks (Q344558) (← links)
- The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete (Q344560) (← links)
- A distributed leader election algorithm in crash-recovery and omissive systems (Q344564) (← links)
- Diagnosable evaluation of enhanced optical transpose interconnection system networks (Q344567) (← links)
- Inexact feasibility pump for mixed integer nonlinear programming (Q344569) (← links)
- Refined algorithms for hitting many intervals (Q344570) (← links)
- Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm (Q396590) (← links)
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids (Q396591) (← links)
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem (Q396599) (← links)
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
- In-place permuting and perfect shuffling using involutions (Q396603) (← links)
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions (Q396606) (← links)
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems (Q396609) (← links)
- Attacks on statistical databases: the highly noisy case (Q396611) (← links)
- Correcting noisy exponentiation black-boxes modulo a prime (Q396612) (← links)
- Eavesdropping in semiquantum key distribution protocol (Q396615) (← links)
- Biclique cryptanalysis of LBlock and TWINE (Q396619) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- Improved semi-online makespan scheduling with a reordering buffer (Q396624) (← links)
- Top-\(k\) document retrieval in optimal space (Q396625) (← links)
- A new upper bound on the parameters of quasi-symmetric designs (Q396627) (← links)
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges (Q396630) (← links)
- Cryptanalysis of GOST R hash function (Q402352) (← links)
- Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
