The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- Automata and forbidden words (Q293331) (← links)
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- A separation of two randomness concepts (Q294630) (← links)
- Total-chromatic number and chromatic index of dually chordal graphs (Q294687) (← links)
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Deterministic small-world communication networks (Q294854) (← links)
- Processing a multimedia join through the method of nearest neighbor search (Q294889) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Cryptanalysis of GOST R hash function (Q402352) (← links)
- Block-wise 2D kernel PCA/LDA for face recognition (Q407537) (← links)
- On the bit security of the weak Diffie-Hellman problem (Q407550) (← links)
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- A simple algorithm for computing positively weighted straight skeletons of monotone polygons (Q477646) (← links)
- Google Scholar makes it hard -- the complexity of organizing one's publications (Q495683) (← links)
- Whole mirror duplication-random loss model and pattern avoiding permutations (Q656610) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- An attack on the Needham-Schroeder public-key authentication protocol (Q672251) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274) (← links)
- A note on set union with arbitrary deunions (Q751279) (← links)
- An output sensitive algorithm for computing a maximum independent set of a circle graph (Q765500) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Scheduling independent 2-processor tasks to minimize schedule length (Q796987) (← links)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- Multiple serial episodes matching (Q844201) (← links)
- Tetravex is NP-complete (Q845713) (← links)
- Remarks on BioHash and its mathematical foundation (Q845854) (← links)
- On the longest increasing subsequence of a circular list (Q845894) (← links)
- The Ford-Johnson algorithm still unbeaten for less than 47 elements (Q845913) (← links)
- A space-efficient algorithm for finding strongly connected components (Q888958) (← links)
- A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- Efficient intensity map splitting algorithms for intensity-modulated radiation therapy (Q963365) (← links)
- Minimal proper interval completions (Q963366) (← links)
- On the efficient construction of quasi-reversible automata for reversible languages (Q963387) (← links)
- Improving multikey Quicksort for sorting strings with many equal elements (Q987791) (← links)
- New lower bounds for online \(k\)-server routing problems (Q987824) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- A set coverage problem (Q990137) (← links)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- A bandwidth latency tradeoff for broadcast and reduction (Q1007568) (← links)
- On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic (Q1007642) (← links)
- On some properties of the NML estimator for Bernoulli strings (Q1029082) (← links)
