Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn H. Halton
Person information
- affiliation: University of North Carolina at Chapel Hill, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j15]Francesc Castro, Mateu Sbert
, John H. Halton:
Efficient reuse of paths for random walk radiosity. Comput. Graph. 32(1): 65-81 (2008)- [j14]John H. Halton:
Sequential Monte Carlo for linear systems - a practical summary. Monte Carlo Methods Appl. 14(1): 1-27 (2008) - [j13]John H. Halton:
Sigma-algebra theorems. Monte Carlo Methods Appl. 14(2): 171-189 (2008) - 2007
- [j12]Francesc Castro, Gustavo Patow, Mateu Sbert, John H. Halton:
Fast GPU-based reuse of paths in radiosity. Monte Carlo Methods Appl. 13(4): 253-273 (2007) - 2006
- [j11]John H. Halton:
Sequential Monte Carlo Techniques for Solving Non-Linear Systems. Monte Carlo Methods Appl. 12(2): 113-141 (2006) - 2005
- [j10]John H. Halton:
Quasi-Probability: Why quasi-Monte-Carlo methods are statistically valid and how their errors can be estimated statistically. Monte Carlo Methods Appl. 11(3): 203-350 (2005) - 2004
- [j9]John H. Halton:
An outline of quasi-probability * : Why quasi-Monte-Carlo methods are statistically valid and how their errors can be estimated statistically. Monte Carlo Methods Appl. 10(3-4): 183-196 (2004) - [j8]Mateu Sbert, Philippe Bekaert, John H. Halton:
Reusing paths in radiosity and global illumination. Monte Carlo Methods Appl. 10(3-4): 575-585 (2004) - [c2]Mateu Sbert, Francesc Castro, John H. Halton:
Reuse of Paths in Light Source Animation. Computer Graphics International 2004: 532-535 - 2002
- [c1]Philippe Bekaert, Mateu Sbert, John H. Halton:
Accelerating Path Tracing by Re-Using Paths. Rendering Techniques 2002: 125-134
1990 – 1999
- 1994
- [j7]John H. Halton:
Geometry of a Three-Camera Head-Mounted System. Inf. Sci. 77(1-2): 51-75 (1994) - 1991
- [j6]John H. Halton:
On the thickness of graphs of given degree. Inf. Sci. 54(3): 219-238 (1991)
1980 – 1989
- 1989
- [j5]John H. Halton:
The properties of random trees. Inf. Sci. 47(2): 95-133 (1989) - 1982
- [j4]J. H. Halton, Routo Terada:
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One. SIAM J. Comput. 11(1): 28-46 (1982)
1960 – 1969
- 1964
- [j3]J. H. Halton, G. B. Smith:
Algorithm 247: Radical-inverse quasi-random point sequence. Commun. ACM 7(12): 701-702 (1964)
1950 – 1959
- 1957
- [j2]J. H. Halton, D. C. Handscomb:
A Method for Increasing the Efficiency of Monte Carlo Integration. J. ACM 4(3): 329-340 (1957) - [j1]J. H. Halton, D. C. Handscomb:
Erratum: "A Method for Increasing the Efficiency of Monte Carlo Integration". J. ACM 4(4): 540 (1957)
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 2023-09-27 22:52 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:
