MPI-INF D1 Publications: Journal Article: A Lower Bound on the Complexity of the {Union-Split-Find} Problem

Journal Article
@Article
Artikel in Fachzeitschrift

Show entries of:

this year (2021) | last year (2020) | two years ago (2019) | Notes URL

Action:

Options:

Goto entry point

Author, Editor(s)

Author(s):

Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut

dblp
dblp
dblp

Not MPG Author(s):

BibTeX cite key*:

SICOMP::MehlhornNA1988

Title

Title*:

A Lower Bound on the Complexity of the Union-Split-Find Problem

Journal

Journal Title*:	SIAM Journal on Computing	Journal's URL:
Download URL for the article:		Language:	English

Publisher

Publisher's Name:	SIAM	Publisher's URL:
Publisher's Address:	Philadelphie, PA, USA	ISSN:

Vol, No, pp, Date

Volume*:	17	Number:	6
Publishing Date:	1988
Pages*:	1093-1102	Number of VG Pages:
Page Start:		Page End:
Sequence Number:		DOI:

Note, Abstract, ©

Note:
(LaTeX) Abstract:
URL for the Abstract:
Categories, Keywords:
HyperLinks / References / URLs:
Copyright Message:
Personal Comments:
Download Access Level:	Public

Correlation

MPG Unit:	Max-Planck-Institut für Informatik

MPG Subunit:	Algorithms and Complexity Group
Audience:	Expert
Appearance:	MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:

@ARTICLE{SICOMP::MehlhornNA1988,
AUTHOR = {Mehlhorn, Kurt and N{\"a}her, Stefan and Alt, Helmut},
TITLE = {A Lower Bound on the Complexity of the {Union-Split-Find} Problem},
JOURNAL = {SIAM Journal on Computing},
PUBLISHER = {SIAM},
YEAR = {1988},
NUMBER = {6},
VOLUME = {17},
PAGES = {1093--1102},
ADDRESS = {Philadelphie, PA, USA},
}

Entry last modified by Anja Becker, 03/06/2008

Edit History (please click the blue arrow to see the details)

	Editor(s) Christine Kiesel	Created 04/05/2006 03:29:39 PM
Revision 1. 0.	Editor Anja Becker Christine Kiesel	Edit Date 06.03.2008 08:56:22 05.04.2006 15:31:41

Attachment Section