The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- A simple recognition of maximal planar graphs (Q1029086) (← links)
- Universal forgery on a group signature scheme using self-certified public keys (Q1029087) (← links)
- Ready, set, go! The Voronoi diagram of moving points that start from a line (Q1029088) (← links)
- A Kleene theorem for splitable signals (Q1029089) (← links)
- On the hardness of approximating label-cover (Q1029090) (← links)
- A linear-time algorithm to compute a MAD tree of an interval graph (Q1029091) (← links)
- A completed hierarchy of true concurrent equivalences (Q1029093) (← links)
- Tetris and decidability (Q1029095) (← links)
- Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
- A construction of one-point bases in extended lambda calculi (Q1029098) (← links)
- On the profile of the corona of two graphs (Q1029099) (← links)
- Modelling and verification of delay-insensitive circuits using CCS and the concurrency workbench (Q1029101) (← links)
- New lower and upper bounds for the competitive ratio of transmission protocols (Q1029102) (← links)
- The worst-case chip problem (Q1029103) (← links)
- Deterministic second-order patterns (Q1029104) (← links)
- Characterizing \(r\)-perfect codes in direct products of two and three cycles (Q1041710) (← links)
- A faster parameterized algorithm for set packing (Q1041711) (← links)
- Subtraction-free almost Montgomery inverse algorithm (Q1041714) (← links)
- Minimum-cost single-source 2-splittable flow (Q1041715) (← links)
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- A linear time algorithm for the minimum weighted feedback vertex set on diamonds (Q1041719) (← links)
- On Hamiltonian cycles and Hamiltonian paths (Q1041720) (← links)
- A generalization of the 0-1 principle for sorting (Q1041721) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- Optimization, block designs and no free lunch theorems (Q1041724) (← links)
- Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
- Event trace independence of active behavior (Q1041726) (← links)
- An elementary proof that Herman's ring is \(\Theta (N^{2})\) (Q1041727) (← links)
- Asynchronous bounded lifetime failure detectors (Q1041728) (← links)
- Complexities of some interesting problems on spanning trees (Q1041729) (← links)
- On the system of two all different\(\_\)predicates (Q1041730) (← links)
- A greedy approach to compute a minimum cycle basis of a directed graph (Q1041731) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties (Q1041733) (← links)
- A space-efficient self-stabilizing algorithm for measuring the size of ring networks (Q1041735) (← links)
- An almost-linear time and linear space algorithm for the longest common subsequence problem (Q1041737) (← links)
- A secure and scalable group key exchange system (Q1041738) (← links)
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739) (← links)
- Equality sets of prefix morphisms and regular star languages (Q1041740) (← links)
- The class of HDT0L sequences is closed with respect to rational functions (Q1041741) (← links)
- An impossibility gap between width-4 and width-5 permutation branching programs (Q1041742) (← links)
- Minimizing the number of inputs while applying adaptive test cases (Q1041743) (← links)
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744) (← links)
- \(L(2,1)\)-labeling of strong products of cycles (Q1041747) (← links)
- Super connectivity of line graphs (Q1041748) (← links)
- The Little Towers of Antwerpen problem (Q1041749) (← links)
- Strategies for peer-to-peer downloading (Q1041750) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- CPS transformation of beta-redexes (Q1041755) (← links)
