The following pages link to Information Processing Letters (Q63092):
Displaying 50 items.
- A new distributed Depth-First-Search algorithm (Q63094) (← links)
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- A note on graph proper total colorings with many distinguishing constraints (Q264189) (← links)
- Acyclically 4-colorable triangulations (Q264190) (← links)
- Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system (Q264193) (← links)
- On the security of two identity-based signature schemes based on pairings (Q264198) (← links)
- A randomized algorithm for long directed cycle (Q264199) (← links)
- Existence of home states in Petri nets is decidable (Q264201) (← links)
- Black-box complexity: advantages of memory usage (Q264203) (← links)
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- On the complexity of exchanging (Q264207) (← links)
- A note on the size of prenex normal forms (Q269710) (← links)
- Simultaneous image fusion and demosaicing via compressive sensing (Q269715) (← links)
- Improved neural dynamics for online Sylvester equations solving (Q269716) (← links)
- Locally exchanged twisted cubes: connectivity and super connectivity (Q269721) (← links)
- Static analysis of navigational XPath over graph databases (Q269725) (← links)
- Testing whether the uniform distribution is a stationary distribution (Q269729) (← links)
- MMH* with arbitrary modulus is always almost-universal (Q269733) (← links)
- Enumeration of balanced finite group valued functions on directed graphs (Q269737) (← links)
- Scalable generation of scale-free graphs (Q269740) (← links)
- Cryptanalysis of a CP-ABE scheme with policy in normal forms (Q269743) (← links)
- Efficient multi-party concurrent signature from lattices (Q280930) (← links)
- Faster algorithms for single machine scheduling with release dates and rejection (Q280934) (← links)
- Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems (Q280937) (← links)
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- On purely tree-colorable planar graphs (Q280945) (← links)
- Correlation lower bounds from correlation upper bounds (Q280948) (← links)
- (EC)DSA lattice attacks based on Coppersmith's method (Q280950) (← links)
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
- Computing Roman domatic number of graphs (Q284340) (← links)
- Improved balanced flow computation using parametric flow (Q284342) (← links)
- Topological orderings of weighted directed acyclic graphs (Q284347) (← links)
- Finding a chain graph in a bipartite permutation graph (Q284350) (← links)
- The \(g\)-good-neighbor conditional diagnosability of \(n\)-dimensional hypercubes under the MM* model (Q284352) (← links)
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- Hamiltonian decomposition of generalized recursive circulant graphs (Q284357) (← links)
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Two shortest path metrics on well-formed parentheses strings (Q286951) (← links)
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
- Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
- Combinatorial lower bounds for secret sharing schemes (Q286957) (← links)
- Partial evaluation of queries for bit-sliced signature files (Q286960) (← links)
- Construction of natural cycletrees (Q286963) (← links)
- Erratum to ``Nondominated \(k\)-coteries for multiple mutual exclusion'' (Q286966) (← links)
- Zero testing of algebraic functions (Q286968) (← links)
- One unary function says less than two in existential second order logic (Q286970) (← links)
- A coloring problem for weighted graphs (Q286971) (← links)
