( en | de | ru )

 

Disambiguation of "Schmeichel, Edward F."

Author of the publication

copydeleteadd this publication to your clipboard
Gossiping with Multiple Sends and Receives.

, , and . IPPS, page 757-761. IEEE Computer Society, (1994)

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. You can also use the button next to the name to display some publications already assigned to the person.

Armin Schmeichel

Hansjörg Schmeichel

Christian Schmeichel

Irmgard Schmeichel

Gabriele Schmeichel

 

Other publications of authors with the same name

Tiling Rectangles with Trominoes: 10641., , , , , , , , , and 22 other author(s). The American Mathematical Monthly, 107 (2): 179 (2000)On minimizing testing rounds for fault identification., , , and . FTCS, page 266-271. IEEE Computer Society, (1988)A Note on the Vertex Arboricity of a Graph., and . SIAM J. Discret. Math., 2 (1): 64-67 (1989)On the necessity of Chvátal's Hamiltonian degree condition., , , and . AKCE Int. J. Graphs Comb., 17 (2): 665-669 (2020)Gossiping with Multiple Sends and Receives., , and . Discret. Appl. Math., 64 (2): 105-116 (1996)Tutte sets in graphs II: The complexity of finding maximum Tutte sets., , , , , and . Discret. Appl. Math., 155 (10): 1336-1343 (2007)An Adaptive Algorithm for System Level Diagnosis., and . J. Algorithms, 5 (4): 526-530 (1984)Gossiping with Multiple Sends and Receives., , and . IPPS, page 757-761. IEEE Computer Society, (1994)Best Monotone Degree Conditions for Graph Properties: A Survey., , , , , , , and . Graphs Comb., 31 (1): 1-22 (2015)A cycle structure theorem for hamiltonian graphs., and . J. Comb. Theory B, 45 (1): 99-107 (1988)