The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A special arrangement with minimal number of triangles (Q293374) (← links)
- An extension of the wreath product principle for finite Mazurkiewicz traces (Q293379) (← links)
- An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380) (← links)
- Online channel allocation in FDMA networks with reuse constraints (Q293383) (← links)
- Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees (Q293385) (← links)
- Random permutations on distributed, external and hierarchical memory (Q293386) (← links)
- An efficient algorithm for computing least cost paths with turn constraints (Q293389) (← links)
- Comment on ``Efficient Huffman decoding'' and ``An efficient finite-state machine implementation of Huffman decoders'' (Q293392) (← links)
- An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394) (← links)
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- VLSI layouts of complete graphs and star graphs (Q293402) (← links)
- A non-SOS operational semantics for a process algebra (Q293405) (← links)
- Some remarks on the Kronecker product of graphs (Q293407) (← links)
- A linear-time transformation of linear inequalities into conjunctive normal form (Q293409) (← links)
- Efficient algorithms for the temporal precedence problem (Q293412) (← links)
- Parallel dictionaries with local rules on AVL and brother trees (Q293415) (← links)
- A limitation of vector timestamps for reconstructing distributed computations (Q293417) (← links)
- Pseudo-average block sensitivity equals average sensitivity (Q293418) (← links)
- Efficient dynamic range searching using data replication (Q293421) (← links)
- Robust vector space secret sharing schemes (Q293422) (← links)
- On the loopless generation of binary tree sequences (Q293424) (← links)
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) (Q293426) (← links)
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- A complete axiomatization of full acyclic join dependencies (Q293431) (← links)
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs (Q293435) (← links)
- Complexity versus stability for classes of propositional formulas (Q293437) (← links)
- Invariants for the construction of a handshake register (Q293438) (← links)
- Pruned three-dimensional toroidal networks (Q293439) (← links)
- Information concepts and pairwise comparison matrices (Q293441) (← links)
- Learning conjunctions with noise under product distributions (Q293443) (← links)
- Attacks on Shamir's `RSA for paranoids' (Q293447) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- On ring embedding in hypercubes with faulty nodes and links (Q293450) (← links)
- Colored cause-effect structures (Q293452) (← links)
- How to construct efficient signcryption schemes on elliptic curves (Q293455) (← links)
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (Q293458) (← links)
- An Eades-McKay algorithm for well-formed parentheses strings (Q293461) (← links)
- Binary search with errors and variable cost queries (Q293463) (← links)
- A new algebraic algorithm to decode the ternary Golay code (Q293465) (← links)
- Simulation of PRAMs with scan primitives by unbounded fan-in circuits (Q293467) (← links)
- Computing the relative entropy between regular tree languages (Q293468) (← links)
- A simple optimal algorithm for scheduling variable-sized requests (Q293470) (← links)
- A formula for the number of spanning trees of a multi-star related graph (Q293471) (← links)
- Weak and strong one-way space complexity classes (Q293473) (← links)
- Hierarchical broadcast networks (Q293474) (← links)
- Local calculation of Voronoi diagrams (Q293475) (← links)
