default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Szántai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j12]Edith Kovács, Tamás Szántai:
On the connection between cherry-tree copulas and truncated R-vine copulas. Kybernetika 53(3): 437-460 (2017)- 2013
- [j11]Tibor Csendes, Tibor Jordán, Tamás Szántai:
Editorial. Central Eur. J. Oper. Res. 21(4): 663-664 (2013) - [c2]Tamás Szántai, Edith Kovács:
Cluster analysis by exploiting conditional independences. SACI 2013: 299-302 - [i4]Edith Kovács, Tamás Szántai:
Discovering the Markov network structure. CoRR abs/1307.0643 (2013) - 2012
- [j10]Tamás Szántai, Edith Kovács:
Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution. Ann. Oper. Res. 193(1): 71-90 (2012) - [j9]Darinka Dentcheva, Andrzej Ruszczynski, Tamás Szántai:
Stochastic modeling and optimization (in honor of András Prékopa's 80th birthday). Ann. Oper. Res. 200(1): 1-2 (2012) - [j8]Gerzson Kéri
, Tamás Szántai:
Combinatorial results on the fitting problems of the multivariate gamma distribution introduced by Prékopa and Szántai. Ann. Oper. Res. 200(1): 265-278 (2012) - [j7]József Bukszár, Gergely Mádi-Nagy, Tamás Szántai:
Computing bounds for the probability of the union of events by different methods. Ann. Oper. Res. 201(1): 63-81 (2012) - 2011
- [i3]Tamás Szántai, Edith Kovács:
Discovering a junction tree behind a Markov network by a greedy algorithm. CoRR abs/1104.2762 (2011) - [i2]Edith Kovács, Tamás Szántai:
Vine copulas as a mean for the construction of high dimensional probability distribution associated to a Markov Network. CoRR abs/1105.1697 (2011) - 2010
- [j6]Ashraf A. Gouda, Tamás Szántai:
On numerical calculation of probabilities according to Dirichlet distribution. Ann. Oper. Res. 177(1): 185-200 (2010)
2000 – 2009
- 2009
- [r1]Tamás Szántai:
Approximation of Multivariate Probability Integrals. Encyclopedia of Optimization 2009: 83-90 - 2008
- [j5]Ashraf A. Gouda, Tamás Szántai:
Rare event probabilities in stochastic networks. Central Eur. J. Oper. Res. 16(4): 441-461 (2008) - 2005
- [i1]René Henrion, Tamás Szántai:
Properties and Calculation of Singular Normal Distributions. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [c1]Ashraf A. Gouda, Davaadorjin Monhor, Tamás Szántai:
Stochastic Programming Based PERT Modeling. Coping with Uncertainty 2004: 241-255 - 2002
- [j4]József Bukszár, Tamás Szántai:
Probability bounds given by hypercherry trees. Optim. Methods Softw. 17(3): 409-422 (2002) - 2000
- [j3]Tamás Szántai:
Improved Bounds and Simulation Procedures on the Value of the Multivariate Normal Probability Distribution Function. Ann. Oper. Res. 100(1-4): 85-101 (2000) - [j2]A. Habib, Tamás Szántai:
New bounds on the reliability of the consecutive k-out-of-r-from-n: F system. Reliab. Eng. Syst. Saf. 68(2): 97-104 (2000)
1990 – 1999
- 1995
- [j1]András Bakó, Emil Klafszky, Tamás Szántai, László Gáspár:
Optimization techniques for planning highway pavement improvements. Ann. Oper. Res. 58(1): 55-66 (1995)
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 22:47 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:
