Zobrazeno 1 - 10
of 14
pro vyhledávání: '"DURANT, KEVIN"'
Autor:
Durant, Kevin, Wagner, Stephan
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 21 no. 4, Combinatorics (August 27, 2019) dmtcs:4325
A centroid node in a tree is a node for which the sum of the distances to all other nodes attains its minimum, or equivalently a node with the property that none of its branches contains more than half of the other nodes. We generalise some known res
Externí odkaz:
http://arxiv.org/abs/1802.09334
Autor:
Durant, Kevin
Thesis (MSc)--Stellenbosch University, 2013.
ENGLISH ABSTRACT: The search for non-terminating paths within a program is a crucial part of software verification, as the detection of anfinite path is often the only manner of falsifying program ter
ENGLISH ABSTRACT: The search for non-terminating paths within a program is a crucial part of software verification, as the detection of anfinite path is often the only manner of falsifying program ter
Externí odkaz:
http://hdl.handle.net/10019.1/80052
Autor:
Durant, Kevin1, Wagner, Stephan1
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2019, Vol. 21 Issue 4, p1-29. 29p.
Autor:
Durant, Kevin, Deveney, Sean
Publikováno v:
Sporting News. 3/30/2009, Vol. 233 Issue 8, p40-44. 4p. 2 Color Photographs, 1 Chart.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Durant, Kevin
Publikováno v:
Sporting News. 6/6/2011, Vol. 235 Issue 12, p15-15. 1/2p. 1 Color Photograph.
Autor:
Durant, Kevin, Taylor, Benson
Publikováno v:
Sporting News. 3/29/2010, Vol. 23 Issue 8, p63-63. 1/3p.
Autor:
Durant, Kevin
Publikováno v:
ESPN Magazine; 2/5/2018, Vol. 21 Issue 1, p55-55, 1p, 1 Black and White Photograph