default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDan Gordon 0001
Person information
- affiliation: University of Haifa, Israel
Other persons with the same name
- Dan Gordon 0002
![[0000-0001-9629-1794]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9629-1794")
— NICTA, Australia - Dan Gordon 0003 — University of Toronto
- Dan Gordon 0004 — Anglia Ruskin University, Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j37]Dan Gordon:
Conjugate Gradients Acceleration of Coordinate Descent for Linear Systems. J. Sci. Comput. 96(3): 86 (2023)- 2018
- [j36]Dan Gordon:
A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates. Numer. Algorithms 77(4): 1141-1157 (2018) - 2015
- [j35]Dan Gordon, Rachel Gordon, Eli Turkel:
Compact high order schemes with gradient-direction derivatives for absorbing boundary conditions. J. Comput. Phys. 297: 295-315 (2015) - 2014
- [j34]Dan Gordon:
The Well-Connected Processor Array. IEEE Trans. Computers 63(5): 1287-1295 (2014) - 2013
- [j33]Dan Gordon, Rachel Gordon:
Robust and highly scalable parallel solution of the Helmholtz equation with large wave numbers. J. Comput. Appl. Math. 237(1): 182-196 (2013) - [j32]Eli Turkel, Dan Gordon, Rachel Gordon, Semyon Tsynkov:
Compact 2D and 3D sixth order schemes for the Helmholtz equation with variable wave number. J. Comput. Phys. 232(1): 272-287 (2013) - 2012
- [j31]Dan Gordon, Rachel Gordon:
Parallel solution of high frequency Helmholtz equations using high order finite difference schemes. Appl. Math. Comput. 218(21): 10737-10754 (2012) - 2011
- [j30]Dan Gordon:
Corner cutting with trapezoidal augmentation for area-preserving smoothing of polygons and polylines. Comput. Aided Des. 43(8): 948-956 (2011) - 2010
- [j29]Dan Gordon:
Corner cutting and augmentation: An area-preserving method for smoothing polygons and polylines. Comput. Aided Geom. Des. 27(7): 551-562 (2010) - [j28]Dan Gordon, Rachel Gordon:
Row scaling as a preconditioner for some nonsymmetric linear systems with discontinuous coefficients. J. Comput. Appl. Math. 234(12): 3480-3495 (2010) - [j27]Dan Gordon, Rachel Gordon:
CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs. Parallel Comput. 36(9): 495-515 (2010) - 2009
- [j26]Itay Cohen, Dan Gordon:
VS: A surface-based system for topological analysis, quantization and visualization of voxel data. Medical Image Anal. 13(2): 245-256 (2009) - 2008
- [j25]Nir Goldschmidt, Dan Gordon:
The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing. Comput. Geom. 41(3): 167-187 (2008) - [j24]José-Jesús Fernández, Dan Gordon, Rachel Gordon:
Efficient parallel implementation of iterative reconstruction algorithms for electron tomography. J. Parallel Distributed Comput. 68(5): 626-640 (2008) - [j23]Dan Gordon, Rachel Gordon:
CGMN Revisited: Robust and Efficient Solution of Stiff Linear Systems Derived from Elliptic Partial Differential Equations. ACM Trans. Math. Softw. 35(3): 18:1-18:27 (2008) - 2006
- [j22]Dan Gordon:
Parallel ART for image reconstruction in CT using processor arrays. Int. J. Parallel Emergent Distributed Syst. 21(5): 365-380 (2006) - 2005
- [j21]Dan Gordon, Rachel Gordon:
Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems. SIAM J. Sci. Comput. 27(3): 1092-1117 (2005) - 2002
- [j20]Dan Gordon:
The Floating Column Algorithm for Shaded, Parallel Display of Function Surfaces without Patches. IEEE Trans. Vis. Comput. Graph. 8(1): 76-91 (2002) - 2001
- [j19]Ella Barkan, Dan Gordon:
CP3: Robust, Output-sensitive Display of Convex Polyhedra in Scanline Mode. Comput. Graph. Forum 20(4): 257-269 (2001) - [j18]Yair Censor, Dan Gordon, Rachel Gordon:
Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems. Parallel Comput. 27(6): 777-808 (2001) - [j17]Yair Censor, Dan Gordon, Rachel Gordon:
BICAV: An Inherently Parallel Algorithm for Sparse Systems with Pixel-Dependent Weighting. IEEE Trans. Medical Imaging 20(10): 1050-1060 (2001) - 1999
- [j16]Ella Barkan, Dan Gordon:
The scanline principle: efficient conversion of display algorithms into scanline mode. Vis. Comput. 15(5): 249-264 (1999) - 1998
- [j15]Jon D. Genetti, Dan Gordon, G. Williams:
Adaptive Supersampling in Object Space Using Pyramidal Rays. Comput. Graph. Forum 17(1): 29-54 (1998) - 1995
- [j14]Yosi Ben-Asher, Dan Gordon, Assaf Schuster:
Efficient Self-Simulation Algorithms for Reconfigurable Arrays. J. Parallel Distributed Comput. 30(1): 1-22 (1995) - 1994
- [j13]Dan Gordon, Michael A. Peterson, R. Anthony Reynolds:
Fast polygon scan conversion with medical applications. IEEE Computer Graphics and Applications 14(6): 20-27 (1994) - 1991
- [j12]Dan Gordon, Shuhong Chen:
Front-to-back display of BSP trees. IEEE Computer Graphics and Applications 11(5): 79-85 (1991) - 1989
- [j11]Dan Gordon, Jayaram K. Udupa:
Fast surface tracking in three-dimensional binary images. Comput. Vis. Graph. Image Process. 45(2): 196-214 (1989) - 1987
- [j10]R. Anthony Reynolds, Dan Gordon, Lih-Shyang Chen:
A dynamic screen technique for shaded graphics display of slice-represented objects. Comput. Vis. Graph. Image Process. 38(3): 275-298 (1987) - [j9]Dan Gordon:
On the Computational Power of Totalistic Cellular Automata. Math. Syst. Theory 20(1): 43-52 (1987) - [j8]Dan Gordon:
Efficient Embeddings of Binary Trees in VLSI Arrays. IEEE Trans. Computers 36(9): 1009-1018 (1987) - 1986
- [j7]Dan Gordon:
Eliminating the Flag in Threaded Binary Search Trees. Inf. Process. Lett. 23(4): 209-214 (1986) - 1985
- [j6]Gideon Frieder, Dan Gordon, R. Anthony Reynolds:
Back-to-Front Display of Voxel Based Objects. IEEE Computer Graphics and Applications 5(1): 52-60 (1985) - [j5]Dan Gordon, R. Anthony Reynolds:
Image space shading of 3-dimensional objects. Comput. Vis. Graph. Image Process. 29(3): 361-376 (1985) - 1984
- [j4]Dan Gordon, Israel Koren, Gabriel M. Silberman:
Embedding Tree Stuctures in VLlSI Hexagonal Arrays. IEEE Trans. Computers 33(1): 104-107 (1984) - 1983
- [j3]Dan Gordon, Eliahu Shamir:
Computation of Recursive Functionals Using Minimal Initial Segments. Theor. Comput. Sci. 23: 305-315 (1983) - 1980
- [j2]Dan Gordon:
Minimal determining sets of locally finitely-determined functionals. Discret. Math. 29(2): 175-190 (1980) - 1979
- [j1]Dan Gordon:
Complexity Classes of Provable Recursive Functions. J. Comput. Syst. Sci. 18(3): 294-303 (1979)
Conference and Workshop Papers
- 2012
- [c4]Charles Byrne, Dan Gordon, Daniel Heilper:
Models for biomedical image reconstruction based on integral approximation methods. ISBI 2012: 70-73 - 2005
- [c3]Dan Gordon, Rawia Mansour:
A Geometric Approach to Quadratic Optimization in Computerized Tomography. Computer Graphics and Imaging 2005: 60-65 - 2004
- [c2]Itay Cohen, Dan Gordon:
The Voxel-Sweep: A Boundary-based Algorithm for Object Segmentation and Connected-Components Detection. VMV 2004: 405-411 - 1993
- [c1]Yosi Ben-Asher, Dan Gordon, Assaf Schuster:
Efficient Self Simulation Algorithms for Reconfigurable Arrays. ESA 1993: 25-36
Informal and Other Publications
- 2008
- [i1]Dan Gordon, Rachel Gordon:
Geometric scaling: a simple and effective preconditioner for linear systems with discontinuous coefficients. CoRR abs/0812.2769 (2008)
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-04-24 23:15 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:
