Result 1 to 20 of 45 total
Birth of a strongly connected giant in an inhomogeneous random digraph. (English)
J. Appl. Probab. 49, No. 3, 601-611 (2012).
1
Special issue: Cryptology in progress. Selected papers based on the presentations at the 10th Central European conference on cryptology (CECC), Bȩlewo, Poland, June 20‒22, 2010. (English)
Fundam. Inform. 114, No. 3-4, i-ii, 221-373 (2012).
2
Clustering coefficients of random intersection graphs. (English)
Gaul, Wolfgang (ed.) et al., Challenges at the interface of data analysis, computer science, and optimization. Proceedings of the 34th annual conference of the Gesellschaft für Klassifikation e. V., Karlsruhe, Germany July 21‒23, 2010. Berlin: Springer (ISBN 978-3-642-24465-0/pbk; 978-3-642-24466-7/ebook). Studies in Classification, Data Analysis, and Knowledge Organization, 243-253 (2012).
3
Random mappings with a given number of cyclical points. (English)
Ars Comb. 94, 341-359 (2010).
4
Random key predistribution for wireless sensor networks using deployment knowledge. (English)
Computing 85, No. 1-2, 57-76 (2009).
5
Component evolution in a secure wireless sensor network. (English)
Networks 53, No. 1, 19-26 (2009).
6
A random mapping with preferential attachment. (English)
Random Struct. Algorithms 34, No. 1, 87-111 (2009).
7
A random mapping with preferential attachment (English)
Random Struct. Algorithms 34, No. 1, 87-111 (2009).
8
Bounds for differential probabilities in even order abelian groups. (English)
Tatra Mt. Math. Publ. 41, 33-46 (2008).
9
The vertex degree distribution of passive random intersection graph models. (English)
Comb. Probab. Comput. 17, No. 4, 549-558 (2008).
10
Random mappings with exchangeable in-degrees. (English)
Random Struct. Algorithms 33, No. 1, 105-126 (2008).
11
Local properties of random mappings with exchangeable in-degrees. (English)
Adv. Appl. Probab. 40, No. 1, 183-205 (2008).
12
Random mappings with exchangeable in-degrees (English)
Random Struct. Algorithms 33, No. 1, 105-126 (2008).
13
The vertex degree distribution of passive random intersection graph models (English)
Combinatorics, Probability & Computing 17, No. 4, 549-558 (2008).
14
A cutting process for random mappings (English)
Random Struct. Algorithms 30, No. 1-2, 287-306 (2007).
15
The degree of a typical vertex in generalized random intersection graph models. (English)
Discrete Math. 306, No. 18, 2152-2165 (2006).
16
Random intersection graphs and classification (English)
GfKl, 67-74 (2006).
17
Remarks on a general model of a random digraph. (English)
Ars Comb. 65, 135-144 (2002).
18
Compound random mappings. (English)
J. Appl. Probab. 39, No.4, 712-729 (2002).
19
Two models of random intersection graphs and their applications. (English)
Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12‒15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 129-132 (2001).
20
Result 1 to 20 of 45 total
Start
Contact
Print
General Help
