default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarel De Loof
2010 – 2019
- 2015
[j10]Bernard De Baets
, Karel De Loof, Hans E. De Meyer:
A frequentist view on cycle-transitivity of reciprocal relations. Fuzzy Sets Syst. 281: 198-218 (2015)- 2014
- [j9]Karel De Loof, Bernard De Baets, Hans E. De Meyer:
Cycle-free cuts of mutual rank probability relations. Kybernetika 50(5): 814-837 (2014) - 2013
- [j8]Karel De Loof, Bernard De Baets, Hans E. De Meyer:
A necessary 4-cycle condition for dice representability of reciprocal relations. 4OR 11(2): 151-170 (2013) - [j7]Jan M. Baetens, Karel De Loof, Bernard De Baets:
Influence of the topology of a cellular automaton on its dynamical properties. Commun. Nonlinear Sci. Numer. Simul. 18(3): 651-668 (2013) - 2012
- [c5]Karel De Loof, Bernard De Baets, Hans E. De Meyer:
Product Triplets in Winning Probability Relations. IPMU (4) 2012: 296-305 - 2010
- [j6]Karel De Loof, Bernard De Baets, Hans E. De Meyer:
Counting linear extension majority cycles in partially ordered sets on up to 13 elements. Comput. Math. Appl. 59(4): 1541-1547 (2010) - [j5]Bernard De Baets, Hans E. De Meyer, Karel De Loof:
On the cycle-transitivity of the mutual rank probability relation of a poset. Fuzzy Sets Syst. 161(20): 2695-2708 (2010) - [c4]Karel De Loof, Bernard De Baets, Hans E. De Meyer:
How to Avoid LEM Cycles in Mutual Rank Probability Relations. SMPS 2010: 155-163
2000 – 2009
- 2009
- [b1]Karel De Loof:
Efficient computation of rank probabilities in posets. Ghent University, Belgium, 2009 - [j4]Gunnar Brinkmann, Jan Degraer, Karel De Loof:
Rehabilitation of an unloved child: semi-splaying. Softw. Pract. Exp. 39(1): 33-45 (2009) - 2008
- [j3]Karel De Loof, Bernard De Baets, Hans E. De Meyer:
On the random generation of monotone data sets. Inf. Process. Lett. 107(6): 216-220 (2008) - [c3]Bernard De Baets, Hans E. De Meyer, Karel De Loof:
The Omnipresence of Cycle-Transitivity in the Comparison of Random Variables. SMPS 2008: 299-305 - 2007
- [j2]Karel De Loof, Bernard De Baets, Hans E. De Meyer:
On the random generation and counting of weak order extensions of a poset with given class cardinalities. Inf. Sci. 177(1): 220-230 (2007) - [c2]Karel De Loof, Bernard De Baets, Hans E. De Meyer, Rainer Brüggemann:
A Lattice-Theoretic Approach to Computing Averaged Ranks Illustrated on Pollution Data in Baden-Württemberg. EnviroInfo (2) 2007: 177-179 - 2006
- [j1]Karel De Loof, Hans E. De Meyer, Bernard De Baets:
Exploiting the Lattice of Ideals Representation of a Poset. Fundam. Informaticae 71(2-3): 309-321 (2006) - [c1]Karel De Loof, Hans E. De Meyer, Bernard De Baets:
Graded Stochastic Dominance as a Tool for Ranking the Elements of a Poset. SMPS 2006: 53-60
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.
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.
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.
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:57 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:
翻译：