Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurentiu Leustean
Person information
- unicode name: Laurenţiu Leuştean
- affiliation: University of Bucharest, Romania
- affiliation: Technische Universität Darmstadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Laurentiu Leustean
, Pedro Pinto:
Rates of asymptotic regularity for the alternating Halpern-Mann iteration. Optim. Lett. 18(2): 529-543 (2024)- 2023
- [j12]Horatiu Cheval, Ulrich Kohlenbach, Laurentiu Leustean:
On Modified Halpern and Tikhonov-Mann Iterations. J. Optim. Theory Appl. 197(1): 233-251 (2023) - [e1]Horatiu Cheval, Laurentiu Leustean, Andrei Sipos:
Proceedings 7th Symposium on Working Formal Methods, FROM 2023, Bucharest, Romania, 21-22 September 2023. EPTCS 389, 2023 [contents] - 2022
- [j11]Horatiu Cheval, Laurentiu Leustean:
Quadratic rates of asymptotic regularity for the Tikhonov-Mann iteration. Optim. Methods Softw. 37(6): 2225-2240 (2022) - 2021
- [j10]Laurentiu Leustean, Pedro Pinto:
Quantitative results on a Halpern-type proximal point algorithm. Comput. Optim. Appl. 79(1): 101-125 (2021) - 2020
- [j9]Jetty Kleijn, Laurentiu Leustean, Dorel Lucanu:
Preface. Fundam. Informaticae 173(2-3) (2020)
2010 – 2019
- 2018
- [j8]Laurentiu Leustean, Adriana Nicolae, Andrei Sipos:
An abstract proximal point algorithm. J. Glob. Optim. 72(3): 553-577 (2018) - 2014
- [j7]Laurentiu Leustean:
An application of proof mining to nonlinear iterations. Ann. Pure Appl. Log. 165(9): 1484-1500 (2014) - 2011
- [j6]George Georgescu, Laurentiu Leustean, Viorel Preoteasa:
Pseudo Hoops. Arch. Formal Proofs 2011 (2011)
2000 – 2009
- 2007
- [j5]Laurentiu Leustean:
Rates of Asymptotic Regularity for Halpern Iterations of Nonexpansive Mappings. J. Univers. Comput. Sci. 13(11): 1680-1691 (2007) - 2006
- [j4]Laurentiu Leustean:
Baer Extensions of BL-algebras. J. Multiple Valued Log. Soft Comput. 12(3-4): 321-336 (2006) - [c2]Laurentiu Leustean:
Proof Mining in R-trees and Hyperbolic Spaces. WoLLIC 2006: 95-106 - 2005
- [j3]George Georgescu, Laurentiu Leustean, Viorel Preoteasa:
Pseudo-hoops. J. Multiple Valued Log. Soft Comput. 11(1-2): 153-184 (2005) - [j2]Laurentiu Leustean:
Sheaf representations of BL-algebras. Soft Comput. 9(12): 897-909 (2005) - [i1]Ulrich Kohlenbach, Laurentiu Leustean:
Approximate fixed points of nonexpansive functions in product spaces. Mathematics, Algorithms, Proofs 2005 - 2003
- [j1]Antonio Di Nola, Laurentiu Leustean:
Compact representations of BL-algebras. Arch. Math. Log. 42(8): 737-761 (2003) - [c1]Grigore Rosu, Ram Prasad Venkatesan, Jon Whittle, Laurentiu Leustean:
Certifying Optimality of State Estimation Programs. CAV 2003: 301-314
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-24 02:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
