default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Reem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Yair Censor
, Rafiq Mansour, Daniel Reem:
The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets. J. Approx. Theory 301: 106045 (2024)- 2023
- [j9]Daniel Reem:
The projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs. Theor. Comput. Sci. 970: 114054 (2023) - [i13]Yair Censor, Rafiq Mansour, Daniel Reem:
The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets. CoRR abs/2304.09600 (2023) - 2022
- [j8]Yair Censor, Daniel Reem, Maroun Zaknoon:
A generalized block-iterative projection method for the common fixed point problem induced by cutters. J. Glob. Optim. 84(4): 967-987 (2022)
2010 – 2019
- 2019
- [j7]Daniel Reem, Simeon Reich, Alvaro R. De Pierro:
A Telescopic Bregmanian Proximal Gradient Method Without the Global Lipschitz Continuity Assumption. J. Optim. Theory Appl. 182(3): 851-884 (2019) - 2018
- [j6]Aviv Gibali, Karl-Heinz Küfer, Daniel Reem, Philipp Süss:
A generalized projection-based scheme for solving convex constrained optimization problems. Comput. Optim. Appl. 70(3): 737-762 (2018) - [j5]Daniel Reem:
On the Computation of Zone and Double Zone Diagrams. Discret. Comput. Geom. 59(2): 253-292 (2018) - [i12]Daniel Reem, Simeon Reich, Alvaro R. De Pierro:
Re-examination of Bregman functions and new properties of their divergences. CoRR abs/1803.00641 (2018) - [i11]Daniel Reem, Simeon Reich, Alvaro R. De Pierro:
BISTA: a Bregmanian proximal gradient method without the global Lipschitz continuity assumption. CoRR abs/1804.10273 (2018) - 2015
- [j4]Yair Censor, Daniel Reem:
Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods. Math. Program. 152(1-2): 339-380 (2015) - [i10]Daniel Reem, Alvaro R. De Pierro:
A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors. CoRR abs/1508.05631 (2015) - 2013
- [i9]Daniel Reem:
Topological properties of sets represented by an inequality involving distances. CoRR abs/1303.4733 (2013) - 2012
- [j3]Daniel Reem:
Character Analysis Using Fourier Series. Am. Math. Mon. 119(3): 245-246 (2012) - [c5]Daniel Reem:
On the Existence of a Neutral Region. ISVD 2012: 80-83 - [i8]Daniel Reem:
On the computation of zone and double zone diagrams. CoRR abs/1208.3124 (2012) - [i7]Daniel Reem:
On the existence of a neutral region. CoRR abs/1208.5045 (2012) - [i6]Daniel Reem:
The geometric stability of Voronoi diagrams in normed spaces which are not uniformly convex. CoRR abs/1212.1094 (2012) - [i5]Daniel Reem:
On the possibility of simple parallel computing of Voronoi diagrams and Delaunay graphs. CoRR abs/1212.1095 (2012) - 2011
- [c4]Daniel Reem:
The geometric stability of voronoi diagrams with respect to small changes of the sites. SCG 2011: 254-263 - [i4]Daniel Reem:
The geometric stability of Voronoi diagrams with respect to small changes of the sites. CoRR abs/1103.4125 (2011) - 2010
- [j2]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. Comput. Geom. 43(9): 713-720 (2010) - [c3]Eva Kopecká, Daniel Reem, Simeon Reich:
Existence of zone diagrams in compact subsets of uniformly convex spaces. CCCG 2010: 17-20 - [c2]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. SCG 2010: 210-215 - [i3]Eva Kopecká, Daniel Reem, Simeon Reich:
Zone diagrams in compact subsets of uniformly convex normed spaces. CoRR abs/1002.3583 (2010)
2000 – 2009
- 2009
- [c1]Daniel Reem:
An Algorithm for Computing Voronoi Diagrams of General Generators in General Normed Spaces. ISVD 2009: 144-152 - [i2]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-Sectors Exist. CoRR abs/0912.4164 (2009) - 2008
- [j1]Daniel Reem:
Problem 11352. Am. Math. Mon. 115(3): 263 (2008) - 2007
- [i1]Daniel Reem, Simeon Reich:
Zone and double zone diagrams in abstract spaces. CoRR abs/0708.2668 (2007)
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-07-20 20:33 CEST 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:
