Availability: Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions

Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions:

Saved in:

Bibliographic Details
Main Author:	Rossmanith, Peter (Author)
Format:	Thesis/Dissertation Book
Language:	English
Published:	1994
Subjects:	Boolesche Funktion Parallelverarbeitung Schaltnetz PRAM > Informatik Speicherzugriff Zeitkomplexität Hochschulschrift
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006600019&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Physical Description:	113 S. graph. Darst.

Staff View

MARC


LEADER	00000nam a2200000 c 4500
001	BV009959608
003	DE-604
005	20230116
007	t\|
008	941221s1994 xx d\|\|\| m\|\|\| 00\|\|\| engod
016	7		\|a 943202728 \|2 DE-101
035			\|a (OCoLC)75552890
035			\|a (DE-599)BVBBV009959608
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-91 \|a DE-91G \|a DE-29T \|a DE-12 \|a DE-706 \|a DE-11 \|a DE-188
084			\|a DAT 517d \|2 stub
084			\|a DAT 406d \|2 stub
084			\|a DAT 549d \|2 stub
100	1		\|a Rossmanith, Peter \|e Verfasser \|0 (DE-588)1084817721 \|4 aut
245	1	0	\|a Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions \|c Peter Rossmanith
264		1	\|c 1994
300			\|a 113 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
502			\|a München, Techn. Univ., Diss., 1994
650	0	7	\|a Boolesche Funktion \|0 (DE-588)4146281-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Parallelverarbeitung \|0 (DE-588)4075860-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Schaltnetz \|0 (DE-588)4052053-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a PRAM \|g Informatik \|0 (DE-588)4361282-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Speicherzugriff \|0 (DE-588)4182148-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Zeitkomplexität \|0 (DE-588)4258103-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a Speicherzugriff \|0 (DE-588)4182148-8 \|D s
689	0	1	\|a Zeitkomplexität \|0 (DE-588)4258103-5 \|D s
689	0	2	\|a Boolesche Funktion \|0 (DE-588)4146281-6 \|D s
689	0		\|5 DE-604
689	1	0	\|a PRAM \|g Informatik \|0 (DE-588)4361282-9 \|D s
689	1	1	\|a Schaltnetz \|0 (DE-588)4052053-5 \|D s
689	1	2	\|a Speicherzugriff \|0 (DE-588)4182148-8 \|D s
689	1	3	\|a Parallelverarbeitung \|0 (DE-588)4075860-6 \|D s
689	1	4	\|a Zeitkomplexität \|0 (DE-588)4258103-5 \|D s
689	1		\|5 DE-604
856	4	2	\|m DNB Datenaustausch \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006600019&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-006600019

Record in the Search Index

DE-BY-TUM_call_number	0001 DM 16293 0109 2.94 B 898
DE-BY-TUM_katkey	643049
DE-BY-TUM_location	Mag 01
DE-BY-TUM_media_number	TEMP2065220 040020206008
_version_	1821938258310856705
any_adam_object	1
author	Rossmanith, Peter
author_GND	(DE-588)1084817721
author_facet	Rossmanith, Peter
author_role	aut
author_sort	Rossmanith, Peter
author_variant	p r pr
building	Verbundindex
bvnumber	BV009959608
classification_tum	DAT 517d DAT 406d DAT 549d
ctrlnum	(OCoLC)75552890 (DE-599)BVBBV009959608
discipline	Informatik
format	Thesis Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02143nam a2200517 c 4500</leader><controlfield tag="001">BV009959608</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230116 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">941221s1994 xx d\|\|\| m\|\|\| 00\|\|\| engod</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">943202728</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75552890</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009959608</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-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 406d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 549d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rossmanith, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1084817721</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions</subfield><subfield code="c">Peter Rossmanith</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">113 S.</subfield><subfield code="b">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="502" ind1=" " ind2=" "><subfield code="a">München, Techn. Univ., Diss., 1994</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Boolesche Funktion</subfield><subfield code="0">(DE-588)4146281-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schaltnetz</subfield><subfield code="0">(DE-588)4052053-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">PRAM</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4361282-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Speicherzugriff</subfield><subfield code="0">(DE-588)4182148-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zeitkomplexität</subfield><subfield code="0">(DE-588)4258103-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Speicherzugriff</subfield><subfield code="0">(DE-588)4182148-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Zeitkomplexität</subfield><subfield code="0">(DE-588)4258103-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Boolesche Funktion</subfield><subfield code="0">(DE-588)4146281-6</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">PRAM</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4361282-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Schaltnetz</subfield><subfield code="0">(DE-588)4052053-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Speicherzugriff</subfield><subfield code="0">(DE-588)4182148-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><subfield code="a">Zeitkomplexität</subfield><subfield code="0">(DE-588)4258103-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006600019&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006600019</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV009959608
illustrated	Illustrated
indexdate	2024-12-20T09:45:14Z
institution	BVB
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-006600019
oclc_num	75552890
open_access_boolean
owner	DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-29T DE-12 DE-706 DE-11 DE-188
owner_facet	DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-29T DE-12 DE-706 DE-11 DE-188
physical	113 S. graph. Darst.
publishDate	1994
publishDateSearch	1994
publishDateSort	1994
record_format	marc
spellingShingle	Rossmanith, Peter Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions Boolesche Funktion (DE-588)4146281-6 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Schaltnetz (DE-588)4052053-5 gnd PRAM Informatik (DE-588)4361282-9 gnd Speicherzugriff (DE-588)4182148-8 gnd Zeitkomplexität (DE-588)4258103-5 gnd
subject_GND	(DE-588)4146281-6 (DE-588)4075860-6 (DE-588)4052053-5 (DE-588)4361282-9 (DE-588)4182148-8 (DE-588)4258103-5 (DE-588)4113937-9
title	Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions
title_auth	Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions
title_exact_search	Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions
title_full	Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions Peter Rossmanith
title_fullStr	Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions Peter Rossmanith
title_full_unstemmed	Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions Peter Rossmanith
title_short	Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions
title_sort	characterizations of memory access for pram s and bounds on the time complexity of boolean functions
topic	Boolesche Funktion (DE-588)4146281-6 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Schaltnetz (DE-588)4052053-5 gnd PRAM Informatik (DE-588)4361282-9 gnd Speicherzugriff (DE-588)4182148-8 gnd Zeitkomplexität (DE-588)4258103-5 gnd
topic_facet	Boolesche Funktion Parallelverarbeitung Schaltnetz PRAM Informatik Speicherzugriff Zeitkomplexität Hochschulschrift
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006600019&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT rossmanithpeter characterizationsofmemoryaccessforpramsandboundsonthetimecomplexityofbooleanfunctions

Availability

Order (Login required)

Table of Contents
Order paper/chapter scan

Closed Stacks

Holdings details from Bibliotheksmagazin
Call Number:	0001 DM 16293 Floor plan
Copy 1	Available for loan On Shelf

Branch Library Mathematics & Informatics, Dissertations and Theses

Holdings details from Teilbibliothek Mathematik & Informatik, Dissertationen und Abschlussarbeiten
Call Number:	0109 2.94 B 898 Floor plan
Copy 1	Available for loan On Shelf