Data structures for maintaining set partitions (Extended abstract)

Michael A. Bender; Saurabh Sethia; Steven Skiena

doi:10.1007/3-540-44985-X

Data structures for maintaining set partitions (Extended abstract)

Michael A. Bender
, Saurabh Sethia
, Steven Skiena

Computer Science

Stony Brook University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Original language	English
Title of host publication	Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings
Editors	Magnús M. Halldórsson
Publisher	Springer Verlag
Pages	83-96
Number of pages	14
ISBN (Print)	3540676902, 9783540676904
DOIs	https://doi.org/10.1007/3-540-44985-X
State	Published - 2000
Event	7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 - Bergen, Norway Duration: Jul 5 2000 → Jul 7 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1851
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th Scandinavian Workshop on Algorithm Theory, SWAT 2000
Country/Territory	Norway
City	Bergen
Period	07/5/00 → 07/7/00

Access to Document

10.1007/3-540-44985-X

Cite this

Bender, M. A., Sethia, S., & Skiena, S. (2000). Data structures for maintaining set partitions (Extended abstract). In M. M. Halldórsson (Ed.), Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings (pp. 83-96). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1851). Springer Verlag. https://doi.org/10.1007/3-540-44985-X

Bender, Michael A. ; Sethia, Saurabh ; Skiena, Steven. / Data structures for maintaining set partitions (Extended abstract). Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. editor / Magnús M. Halldórsson. Springer Verlag, 2000. pp. 83-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5feafac4298d4a709d74b02b30bce6d7,

title = "Data structures for maintaining set partitions (Extended abstract)",

author = "Bender, \{Michael A.\} and Saurabh Sethia and Steven Skiena",

year = "2000",

doi = "10.1007/3-540-44985-X",

language = "English",

isbn = "3540676902",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "83--96",

editor = "Halld{\'o}rsson, \{Magn{\'u}s M.\}",

booktitle = "Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings",

note = "7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 ; Conference date: 05-07-2000 Through 07-07-2000",

}

Bender, MA, Sethia, S & Skiena, S 2000, Data structures for maintaining set partitions (Extended abstract). in MM Halldórsson (ed.), Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1851, Springer Verlag, pp. 83-96, 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, Bergen, Norway, 07/5/00. https://doi.org/10.1007/3-540-44985-X

Data structures for maintaining set partitions (Extended abstract). / Bender, Michael A.; Sethia, Saurabh; Skiena, Steven.
Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. ed. / Magnús M. Halldórsson. Springer Verlag, 2000. p. 83-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1851).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Data structures for maintaining set partitions (Extended abstract)

AU - Bender, Michael A.

AU - Sethia, Saurabh

AU - Skiena, Steven

PY - 2000

Y1 - 2000

UR - https://www.scopus.com/pages/publications/84956951430

U2 - 10.1007/3-540-44985-X

DO - 10.1007/3-540-44985-X

M3 - Conference contribution

AN - SCOPUS:84956951430

SN - 3540676902

SN - 9783540676904

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 83

EP - 96

BT - Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings

A2 - Halldórsson, Magnús M.

PB - Springer Verlag

T2 - 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000

Y2 - 5 July 2000 through 7 July 2000

ER -

Bender MA, Sethia S, Skiena S. Data structures for maintaining set partitions (Extended abstract). In Halldórsson MM, editor, Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Springer Verlag. 2000. p. 83-96. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44985-X

Data structures for maintaining set partitions (Extended abstract)

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this