( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The simulation of the non-linear dynamic behavior of distributed routing networks using DECSIM.

, , и . WSC, стр. 705-715. IEEE Computer Society, (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Andrzej Lingas

Andrzej Debski

Andrzej Szplit

Andrzej Tamborek

Andrzej Szczerbakow

 

Другие публикации лиц с тем же именем

Approximate Counting of Matchings in Sparse Hypergraphs, , и . CoRR, (2012)Theory of random graphs, , и . John Wiley & Sons, New York; Chichester, (2000)Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma., , и . SIAM J. Comput., 31 (2): 428-446 (2001)An Algorithmic Embedding of Graphs via Perfect Matchings., , и . RANDOM, том 1518 из Lecture Notes in Computer Science, стр. 25-34. Springer, (1998)Patterns in Ordered (random) Matchings., , и . LATIN, том 13568 из Lecture Notes in Computer Science, стр. 544-556. Springer, (2022)An Improved Upper Bound on the Density of Universal Random Graphs., , , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 231-242. Springer, (2012)Universality of random graphs., , , и . SODA, стр. 782-788. SIAM, (2008)Disruptive innovation in the era of global cyber-society: With focus on smart city efforts., , , и . IDAACS, стр. 1102-1104. IEEE, (2017)Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection., , и . J. Graph Theory, 104 (4): 811-835 (декабря 2023)Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma., и . Comb., 19 (3): 437-452 (1999)