The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A new approach for the domination problem on permutation graphs (Q750166) (← links)
- A simple algorithm for computing the smallest enclosing circle (Q750173) (← links)
- Lower bounds for rectilinear Steiner trees in bounded space (Q750175) (← links)
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- Approximating linear programming is log-space complete for P (Q750289) (← links)
- Fast computation of periodic continued fractions (Q750520) (← links)
- Topological properties of supercube (Q751236) (← links)
- A caution on universal classes of hash functions (Q751240) (← links)
- A unified algorithm for sorting on multidimensional mesh-connected processors (Q751246) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← links)
- On starvation and some related issues (Q751268) (← links)
- Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
- An oracle separating \(\oplus P\) from \(PP^{PH}\) (Q751272) (← links)
- Building heaps in parallel (Q751273) (← links)
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274) (← links)
- Server problems and resistive spaces (Q751278) (← links)
- A note on set union with arbitrary deunions (Q751279) (← links)
- On the optimality of the counter-scheme for dynamic linear lists (Q751280) (← links)
- Traversing graphs in a paging environment, BFS or DFS? (Q751281) (← links)
- The derivation of a tighter bound for top-down skew heaps (Q751283) (← links)
- Semelectivity is not sufficient (Q751288) (← links)
- The effective entropies of some extensions of context-free languages (Q751289) (← links)
- Prefix-free languages as \(\omega\)-generators (Q751290) (← links)
- SLR(k) covering for LR(k) grammars (Q751291) (← links)
- A note on the notation of recursion in process algebras (Q751295) (← links)
- An undecidable problem about rational sets and contour words of polyominoes (Q751298) (← links)
- On learning from queries and counterexamples in the presence of noise (Q751304) (← links)
- Fastest path across constrained moving rectilinear obstacles (Q751322) (← links)
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- A very simple construction of 1-writer multireader multivalued atomic variable (Q751791) (← links)
- A simple approach to implementing multiplication with small tables (Q751796) (← links)
- Probabilistic checking of associativity in algebras (Q752151) (← links)
- On the synthesis of fast algorithms for signal processing (Q753422) (← links)
- Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams (Q753493) (← links)
- An extension of Khrapchenko's theorem (Q753798) (← links)
- A note on the proof of a concurrent program (Q754631) (← links)
- On module assignment in two-processor distributed systems (Q754638) (← links)
- Two results on process logic (Q755290) (← links)
- A note on bottom-up pyramid acceptors (Q755297) (← links)
- Partial values in a tabular database model (Q755337) (← links)
- Making a fair roulette from a possibly biased coin (Q756240) (← links)
- On the nonexistence of resilient consensus protocols (Q756398) (← links)
- Semantics-directed compilation of nonlinear patterns (Q756408) (← links)
- Motion estimation based on modified Fourier spectrum (Q756447) (← links)
- List scheduling of parallel tasks (Q758191) (← links)
- A space efficient distributive sort (Q758207) (← links)
- An improved upper bound on the number of intersections between two rectangular paths (Q758223) (← links)
- On the non-compactness of the class of program schemas (Q759008) (← links)
- On the enlargement of the class of regular languages by the shuffle closure (Q760799) (← links)
- A note on Boolean matrix multiplication (Q761038) (← links)
