default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamjan Skulj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Damjan Skulj
:
A complete characterization of normal cones and extreme points for p-boxes. Fuzzy Sets Syst. 466: 108450 (2023)- [j14]Damjan Skulj:
Application of normal cones to the computation of solutions of the nonlinear Kolmogorov backward equation. Int. J. Approx. Reason. 158: 108919 (2023) - 2022
- [j13]David Dolzan, Damjana Kokol Bukovsek, Matjaz Omladic, Damjan Skulj:
Some multivariate imprecise shock model copulas. Fuzzy Sets Syst. 428: 34-57 (2022) - [j12]Damjan Skulj:
Normal cones corresponding to credal sets of lower probabilities. Int. J. Approx. Reason. 150: 35-54 (2022) - [j11]Damjan Skulj, Ales Ziberna:
Stochastic blockmodeling of linked networks. Soc. Networks 70: 240-252 (2022) - 2020
- [j10]Matjaz Omladic, Damjan Skulj:
Constructing copulas from shock models with imprecise distributions. Int. J. Approx. Reason. 118: 27-46 (2020)
2010 – 2019
- 2019
- [j9]Damjan Skulj:
Errors bounds for finite approximations of coherent lower previsions on finite probability spaces. Int. J. Approx. Reason. 105: 98-111 (2019) - [c6]Damjan Skulj:
Extensions of Sets of Markov Operators Under Epistemic Irrelevance. ISIPTA 2019: 354-363 - 2017
- [c5]Damjan Skulj:
Errors Bounds for Finite Approximations of Coherent Lower Previsions. ISIPTA 2017: 289-300 - 2016
- [j8]Damjan Skulj:
Random walks on graphs with interval weights and precise marginals. Int. J. Approx. Reason. 73: 76-86 (2016) - 2015
- [j7]Damjan Skulj:
Efficient computation of the bounds of continuous time imprecise Markov chains. Appl. Math. Comput. 250: 165-180 (2015) - 2011
- [j6]Damjan Skulj:
The use of Markov operators to constructing generalised probabilities. Int. J. Approx. Reason. 52(9): 1392-1408 (2011) - 2010
- [j5]R. J. Crossman, Damjan Skulj:
Imprecise Markov chains with absorption. Int. J. Approx. Reason. 51(9): 1085-1099 (2010) - [c4]Damjan Skulj:
The Use of Sets of Stochastic Operators to Constructing Imprecise Probabilities. SMPS 2010: 585-592
2000 – 2009
- 2009
- [j4]Damjan Skulj:
Discrete time Markov chains with interval probabilities. Int. J. Approx. Reason. 50(8): 1314-1329 (2009) - 2008
- [j3]Damjan Skulj, Vasja Vehovar, Darko Stamfelj:
The Modelling of Manpower by Markov Chains - A Case Study of the Slovenian Armed Forces. Informatica (Slovenia) 32(3): 289-291 (2008) - 2006
- [j2]Damjan Skulj:
Jeffrey's conditioning rule in neighbourhood models. Int. J. Approx. Reason. 42(3): 192-211 (2006) - [c3]Damjan Skulj:
Finite Discrete Time Markov Chains with Interval Probabilities. SMPS 2006: 299-306 - 2005
- [j1]Damjan Skulj:
Products of capacities on separate spaces through additive measures. Fuzzy Sets Syst. 152(2): 289-301 (2005) - [c2]Damjan Skulj:
Generalized Conditioning in Neighbourhood Models. ISIPTA 2005: 322-331 - 2003
- [c1]Damjan Skulj:
Products of Capacities Derived from Additive Measures. ISIPTA 2003: 524-529
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:50 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:
