The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- An infinite square-free co-CFL (Q761044) (← links)
- How to estimate the sizes of domains (Q761055) (← links)
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- Selection in \(X+Y\) and matrices with sorted rows and columns (Q761793) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- A note on the Kenyon-Remila strip-packing algorithm (Q763478) (← links)
- A correspondence between type checking via reduction and type checking via evaluation (Q763480) (← links)
- Online call control in cellular networks revisited (Q763482) (← links)
- Max-optimal and sum-optimal labelings of graphs (Q763483) (← links)
- Memory-restricted black-box complexity of OneMax (Q763484) (← links)
- Singleton and 2-periodic attractors of sign-definite Boolean networks (Q763485) (← links)
- A note on labeling schemes for graph connectivity (Q763487) (← links)
- Havel-Hakimi residues of unigraphs (Q763488) (← links)
- Center-based clustering under perturbation stability (Q763489) (← links)
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (Q763490) (← links)
- A comment on pure-strategy Nash equilibria in competitive diffusion games (Q763492) (← links)
- Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- A dichotomy in the complexity of consistent query answering for queries with two atoms (Q763497) (← links)
- Flipping the winner of a poset game (Q763499) (← links)
- Analysis of total average queue length in multi-hop wireless networks (Q763500) (← links)
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected (Q763501) (← links)
- Increasing the flexibility of the herding attack (Q763502) (← links)
- Zen puzzle garden is NP-complete (Q763503) (← links)
- An improved kernel size for rotation distance in binary trees (Q763531) (← links)
- A note on the Chen-Morrissey-Smart DAA scheme (Q763534) (← links)
- A vector space approach to tag cloud similarity ranking (Q763537) (← links)
- Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538) (← links)
- Randomized algorithms for online bounded bidding (Q763539) (← links)
- A note on isosceles planar graph drawing (Q763540) (← links)
- On-line two-machine job shop scheduling with time lags (Q763542) (← links)
- A new parameter for a broadcast algorithm with locally bounded Byzantine faults (Q763544) (← links)
- Integer SEC-DED codes for low power communications (Q763546) (← links)
- Planar straight-line point-set embedding of trees with partial embeddings (Q763547) (← links)
- A COTS-based approach for estimating performance and energy consumption of embedded real-time systems (Q765470) (← links)
- Fault-tolerant routing in burnt pancake graphs (Q765472) (← links)
- Deadlock-freeness of hexagonal systolic arrays (Q765473) (← links)
- Enumeration of balanced symmetric functions over \(GF(p)\) (Q765474) (← links)
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm (Q765476) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Embedding meshes/tori in faulty crossed cubes (Q765478) (← links)
- Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time (Q765479) (← links)
- On two restricted ancestors tree problems (Q765480) (← links)
- An efficient algorithm to find \(k\)-nearest neighbors in flocking behavior (Q765482) (← links)
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes (Q765483) (← links)
- Collisions for variants of the BLAKE hash function (Q765485) (← links)
- Cyclically repetition-free words on small alphabets (Q765486) (← links)
- Efficient computation of shortest absent words in a genomic sequence (Q765489) (← links)
