default search action
Shu Tezuka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j14]Aicke Hinrichs, Friedrich Pillichshammer
, Shu Tezuka:
Tractability properties of the weighted star discrepancy of the Halton sequence. J. Comput. Appl. Math. 350: 46-54 (2019) - 2013
- [j13]Shu Tezuka:
On the discrepancy of generalized Niederreiter sequences. J. Complex. 29(3-4): 240-247 (2013)
2000 – 2009
- 2006
- [j12]Shu Tezuka, Anargyros Papageorgiou:
Exact cubature for a class of functions of maximum effective dimension. J. Complex. 22(5): 652-659 (2006) - 2005
- [j11]Shu Tezuka, Hiroki Murata, Shuji Tanaka, Shoji Yumae:
Monte Carlo grid for financial risk management. Future Gener. Comput. Syst. 21(4): 811-821 (2005) - [j10]Shu Tezuka:
On the necessity of low-effective dimension. J. Complex. 21(5): 710-721 (2005) - 2003
- [j9]Shu Tezuka, Henri Faure:
I-binomial scrambling of digital nets and sequences. J. Complex. 19(6): 744-757 (2003) - 2002
- [b1]Shu Tezuka:
Software changing Wall Street. Iwanami 2002, ISBN 978-4-00-006584-9, pp. 1-105 - 2000
- [c9]Shu Tezuka:
Discrepancy Theory and Its Application to Finance. IFIP TCS 2000: 243-256
1990 – 1999
- 1996
- [c8]Akira Tajima, Syoiti Ninomiya, Shu Tezuka:
On the Anomaly of ran1() in Monte Carlo Pricing of Financial Derivatives. WSC 1996: 360-366 - 1994
- [j8]Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige
A New Scaling Algorithm for the Maximum Mean Cut Problem. Algorithmica 11(3): 243-255 (1994) - [j7]Shu Tezuka, Takeshi Tokuyama
A Note on Polynomial Arithmetic Analogue of Halton Sequences. ACM Trans. Model. Comput. Simul. 4(3): 279-284 (1994) - 1993
- [j6]Shu Tezuka:
Polynomial Arithmetic Analogue of Halton Sequences. ACM Trans. Model. Comput. Simul. 3(2): 99-107 (1993) - [j5]Shu Tezuka, Pierre L'Ecuyer
On the Lattice Structure of the Add-With-Carry and Subtract-With-Borrow Random Number Generators. ACM Trans. Model. Comput. Simul. 3(4): 315-331 (1993) - 1992
- [c7]Shu Tezuka, Masanori Fushimi:
Fast Generation of Low Discrepancy Points Based on Fibonacci Polynomials. WSC 1992: 433-437 - [c6]Shu Tezuka, Pierre L'Ecuyer
Analysis of Add-with-Carry and Subtract-with-Borrow Generators. WSC 1992: 443-447 - 1991
- [j4]Shu Tezuka, Pierre L'Ecuyer
Efficient and Portable Combined Tausworthe Random Number Generators. ACM Trans. Model. Comput. Simul. 1(2): 99-112 (1991) - [c5]Satoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka:
A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm. Network Flows And Matching 1991: 219-245 - [c4]Shu Tezuka:
Neave effect also occurs with Tausworthe sequences. WSC 1991: 1030-1034 - 1990
- [c3]Shu Tezuka:
Lattice structure of pseudorandom sequences from shift-register generators. WSC 1990: 266-269
1980 – 1989
- 1988
- [c2]Shu Tezuka:
A New Class of Nonlinear Functions for Running-key Generators (Extended Abstract). EUROCRYPT 1988: 317-324 - 1987
- [j3]Shu Tezuka:
Walsh-Spectral Test for GFSR Pseudrorandom Numbers. Commun. ACM 30(8): 731-735 (1987) - [j2]Shu Tezuka:
On the discrepancy of GFSR pseudorandom numbers. J. ACM 34(4): 939-949 (1987) - 1984
- [c1]Yasuhiro Matsuda, Shu Tezuka, Mitsuhiko Kanoh, Masafumi Nishimura, Toyohisa Kaneko:
A method for recognizing Japanese monosyllables by using intermediate cumulative distance. ICASSP 1984: 340-343 - 1983
- [j1]Masanori Fushimi, Shu Tezuka:
The k-Distribution of Generalized Feedback Shift Register Pseudorandom Numbers. Commun. ACM 26(7): 516-523 (1983)
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-25 05:56 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: