Verfügbarkeit: Proceedings :: THWS Bibkatalog

Proceedings: June 24 - 27, 1997 Ulm, Germany

Gespeichert in:

Bibliographische Detailangaben
Körperschaft:	Conference on Computational Complexity Ulm (VerfasserIn)
Format:	Tagungsbericht Buch
Sprache:	English
Veröffentlicht:	Los Alamitos, Calif. [u.a.] IEEE Computer Soc. 1997
Schlagworte:	Formale Sprache Datennetz Datenstruktur Komplexitätstheorie Algorithmentheorie Telekommunikationsnetz Berechnungskomplexität Konferenzschrift > 1997 > Ulm
Beschreibung:	X, 315 S. Ill., graph. Darst.
ISBN:	0818679077 0818679093 0780342674

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV011428904
003	DE-604
005	20130829
007	t\|
008	970709s1997 xx ad\|\| \|\|\|\| 10\|\|\| eng d
020			\|a 0818679077 \|9 0-8186-7907-7
020			\|a 0818679093 \|9 0-8186-7909-3
020			\|a 0780342674 \|9 0-7803-4267-4
035			\|a (OCoLC)613892629
035			\|a (DE-599)BVBBV011428904
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-739 \|a DE-634 \|a DE-83
084			\|a DAT 517f \|2 stub
111	2		\|a Conference on Computational Complexity \|n 12 \|d 1997 \|c Ulm \|j Verfasser \|0 (DE-588)5249961-3 \|4 aut
245	1	0	\|a Proceedings \|b June 24 - 27, 1997 Ulm, Germany \|c twelfth annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference)
246	1	3	\|a Computational complexity
264		1	\|a Los Alamitos, Calif. [u.a.] \|b IEEE Computer Soc. \|c 1997
300			\|a X, 315 S. \|b Ill., graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650	0	7	\|a Formale Sprache \|0 (DE-588)4017848-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Datennetz \|0 (DE-588)4011130-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Datenstruktur \|0 (DE-588)4011146-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmentheorie \|0 (DE-588)4200409-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Telekommunikationsnetz \|0 (DE-588)4133586-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 1997 \|z Ulm \|2 gnd-content
689	0	0	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	0		\|5 DE-604
689	1	0	\|a Telekommunikationsnetz \|0 (DE-588)4133586-7 \|D s
689	1		\|8 1\p \|5 DE-604
689	2	0	\|a Datennetz \|0 (DE-588)4011130-1 \|D s
689	2		\|8 2\p \|5 DE-604
689	3	0	\|a Formale Sprache \|0 (DE-588)4017848-1 \|D s
689	3		\|8 3\p \|5 DE-604
689	4	0	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	4		\|8 4\p \|5 DE-604
689	5	0	\|a Datenstruktur \|0 (DE-588)4011146-5 \|D s
689	5		\|8 5\p \|5 DE-604
689	6	0	\|a Algorithmentheorie \|0 (DE-588)4200409-3 \|D s
689	6		\|8 6\p \|5 DE-604
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 3\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 4\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 5\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 6\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-007685186

Datensatz im Suchindex

_version_	1820882520570331136
adam_text
any_adam_object
author_corporate	Conference on Computational Complexity Ulm
author_corporate_role	aut
author_facet	Conference on Computational Complexity Ulm
author_sort	Conference on Computational Complexity Ulm
building	Verbundindex
bvnumber	BV011428904
classification_rvk	SS 1997
classification_tum	DAT 517f
ctrlnum	(OCoLC)613892629 (DE-599)BVBBV011428904
discipline	Informatik
format	Conference Proceeding Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV011428904</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130829</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">970709s1997 xx ad\|\| \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0818679077</subfield><subfield code="9">0-8186-7907-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0818679093</subfield><subfield code="9">0-8186-7909-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0780342674</subfield><subfield code="9">0-7803-4267-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)613892629</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011428904</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Conference on Computational Complexity</subfield><subfield code="n">12</subfield><subfield code="d">1997</subfield><subfield code="c">Ulm</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)5249961-3</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings</subfield><subfield code="b">June 24 - 27, 1997 Ulm, Germany</subfield><subfield code="c">twelfth annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference)</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Los Alamitos, Calif. [u.a.]</subfield><subfield code="b">IEEE Computer Soc.</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 315 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datennetz</subfield><subfield code="0">(DE-588)4011130-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1997</subfield><subfield code="z">Ulm</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Datennetz</subfield><subfield code="0">(DE-588)4011130-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">6\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007685186</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 1997 Ulm gnd-content
genre_facet	Konferenzschrift 1997 Ulm
id	DE-604.BV011428904
illustrated	Illustrated
indexdate	2025-01-10T17:08:12Z
institution	BVB
institution_GND	(DE-588)5249961-3
isbn	0818679077 0818679093 0780342674
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-007685186
oclc_num	613892629
open_access_boolean
owner	DE-739 DE-634 DE-83
owner_facet	DE-739 DE-634 DE-83
physical	X, 315 S. Ill., graph. Darst.
publishDate	1997
publishDateSearch	1997
publishDateSort	1997
publisher	IEEE Computer Soc.
record_format	marc
spelling	Conference on Computational Complexity 12 1997 Ulm Verfasser (DE-588)5249961-3 aut Proceedings June 24 - 27, 1997 Ulm, Germany twelfth annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference) Computational complexity Los Alamitos, Calif. [u.a.] IEEE Computer Soc. 1997 X, 315 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Formale Sprache (DE-588)4017848-1 gnd rswk-swf Datennetz (DE-588)4011130-1 gnd rswk-swf Datenstruktur (DE-588)4011146-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Telekommunikationsnetz (DE-588)4133586-7 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1997 Ulm gnd-content Komplexitätstheorie (DE-588)4120591-1 s DE-604 Telekommunikationsnetz (DE-588)4133586-7 s 1\p DE-604 Datennetz (DE-588)4011130-1 s 2\p DE-604 Formale Sprache (DE-588)4017848-1 s 3\p DE-604 Berechnungskomplexität (DE-588)4134751-1 s 4\p DE-604 Datenstruktur (DE-588)4011146-5 s 5\p DE-604 Algorithmentheorie (DE-588)4200409-3 s 6\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Proceedings June 24 - 27, 1997 Ulm, Germany Formale Sprache (DE-588)4017848-1 gnd Datennetz (DE-588)4011130-1 gnd Datenstruktur (DE-588)4011146-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmentheorie (DE-588)4200409-3 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd
subject_GND	(DE-588)4017848-1 (DE-588)4011130-1 (DE-588)4011146-5 (DE-588)4120591-1 (DE-588)4200409-3 (DE-588)4133586-7 (DE-588)4134751-1 (DE-588)1071861417
title	Proceedings June 24 - 27, 1997 Ulm, Germany
title_alt	Computational complexity
title_auth	Proceedings June 24 - 27, 1997 Ulm, Germany
title_exact_search	Proceedings June 24 - 27, 1997 Ulm, Germany
title_full	Proceedings June 24 - 27, 1997 Ulm, Germany twelfth annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference)
title_fullStr	Proceedings June 24 - 27, 1997 Ulm, Germany twelfth annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference)
title_full_unstemmed	Proceedings June 24 - 27, 1997 Ulm, Germany twelfth annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference)
title_short	Proceedings
title_sort	proceedings june 24 27 1997 ulm germany
title_sub	June 24 - 27, 1997 Ulm, Germany
topic	Formale Sprache (DE-588)4017848-1 gnd Datennetz (DE-588)4011130-1 gnd Datenstruktur (DE-588)4011146-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmentheorie (DE-588)4200409-3 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd
topic_facet	Formale Sprache Datennetz Datenstruktur Komplexitätstheorie Algorithmentheorie Telekommunikationsnetz Berechnungskomplexität Konferenzschrift 1997 Ulm
work_keys_str_mv	AT conferenceoncomputationalcomplexityulm proceedingsjune24271997ulmgermany AT conferenceoncomputationalcomplexityulm computationalcomplexity

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge