Aarhus University Seal / Aarhus Universitets segl

Lower bounds for union-split-find related problems on random access machines

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Standard

Lower bounds for union-split-find related problems on random access machines. / Miltersen, Peter Bro.

Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. Association for Computing Machinery, 1994. p. 625-634.

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Harvard

Miltersen, PB 1994, Lower bounds for union-split-find related problems on random access machines. in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. Association for Computing Machinery, pp. 625-634, Annual ACM Symposium on Theory of Computing, Montreal, Canada, 23/05/1994. https://doi.org/10.1145/195058.195415

APA

Miltersen, P. B. (1994). Lower bounds for union-split-find related problems on random access machines. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing (pp. 625-634). Association for Computing Machinery. https://doi.org/10.1145/195058.195415

CBE

Miltersen PB. 1994. Lower bounds for union-split-find related problems on random access machines. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. Association for Computing Machinery. pp. 625-634. https://doi.org/10.1145/195058.195415

MLA

Miltersen, Peter Bro "Lower bounds for union-split-find related problems on random access machines". Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. Association for Computing Machinery. 1994, 625-634. https://doi.org/10.1145/195058.195415

Vancouver

Miltersen PB. Lower bounds for union-split-find related problems on random access machines. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. Association for Computing Machinery. 1994. p. 625-634 https://doi.org/10.1145/195058.195415

Author

Miltersen, Peter Bro. / Lower bounds for union-split-find related problems on random access machines. Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. Association for Computing Machinery, 1994. pp. 625-634

Bibtex

@inproceedings{431e1a00aea411df8c1a000ea68e967b,
title = "Lower bounds for union-split-find related problems on random access machines",
author = "Miltersen, {Peter Bro}",
year = "1994",
doi = "10.1145/195058.195415",
language = "English",
pages = "625--634",
booktitle = "Proceedings of the twenty-sixth annual ACM symposium on Theory of computing",
publisher = "Association for Computing Machinery",
address = "United States",
note = "null ; Conference date: 23-05-1994 Through 25-05-1994",

}

RIS

TY - GEN

T1 - Lower bounds for union-split-find related problems on random access machines

AU - Miltersen, Peter Bro

N1 - Conference code: 26

PY - 1994

Y1 - 1994

U2 - 10.1145/195058.195415

DO - 10.1145/195058.195415

M3 - Article in proceedings

SP - 625

EP - 634

BT - Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

PB - Association for Computing Machinery

Y2 - 23 May 1994 through 25 May 1994

ER -