The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Quicksort algorithm again revisited.”

A few remarks on the history of MST-problem

Jaroslav Nešetřil (1997)

Archivum Mathematicum

Similarity:

On the background of Borůvka’s pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper Graham-Hell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem.

A branch hash function as a method of message synchronization in anonymous P2P conversations

Anna Kobusińska, Jerzy Brzeziński, Michał Boroń, Łukasz Inatlewski, Michał Jabczyński, Mateusz Maciejewski (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

Currently existing solutions rarely protect message integrity, authenticity and user anonymity without burdening the user with details of key management. To address this problem, we present Aldeon-a protocol for anonymous group conversations in a peer-to-peer system. The efficiency of Aldeon is based on a novel tree synchronization algorithm, which is proposed and discussed in this paper. By using this algorithm, a significant reduction in the number of exchanged messages is achieved....