The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Collapse of PP with a semi-random source to BPP (Q286973) (← links)
- An improved algorithm for intersecting convex polygons (Q286975) (← links)
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- Efficient Huffman decoding (Q286977) (← links)
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
- Faithful 1-edge fault tolerant graphs (Q286987) (← links)
- Note on shortest and nearest lattice vectors (Q286988) (← links)
- Revisiting a result of Ko (Q286990) (← links)
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- Black-box polynomial resultants (Q286994) (← links)
- On approximating the memory-constrained module allocation problem (Q286996) (← links)
- Improving bounds for the number of correlation immune Boolean functions (Q286999) (← links)
- Dynamic suffix tree and two-dimensional texts management (Q287000) (← links)
- Connectivity of the crossed cube (Q287002) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Distributed enumeration (Q287005) (← links)
- Non-deterministic expressions and predicate transformers (Q287006) (← links)
- A new 3D representation of trivalent Cayley networks (Q287008) (← links)
- Improved linear systolic algorithms for substring statistics (Q287010) (← links)
- Disjoint Hamiltonian cycles in recursive circulant graphs (Q287012) (← links)
- A faster parallel algorithm for \(k\)-connectivity (Q287014) (← links)
- Approximate center points in dense point sets (Q287016) (← links)
- A tight lower bound for top-down skew heaps (Q287017) (← links)
- On a geometric problem of zigzags. (Q287020) (← links)
- Computing kernels in directed bichromatic graphs (Q287022) (← links)
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- Analysis of the Hilbert curve for representing two-dimensional space (Q287025) (← links)
- Unfold/fold transformations for disjunctive logic programs (Q287026) (← links)
- Mutex needs fairness (Q287028) (← links)
- Efficient test \& set constructions for faulty shared memory (Q287031) (← links)
- 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters (Q287032) (← links)
- Inferring uniquely terminating regular languages from positive data (Q287033) (← links)
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- Approximating optimally discrete probability distribution with \(k\)th-order dependency for combining multiple decisions (Q287037) (← links)
- Shared authentication token secure against replay and weak key attacks (Q287040) (← links)
- Area requirement of visibility representations of trees (Q287042) (← links)
- An improved deterministic algorithm for generating different many-element random samples (Q287046) (← links)
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- The strong equivalence of ET0L grammars (Q287052) (← links)
- Cancellation is exponentially powerful for computing the determinant (Q287054) (← links)
- Unification for infinite sets of equations between finite terms (Q287056) (← links)
- A conference key distribution system for the star configuration based on the discrete logarithm problem (Q287059) (← links)
- Maintaining transitive closure in first order after node-set and edge-set deletions (Q287062) (← links)
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- Complexity and dimension (Q287068) (← links)
- Average competitive ratios of on-line spanning trees (Q287071) (← links)
- A polynomial-time algorithm for knapsack with divisible item sizes (Q287072) (← links)
- Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa (Q287075) (← links)
