The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Finding pattern matchings for permutations (Q290212) (← links)
- Scheduling chains to minimize mean flow time (Q290213) (← links)
- On learning multivariate polynomials under the uniform distribution (Q290214) (← links)
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- A note on approximating graph genus (Q290221) (← links)
- An exact analysis on expected seeks in shadowed disks (Q290223) (← links)
- Minimal sense of direction in regular networks (Q290224) (← links)
- Using OBDDs to handle dynamic constraints (Q290226) (← links)
- Dynamic connectivity in digital images (Q290227) (← links)
- A regeneration scheme for generating extensions (Q290228) (← links)
- An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231) (← links)
- A note on error-correcting codes for authentication and subliminal channels (Q290234) (← links)
- An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
- Decimal adjustment of long numbers in constant time (Q290242) (← links)
- Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity (Q290244) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- An approximation algorithm for least median of squares regression (Q290249) (← links)
- Stutter-invariant temporal properties are expressible without the next-time operator (Q290250) (← links)
- Authenticated encryption schemes with linkage between message blocks (Q290252) (← links)
- Languages represented by Boolean formulas (Q290253) (← links)
- The average sensitivity of bounded-depth circuits (Q290255) (← links)
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree (Q290256) (← links)
- Broadcast scheduling in packet radio networks by Hopfield neural networks (Q290259) (← links)
- When is a pair of matrices mortal? (Q290262) (← links)
- Optimal on-line decremental connectivity in trees (Q290266) (← links)
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- A note on the Kolmogorov data complexity and nonuniform logical definitions (Q290271) (← links)
- Bounding the attractor of an IFS (Q290272) (← links)
- Route selection with multiple metrics (Q290274) (← links)
- K-M-P string matching revisited (Q293129) (← links)
- Constructing simply recursive programs from a finite set of good examples (Q293131) (← links)
- On methods for safe introduction of operations (Q293132) (← links)
- An observation on associative one-way functions in complexity theory (Q293135) (← links)
- Checker for data structures which sort elements (Q293137) (← links)
- Improved performance of the greedy algorithm for partial cover (Q293139) (← links)
- A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems (Q293142) (← links)
- A technique for adding range restrictions to generalized searching problems (Q293144) (← links)
- An efficient finite-state machine implementation of Huffman decoders (Q293146) (← links)
- Primitive morphisms (Q293147) (← links)
- A remark on matrix rigidity (Q293150) (← links)
- Sparse dominance queries for many points in optimal time and space (Q293151) (← links)
- There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
- Minimal sense of direction and decision problems for Cayley graphs (Q293153) (← links)
- Uniform generation of a Schröder tree (Q293156) (← links)
- Separating and shattering long line segments (Q293158) (← links)
- Fast and compact dispatching for dynamic object-oriented languages (Q293160) (← links)
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- An attack on a recursive authentication protocol. A cautionary tale (Q293167) (← links)
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
