


Остановите войну!
for scientists:


default search action
Journal of Algorithms, Volume 51
Volume 51, Number 1, April 2004
- Jonathan H. Badger, Paul E. Kearney, Ming Li, John Tsang, Tao Jiang
:
Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. 1-14 - Bernadette Charron-Bost, André Schiper:
Uniform consensus is harder than consensus. 15-37 - Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis
, Andrzej Pelc:
Tree exploration with little memory. 38-63 - George F. Georgakopoulos:
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. 64-76 - Stavros D. Nikolopoulos, Leonidas Palios:
Parallel algorithms for P4-comparability graphs. 77-104
Volume 51, Number 2, May 2004
- Magnus Wahlström
:
Exact algorithms for finding minimum transversals in rank-3 hypergraphs. 107-121 - Rasmus Pagh, Flemming Friche Rodler:
Cuckoo hashing. 122-144 - Amotz Bar-Noy, Grzegorz Malewicz:
Establishing wireless conference calls under delay constraints. 145-169 - Alois Panholzer, Helmut Prodinger, Marko Riedel:
Permuting in place: analysis of two stopping rules. 170-184 - Vincenzo Liberatore
:
Circular arrangements and cyclic broadcast scheduling. 185-215

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.