The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- An improved upper bound on the non-3-colourability threshold (Q293171) (← links)
- On secret sharing schemes (Q293172) (← links)
- The time complexity of updating snapshot memories (Q293175) (← links)
- On rotations in fringe-balanced binary trees (Q293176) (← links)
- Secret sets and applications (Q293178) (← links)
- The full quotient and its closure property for regular languages (Q293180) (← links)
- An improved algorithm for retrieving fuzzy information from two systems (Q293183) (← links)
- Improved solutions to the Steiner triple covering problem (Q293185) (← links)
- An active attack on protocols for server-aided RSA signature computation (Q293187) (← links)
- The complexity of scheduling starting time dependent tasks with release times (Q293188) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication (Q293191) (← links)
- Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← links)
- Comparison of signature file models with superimposed coding (Q293195) (← links)
- A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204) (← links)
- The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
- Agreement under faulty interfaces (Q293206) (← links)
- The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
- ANSV problem on BSRs (Q293212) (← links)
- Global avalanche characteristics and nonlinearity of balanced Boolean functions (Q293216) (← links)
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- Optimal 1-Hamiltonian graphs (Q293225) (← links)
- An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
- Regular expressions with nested levels of back referencing form a hierarchy (Q293228) (← links)
- Scheduling cyclic tasks with binary periods (Q293232) (← links)
- The Bandwidth Allocation Problem in the ATM network model is NP-complete (Q293234) (← links)
- On the number of spanning trees of multi-star related graphs (Q293235) (← links)
- Arbitrated unconditionally secure authentication scheme with multi-senders (Q293236) (← links)
- On the richness of the collection of subtrees in random binary search trees (Q293237) (← links)
- A polynomial time solution for labeling a rectilinear map (Q293240) (← links)
- Data sufficiency for queries on cache (Q293243) (← links)
- On learning width two branching programs (Q293246) (← links)
- Optimal availability quorum systems: theory and practice (Q293249) (← links)
- A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
- Shifts and loopless generation of \(k\)-ary trees (Q293252) (← links)
- Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study (Q293254) (← links)
- Starvation-free secure multiversion concurrency control (Q293256) (← links)
- An optimal message routing algorithm for double-loop networks (Q293257) (← links)
- Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm (Q293259) (← links)
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Pattern matching for permutations (Q293263) (← links)
- Automatic proofs and counterexamples for some ortholattice identities (Q293265) (← links)
- The medians of discrete sets (Q293267) (← links)
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- A study on interleaving versus segmentation (Q293277) (← links)
- Four-state stabilizing phase clock for unidirectional rings of odd size (Q293280) (← links)
