The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs (Q456059) (← links)
- A self-stabilizing algorithm for optimally efficient sets in graphs (Q456061) (← links)
- A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock (Q456064) (← links)
- Vertex angle and crossing angle resolution of leveled tree drawings (Q456065) (← links)
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068) (← links)
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity (Q456074) (← links)
- Bounding the maximum size of a minimal definitive set of quartets (Q456077) (← links)
- Lower bounds for randomized algorithms for online chain partitioning (Q456079) (← links)
- Linear threshold multisecret sharing schemes (Q456082) (← links)
- On deriving conditional diagnosability of interconnection networks (Q456083) (← links)
- A proof of a conjecture on multiset coloring the powers of cycles (Q456085) (← links)
- Recursive hiding of biometrics-based secret sharing scheme using adversary structure (Q456087) (← links)
- The minimum spanning tree problem with non-terminal set (Q456089) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- On minimal arbitrarily partitionable graphs (Q456092) (← links)
- \(\lambda^{\prime}\)-optimality of bipartite digraphs (Q456094) (← links)
- A characterization of partial blocks in weighted graphs (Q456097) (← links)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- On behavioural pseudometrics and closure ordinals (Q456100) (← links)
- On-line algorithms for 2-space bounded 2-dimensional bin packing (Q456101) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- A two stage scheduling with transportation and batching (Q456105) (← links)
- An efficient algorithm for parameterizing HsMM with Gaussian and gamma distributions (Q456106) (← links)
- A note on minimizing the sum of quadratic completion times on two identical parallel machines (Q456107) (← links)
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times (Q456108) (← links)
- Minimizing interference in ad hoc networks with bounded communication radius (Q456109) (← links)
- An ID-based cryptographic mechanisms based on GDLP and IFP (Q456110) (← links)
- Pancyclic out-arcs of a vertex in oriented graphs (Q456111) (← links)
- Batch scheduling of identical jobs on parallel identical machines (Q456112) (← links)
- The linear arboricity of planar graphs with maximum degree at least 5 (Q456114) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices (Q456117) (← links)
- HORSIC: an efficient one-time signature scheme for wireless sensor networks (Q456121) (← links)
- A multi-cycle checkpointing protocol that ensures strict 1-rollback (Q456127) (← links)
- Lossy trapdoor functions from homomorphic reproducible encryption (Q456129) (← links)
- A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (Q456131) (← links)
- Internal state recovery of keystream generator LILI-128 based on a novel weakness of the employed Boolean function (Q456133) (← links)
- On multiple output bent functions (Q456135) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Topological ordering algorithm for LDAG (Q456140) (← links)
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Single-machine scheduling with past-sequence-dependent delivery times and release times (Q456143) (← links)
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem (Q456147) (← links)
- Antimagic labeling graphs with a regular dominating subgraph (Q456149) (← links)
- Membership(s) and compliance(s) with class-based graphs (Q456151) (← links)
- Verifiable secret sharing in a total of three rounds (Q456152) (← links)
- Enhancing customer relationships by semantic consumer support systems (Q456154) (← links)
- A note on the algebraic immunity of the Maiorana-McFarland class of bent functions (Q456155) (← links)
- On the distinctness of modular reductions of primitive sequences modulo square-free odd integers (Q456158) (← links)
