Optimal algorithms for finding nearest common ancestors in dynamic trees

Publikation: Bog/antologi/afhandling/rapport › Bog › Forskning

Standard

Optimal algorithms for finding nearest common ancestors in dynamic trees. / Alstrup, Stephen.

Citeseer, 1995.

Publikation: Bog/antologi/afhandling/rapport › Bog › Forskning

Harvard

Alstrup, S 1995, Optimal algorithms for finding nearest common ancestors in dynamic trees. Citeseer.

APA

Alstrup, S. (1995). Optimal algorithms for finding nearest common ancestors in dynamic trees. Citeseer.

Vancouver

Alstrup S. Optimal algorithms for finding nearest common ancestors in dynamic trees. Citeseer, 1995.

Author

Alstrup, Stephen. / Optimal algorithms for finding nearest common ancestors in dynamic trees. Citeseer, 1995.

Bibtex

@book{995f5462d595454da09b58ab3eddceae,
title = "Optimal algorithms for finding nearest common ancestors in dynamic trees",
author = "Stephen Alstrup",
year = "1995",
language = "English",
publisher = "Citeseer",

}

RIS

TY - BOOK

T1 - Optimal algorithms for finding nearest common ancestors in dynamic trees

AU - Alstrup, Stephen

PY - 1995

Y1 - 1995

M3 - Book

BT - Optimal algorithms for finding nearest common ancestors in dynamic trees

PB - Citeseer

ER -

ID: 84716329