PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems

Gespeichert in:

Autor*in:	Wang, B.-F. [verfasserIn] Ku, S.-C. Shil, K.-H.

Format:	Artikel

Erschienen:	2001

Umfang:	11

Übergeordnetes Werk:	Enthalten in: IEEE transactions on parallel and distributed systems - New York, NY : Inst., 1990, 12(2001), 9, Seite 888-898
Übergeordnetes Werk:	volume:12 ; year:2001 ; number:9 ; pages:888-898 ; extent:11

Katalog-ID:	OLC1612140858

Internformat


LEADER	01000caa a22002652 4500
001	OLC1612140858
003	DE-627
005	20220216154006.0
007	tu
008	011009s2001 xx \|\|\|\|\| 00\| \|\|und c
028	5	2	\|a SW011009
035			\|a (DE-627)OLC1612140858
035			\|a (DE-599)GBVOLC1612140858
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
082	0	4	\|a 620 \|a 004
084			\|a 54.00 \|2 bkl
100	1		\|a Wang, B.-F. \|e verfasserin \|4 aut
245	1	0	\|a PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
264		1	\|c 2001
300			\|a 11
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
700	1		\|a Ku, S.-C. \|4 oth
700	1		\|a Shil, K.-H. \|4 oth
773	0	8	\|i Enthalten in \|t IEEE transactions on parallel and distributed systems \|d New York, NY : Inst., 1990 \|g 12(2001), 9, Seite 888-898 \|w (DE-627)130828106 \|w (DE-600)1016109-0 \|w (DE-576)023066237 \|x 1045-9219 \|7 nnns
773	1	8	\|g volume:12 \|g year:2001 \|g number:9 \|g pages:888-898 \|g extent:11
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-MAT
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_31
912			\|a GBV_ILN_32
912			\|a GBV_ILN_62
912			\|a GBV_ILN_65
912			\|a GBV_ILN_70
912			\|a GBV_ILN_100
912			\|a GBV_ILN_105
912			\|a GBV_ILN_285
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2244
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4309
912			\|a GBV_ILN_4314
912			\|a GBV_ILN_4315
912			\|a GBV_ILN_4317
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4319
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4700
936	b	k	\|a 54.00 \|q AVZ
951			\|a AR
952			\|d 12 \|j 2001 \|e 9 \|h 888-898 \|g 11

Indexfelder

author_variant	b f w bfw
matchkey_str	article:10459219:2001----::aesplctosnagrtmcsotmlaallloihsoterei
hierarchy_sort_str	2001
bklnumber	54.00
publishDate	2001
allfields	SW011009 (DE-627)OLC1612140858 (DE-599)GBVOLC1612140858 DE-627 ger DE-627 rakwb 620 004 54.00 bkl Wang, B.-F. verfasserin aut PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems 2001 11 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Ku, S.-C. oth Shil, K.-H. oth Enthalten in IEEE transactions on parallel and distributed systems New York, NY : Inst., 1990 12(2001), 9, Seite 888-898 (DE-627)130828106 (DE-600)1016109-0 (DE-576)023066237 1045-9219 nnns volume:12 year:2001 number:9 pages:888-898 extent:11 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_32 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4309 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 54.00 AVZ AR 12 2001 9 888-898 11
spelling	SW011009 (DE-627)OLC1612140858 (DE-599)GBVOLC1612140858 DE-627 ger DE-627 rakwb 620 004 54.00 bkl Wang, B.-F. verfasserin aut PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems 2001 11 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Ku, S.-C. oth Shil, K.-H. oth Enthalten in IEEE transactions on parallel and distributed systems New York, NY : Inst., 1990 12(2001), 9, Seite 888-898 (DE-627)130828106 (DE-600)1016109-0 (DE-576)023066237 1045-9219 nnns volume:12 year:2001 number:9 pages:888-898 extent:11 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_32 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4309 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 54.00 AVZ AR 12 2001 9 888-898 11
allfields_unstemmed	SW011009 (DE-627)OLC1612140858 (DE-599)GBVOLC1612140858 DE-627 ger DE-627 rakwb 620 004 54.00 bkl Wang, B.-F. verfasserin aut PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems 2001 11 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Ku, S.-C. oth Shil, K.-H. oth Enthalten in IEEE transactions on parallel and distributed systems New York, NY : Inst., 1990 12(2001), 9, Seite 888-898 (DE-627)130828106 (DE-600)1016109-0 (DE-576)023066237 1045-9219 nnns volume:12 year:2001 number:9 pages:888-898 extent:11 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_32 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4309 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 54.00 AVZ AR 12 2001 9 888-898 11
allfieldsGer	SW011009 (DE-627)OLC1612140858 (DE-599)GBVOLC1612140858 DE-627 ger DE-627 rakwb 620 004 54.00 bkl Wang, B.-F. verfasserin aut PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems 2001 11 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Ku, S.-C. oth Shil, K.-H. oth Enthalten in IEEE transactions on parallel and distributed systems New York, NY : Inst., 1990 12(2001), 9, Seite 888-898 (DE-627)130828106 (DE-600)1016109-0 (DE-576)023066237 1045-9219 nnns volume:12 year:2001 number:9 pages:888-898 extent:11 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_32 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4309 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 54.00 AVZ AR 12 2001 9 888-898 11
allfieldsSound	SW011009 (DE-627)OLC1612140858 (DE-599)GBVOLC1612140858 DE-627 ger DE-627 rakwb 620 004 54.00 bkl Wang, B.-F. verfasserin aut PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems 2001 11 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Ku, S.-C. oth Shil, K.-H. oth Enthalten in IEEE transactions on parallel and distributed systems New York, NY : Inst., 1990 12(2001), 9, Seite 888-898 (DE-627)130828106 (DE-600)1016109-0 (DE-576)023066237 1045-9219 nnns volume:12 year:2001 number:9 pages:888-898 extent:11 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_32 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4309 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 54.00 AVZ AR 12 2001 9 888-898 11
source	Enthalten in IEEE transactions on parallel and distributed systems 12(2001), 9, Seite 888-898 volume:12 year:2001 number:9 pages:888-898 extent:11
sourceStr	Enthalten in IEEE transactions on parallel and distributed systems 12(2001), 9, Seite 888-898 volume:12 year:2001 number:9 pages:888-898 extent:11
format_phy_str_mv	Article
institution	findex.gbv.de
dewey-raw	620
isfreeaccess_bool	false
container_title	IEEE transactions on parallel and distributed systems
authorswithroles_txt_mv	Wang, B.-F. @@aut@@ Ku, S.-C. @@oth@@ Shil, K.-H. @@oth@@
publishDateDaySort_date	2001-01-01T00:00:00Z
hierarchy_top_id	130828106
dewey-sort	3620
id	OLC1612140858
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC1612140858</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220216154006.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">011009s2001 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">SW011009</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1612140858</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1612140858</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wang, B.-F.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ku, S.-C.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shil, K.-H.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on parallel and distributed systems</subfield><subfield code="d">New York, NY : Inst., 1990</subfield><subfield code="g">12(2001), 9, Seite 888-898</subfield><subfield code="w">(DE-627)130828106</subfield><subfield code="w">(DE-600)1016109-0</subfield><subfield code="w">(DE-576)023066237</subfield><subfield code="x">1045-9219</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:12</subfield><subfield code="g">year:2001</subfield><subfield code="g">number:9</subfield><subfield code="g">pages:888-898</subfield><subfield code="g">extent:11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4309</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4315</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">12</subfield><subfield code="j">2001</subfield><subfield code="e">9</subfield><subfield code="h">888-898</subfield><subfield code="g">11</subfield></datafield></record></collection>
author	Wang, B.-F.
spellingShingle	Wang, B.-F. ddc 620 bkl 54.00 PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
authorStr	Wang, B.-F.
ppnlink_with_tag_str_mv	@@773@@(DE-627)130828106
format	Article
dewey-ones	620 - Engineering & allied operations 004 - Data processing & computer science
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	1045-9219
topic_title	620 004 54.00 bkl PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
topic	ddc 620 bkl 54.00
topic_unstemmed	ddc 620 bkl 54.00
topic_browse	ddc 620 bkl 54.00
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	s c k sck k h s khs
hierarchy_parent_title	IEEE transactions on parallel and distributed systems
hierarchy_parent_id	130828106
dewey-tens	620 - Engineering 000 - Computer science, knowledge & systems
hierarchy_top_title	IEEE transactions on parallel and distributed systems
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)130828106 (DE-600)1016109-0 (DE-576)023066237
title	PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
ctrlnum	(DE-627)OLC1612140858 (DE-599)GBVOLC1612140858
title_full	PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
author_sort	Wang, B.-F.
journal	IEEE transactions on parallel and distributed systems
journalStr	IEEE transactions on parallel and distributed systems
isOA_bool	false
dewey-hundreds	600 - Technology 000 - Computer science, information & general works
recordtype	marc
publishDateSort	2001
contenttype_str_mv	txt
container_start_page	888
author_browse	Wang, B.-F.
container_volume	12
physical	11
class	620 004 54.00 bkl
format_se	Aufsätze
author-letter	Wang, B.-F.
dewey-full	620 004
title_sort	papers - applications and algorithms - cost-optimal parallel algorithms for the tree bisector and related problems
title_auth	PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_31 GBV_ILN_32 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4309 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700
container_issue	9
title_short	PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
remote_bool	false
author2	Ku, S.-C. Shil, K.-H.
author2Str	Ku, S.-C. Shil, K.-H.
ppnlink	130828106
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth oth
up_date	2024-07-03T18:21:00.687Z
_version_	1803583079777828864
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC1612140858</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220216154006.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">011009s2001 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">SW011009</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1612140858</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1612140858</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wang, B.-F.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ku, S.-C.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shil, K.-H.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on parallel and distributed systems</subfield><subfield code="d">New York, NY : Inst., 1990</subfield><subfield code="g">12(2001), 9, Seite 888-898</subfield><subfield code="w">(DE-627)130828106</subfield><subfield code="w">(DE-600)1016109-0</subfield><subfield code="w">(DE-576)023066237</subfield><subfield code="x">1045-9219</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:12</subfield><subfield code="g">year:2001</subfield><subfield code="g">number:9</subfield><subfield code="g">pages:888-898</subfield><subfield code="g">extent:11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4309</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4315</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">12</subfield><subfield code="j">2001</subfield><subfield code="e">9</subfield><subfield code="h">888-898</subfield><subfield code="g">11</subfield></datafield></record></collection>
score	7.3999014

Nicht das Richtige dabei?

Schreiben Sie uns!

PAPERS - Applications and Algorithms - Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?