Showing 1 - 4 results of 4 for search 'Vasile BERINDE' Skip to content
    • About the Library
    • Rules and Regulations
    • Library Services
    • Library Hours
  • Library News
    • Digital Repository
    • Google Scholar
    • ResearchGate
    • AJoGPL
    • KURJ
    • AJLS
    • MyLOFT
    • Lexis Plus UK
    • Britannica Academic
    • Research Support Tools
    • Quick Resource Links
  • Login
Advanced
  • Author
  • Vasile BERINDE
Showing 1 - 4 results of 4 for search 'Vasile BERINDE', query time: 0.01s Refine Results
  1. 1
    ORBITELE PICARD ALE APLICAȚIILOR DE TIP LIPSCHITZIAN ȘI PUNCTELE LOR DE ACUMULARE PE SPAȚII CU DISTANȚĂ

    ORBITELE PICARD ALE APLICAȚIILOR DE TIP LIPSCHITZIAN ȘI PUNCTELE LOR DE ACUMULARE PE SPAȚII CU DISTANȚĂ by Vasile BERINDE, Mitrofan CHOBAN

    Published 2019-07-01
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    An Averaged Halpern-Type Algorithm for Solving Fixed-Point Problems and Variational Inequality Problems

    An Averaged Halpern-Type Algorithm for Solving Fixed-Point Problems and Variational Inequality Problems by Vasile Berinde, Khairul Saleh

    Published 2024-10-01
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Tripled Fixed Point Theorems for Mixed Monotone Kannan Type Contractive Mappings

    Tripled Fixed Point Theorems for Mixed Monotone Kannan Type Contractive Mappings by Marin Borcut, Mădălina Păcurar, Vasile Berinde

    Published 2014-01-01
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Fixed Points of Multivalued Nonself Almost Contractions

    Fixed Points of Multivalued Nonself Almost Contractions by Maryam A. Alghamdi, Vasile Berinde, Naseer Shahzad

    Published 2013-01-01
    Get full text
    Article
    Save to List
    Saved in:

Search Tools:

  • RSS Feed
  • Email Search

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs