The following pages link to OpenAlex ID (P388):
Displaying 50 items.
- Coupled point results in partially ordered metric spaces without compatibility (Q286938) (← links)
- Algorithm of a new variational inclusion problem and strictly pseudononspreading mapping with application (Q286940) (← links)
- Moudafi's open question and simultaneous iterative algorithm for general split equality variational inclusion problems and general split equality optimization problems (Q286941) (← links)
- Convergence and stability of modified Ishikawa iteration sequence with errors (Q286942) (← links)
- Fixed point theorems for the functions having monotone property or comparable property in the product spaces (Q286943) (← links)
- Modified Halpern-type iterative methods for relatively nonexpansive mappings and maximal monotone operators in Banach spaces (Q286944) (← links)
- Coincidence point theorems for weak graph preserving multi-valued mapping (Q286950) (← links)
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
- Partial evaluation of queries for bit-sliced signature files (Q286960) (← links)
- Construction of natural cycletrees (Q286963) (← links)
- Zero testing of algebraic functions (Q286968) (← links)
- A coloring problem for weighted graphs (Q286971) (← links)
- An improved algorithm for intersecting convex polygons (Q286975) (← links)
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- Note on shortest and nearest lattice vectors (Q286988) (← links)
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- Black-box polynomial resultants (Q286994) (← links)
- On approximating the memory-constrained module allocation problem (Q286996) (← links)
- Improving bounds for the number of correlation immune Boolean functions (Q286999) (← links)
- Dynamic suffix tree and two-dimensional texts management (Q287000) (← links)
- Connectivity of the crossed cube (Q287002) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Distributed enumeration (Q287005) (← links)
- A new 3D representation of trivalent Cayley networks (Q287008) (← links)
- Improved linear systolic algorithms for substring statistics (Q287010) (← links)
- A faster parallel algorithm for \(k\)-connectivity (Q287014) (← links)
- Approximate center points in dense point sets (Q287016) (← links)
- A tight lower bound for top-down skew heaps (Q287017) (← links)
- On a geometric problem of zigzags. (Q287020) (← links)
- Unfold/fold transformations for disjunctive logic programs (Q287026) (← links)
- Mutex needs fairness (Q287028) (← links)
- 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters (Q287032) (← links)
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- Shared authentication token secure against replay and weak key attacks (Q287040) (← links)
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- A conference key distribution system for the star configuration based on the discrete logarithm problem (Q287059) (← links)
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- Complexity and dimension (Q287068) (← links)
- A polynomial-time algorithm for knapsack with divisible item sizes (Q287072) (← links)
- Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa (Q287075) (← links)
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- An optimal algorithm for realizing a Delaunay triangulation (Q287080) (← links)
- On the Clark-Jacob version of SPLICE/AS (Q287082) (← links)
- Compressibility and uniform complexity (Q287086) (← links)
- On decision trees for orthants (Q287088) (← links)
- A verification algorithm for inheritance hierarchies in object-oriented databases (Q287091) (← links)
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- On some factorizations of infinite words by elements of codes (Q287095) (← links)
