The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A note on asynchronous multi-exponentiation algorithm using binary representation (Q456161) (← links)
- A result on linear coloring of planar graphs (Q456164) (← links)
- An efficient IND-CCA2 secure Paillier-based cryptosystem (Q456166) (← links)
- Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- \(H\)-colorings of dense hypergraphs (Q456171) (← links)
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities (Q456174) (← links)
- An improved approximation algorithm for the clustered traveling salesman problem (Q456175) (← links)
- An improved analysis of SRPT scheduling algorithm on the basis of functional optimization (Q456176) (← links)
- Information measures based on fractional calculus (Q456178) (← links)
- Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm (Q456181) (← links)
- Parity games on undirected graphs (Q456183) (← links)
- On multiple-instance learning of halfspaces (Q456186) (← links)
- Some algorithmic results for [2]-sumset covers (Q458372) (← links)
- Continuous-time orbit problems are decidable in polynomial-time (Q458374) (← links)
- On the existence of translations of structured specifications (Q458375) (← links)
- On disjoint maximal independent sets in graphs (Q458376) (← links)
- On the family of critical section problems (Q458377) (← links)
- Scheduling a variable maintenance and linear deteriorating jobs on a single machine (Q458380) (← links)
- A note on quantum related-key attacks (Q458382) (← links)
- On triangulation axes of polygons (Q458384) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Notes on inverse bin-packing problems (Q458387) (← links)
- Tree edit distance and maximum agreement subtree (Q458389) (← links)
- Eliminability of cut in hypersequent calculi for some modal logics of linear frames (Q477584) (← links)
- Detecting monomials with \(k\) distinct variables (Q477587) (← links)
- Completeness of context-sensitive rewriting (Q477588) (← links)
- A note on envy-free cake cutting with polynomial valuations (Q477590) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q477594) (← links)
- The Hamiltonicity of generalized honeycomb torus networks (Q477596) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- The termination of the higher-dimensional tarai functions (Q477602) (← links)
- An ID-based signcryption scheme with compartmented secret sharing for unsigncryption (Q477604) (← links)
- Circulant graphs and GCD and LCM of subsets (Q477605) (← links)
- A note on nonexistence of vectorial bent functions with binomial trace representation in the \(\mathcal{PS}^-\) class (Q477607) (← links)
- On hypercube packings, blocking sets and a covering problem (Q477608) (← links)
- The pessimistic diagnosability of alternating group graphs under the PMC model (Q477609) (← links)
- Reachability problems for Markov chains (Q477610) (← links)
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
- Minimax regret 1-sink location problem in dynamic cycle networks (Q477612) (← links)
- An approximation algorithm for the cutting-sticks problem (Q477614) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- Greedily computing associative aggregations on sliding windows (Q477620) (← links)
- Arbitrary sequence RAMs (Q477622) (← links)
- Topological additive numbering of directed acyclic graphs (Q477623) (← links)
- Routing and wavelength assignment for exchanged hypercubes in linear array optical networks (Q477625) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
