The following pages link to title (P159):
Displaying 50 items.
- Tripled common fixed point theorems under probabilistic \(\varphi\)-contractive conditions in generalized Menger probabilistic metric spaces (Q286914) (← links)
- Common fixed point theorems for generalized multivalued contractions on cone metric spaces over a non-normal solid cone (Q286916) (← links)
- Algebraic cone metric spaces and fixed point theorems of contractive mappings (Q286919) (← links)
- Convergence analysis for the equilibrium problems with numerical results (Q286920) (← links)
- Results on \(n\)-tupled fixed points in metric spaces with uniform normal structure (Q286922) (← links)
- Strong convergence theorems for the general split variational inclusion problem in Hilbert spaces (Q286923) (← links)
- A general composite iterative method for strictly pseudocontractive mappings in Hilbert spaces (Q286924) (← links)
- Coincidence point theorems in quasi-metric spaces without assuming the mixed monotone property and consequences in \(G\)-metric spaces (Q286925) (← links)
- Fixed point theorems for contracting mappings in partial metric spaces (Q286926) (← links)
- Strong convergence of hybrid Halpern iteration for Bregman totally quasi-asymptotically nonexpansive multi-valued mappings in reflexive Banach spaces with application (Q286927) (← links)
- Some generalizations of common fixed point problems with applications (Q286928) (← links)
- Variational inequality problems over split fixed point sets of strict pseudo-nonspreading mappings and quasi-nonexpansive mappings with applications (Q286930) (← links)
- Convergence theorems for equilibrium problem and asymptotically quasi-\(\phi\)-nonexpansive mappings in the intermediate sense (Q286932) (← links)
- Coupled \(g\)-coincidence point theorems for a generalized compatible pair in complete metric spaces (Q286933) (← links)
- Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping (Q286935) (← links)
- General alternative regularization methods for nonexpansive mappings in Hilbert spaces (Q286936) (← links)
- 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)
- 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)
- Collapse of PP with a semi-random source to BPP (Q286973) (← links)
- An improved algorithm for intersecting convex polygons (Q286975) (← links)
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- Efficient Huffman decoding (Q286977) (← 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)
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
- Faithful 1-edge fault tolerant graphs (Q286987) (← links)
- Note on shortest and nearest lattice vectors (Q286988) (← links)
- Revisiting a result of Ko (Q286990) (← 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)
