Verfügbarkeit: Algorithms and complexity

Algorithms and complexity: 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings

Gespeichert in:

Bibliographische Detailangaben
Format:	Tagungsbericht Buch
Sprache:	English
Veröffentlicht:	Berlin u.a. Springer 2003
Schriftenreihe:	Lecture notes in computer science 2653
Schlagworte:	Algorithmes - Congrès Algoritmen Complexiteit Complexité de calcul (Informatique) - Congrès Computerwiskunde Algorithms > Congresses Computational complexity > Congresses Komplexitätstheorie Algorithmus Konferenzschrift > 2003 > Rom
Online-Zugang:	Inhaltsverzeichnis
Beschreibung:	X, 288 S.
ISBN:	3540401768

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV017159410
003	DE-604
005	20030718
007	t\|
008	030520s2003 gw \|\|\|\| 10\|\|\| eng d
016	7		\|a 967569818 \|2 DE-101
020			\|a 3540401768 \|9 3-540-40176-8
035			\|a (OCoLC)52288775
035			\|a (DE-599)BVBBV017159410
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a gw \|c DE
049			\|a DE-384 \|a DE-91G \|a DE-11 \|a DE-706
050		0	\|a QA9.58
082	0		\|a 511/.8 \|2 21
084			\|a DAT 517f \|2 stub
084			\|a DAT 530f \|2 stub
245	1	0	\|a Algorithms and complexity \|b 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings \|c Rossella Petreschi ... (eds.)
264		1	\|a Berlin u.a. \|b Springer \|c 2003
300			\|a X, 288 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 2653
650		4	\|a Algorithmes - Congrès
650		7	\|a Algoritmen \|2 gtt
650		7	\|a Complexiteit \|2 gtt
650		4	\|a Complexité de calcul (Informatique) - Congrès
650		7	\|a Computerwiskunde \|2 gtt
650		4	\|a Algorithms \|v Congresses
650		4	\|a Computational complexity \|v Congresses
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2003 \|z Rom \|2 gnd-content
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0	1	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	0		\|5 DE-604
700	1		\|a Petreschi, Rossella \|e Sonstige \|4 oth
711	2		\|a CIAC \|n 5 \|d 2003 \|c Rom \|j Sonstige \|0 (DE-588)10058396-9 \|4 oth
830		0	\|a Lecture notes in computer science \|v 2653 \|w (DE-604)BV000000607 \|9 2653
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=010344061&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-010344061

Datensatz im Suchindex

_version_	1826220041748611072
adam_text	TABLE OF CONTENTS TUTORIALS LOCALIZED NETWORK R.EPRESENTATIONS 1 DAVID PELEG OPTIMA] BINARY SEARCH TREES WITH COSTS DEPENDING UN THE ACCESS PATHS . 2 JAYRNE L. SZWARCFITER ON THE GENERATION OF EXTENSIONS OF A PARTIA.UEY ORDCRED SET 3 JAYME L. SZWARCFITER ERROR-CORREETING CODES IN COMPLEXILY THEORY 4 LUCA TREVISAN INVITED TALKS C'ACHSS-OBLIVIOUS ALGORITHMS 5 CHARTEN E. LEISERSON SPANNING TREES WITH LOW MAXIMUM/AVERAGE STRETCH G DAVID PELEG HYPER ENCRYPTION AND EVERLASTING SEOROTS 7 MICHAEL O. RUBIN COMPUTING WITH ELECTRONIC NANOTOCHNOLOGIES 11 JOHN E, SAVAGE REGIILAR CONTRIBUTION EFFICIENT UPDATE SFRATEGIES FOR GEOMETRIE COMPUTING WITH UNCERTAINTY . 12 RICHARD BRUCE, MICHAEL. HOFFMANN, DANNY KRIZANC, RAJEEV RAMAN MAXIMIZING THE GUARDED BOUNDARY OF AN ART GAJLERV IS APX-COMPK-ITO . . 24 E. MARKOU, S. ZACHOS, C. FRAGOUDAKIS AN IMPROVED ALGORITHM FOR POINT SET PACTERN MATCHING UNDER RIGID MOTION 36 ARI.JIT BISHNU, SANDIP DAS, SUBHAS C. NANDY. BHARGAH B. BHATTACHARYA UNLOCKING THE ADVANTAGES OF DYNAMIC SERVICE SELECTION AND PRICING 46 ILALA KAHJANASUNDARAM, MAEHE VELAUTHAPUELAI, JOHN WACLAVSSKY THE RELATIVE WORST ORDER RATIO FOR ON-LINE ALGORITHMS 58 JOAN BOYAR, LENE M. FAVRHOLDT X TABLE OF COLI TON T S ON-LINO STREAM MERGING. MAX SPAN, AND MIN COVERAGE 70 WVN-TAT CHAN. TAK-WAH LO-M, FLING-FUNG TRAG, PRUDE.NCC. W.U. WONG RANDOMISED ALGORITLIMS FOR FINDING SMALL WEAKLY-CONNECTED DOMINATING SETS OF REGULAER GRAPHS - 83 WILLIAM DUCKWORTH, BERNARD MANS ADDITIVE SPANNERS FOR AE/-CHORDAL GRAPH 96 VICTOR D. CHEPOI. FEODOR F. DRAGAN, CHENYU YAN GRAPH-MODELED DATA CIUSTERING: FIXED-PARAMETER ALGORILHMS FOR CLIQUE GENERATION 108 JENS GRAMM, MANG QUO, FALK HUEFFNER, ROLF NIEDERMEIER RECONCILING' GEN TREES TO A. SPECIES TREE 120 PA.OLA UTMIZZONI, GIANLUCA DELHI VEDOVA, RICCARDO DONDI GENERATING ALL FOREST EXTENSIONS OF A PARTIALLY ORDERED SET 132 JAYIRTT L. SZWARCFIIER LNDEXING STRUCUIRES FOR APPROXIMATE STRING MATCHING 140 ALEASANDRA GABRIELE, FILLIPPO MIYN-OSI. ANTONIO RESLIVO, MARINELLA SCIORTI.NO APPROXIMATION HARDNESS FOR SMALL OCCURRENEE INSTARIEES OF NP-HARD PROBLEMS 152 MIROSLAV GHLEBIK, JANKA CHLEMKOVD FAST APPROXIMATION OF MINIMUM MULTICAST CONGESTION - IMPLEMENTATION VERSUS THEORY 1 65 ANDREAS BALTZ, ANAND SNVASTAV APPROXIMATION OF A RETRKIVAL PROBLEM FOR PARALLEL IDISKS 178 JOAP AERTS, JAN KORST, FRIIS SPIEKMUA ON FC-EDGE-CONNECUEVITY PROBLEMS WITLI SHARPENED TRIANGLE INEQUALITY . - 189 HANS-JOACHIM BOECKCNLIAUER, DIRK BONGARTZ, JURAJ HROMKOVIC. RALF KLASING, GUIDO PROIEUI, SEBASTIAN SEIBERT., WALTER UNGAR THE OOMPLEXITY OF DETOETIRIG FIXED-DENSITY GINSTERS 201 KLANS HOLZAPFEL. SVEN KOSUB. MORITZ G. MAAFI, BANJO TAEUBIG NEARLY BOUNDED ERROR PROBABILISFIE SETS 213 TOMOYUKI YAMAKAIM SONIC PROPERTIES OF M01) M CIRCUITS COMPUTING SIMPLE FUNCTIONS 227 KAZUYUKI AMUNO. AKRRA MARUOKA XOR-BASED SCHEINES FOR FAST PARALLEL 1P LOOKUPS 238 GIANCARLO BONGIOVANM, PAOLO BENNO. TABIE OF CONTENTS XI. THE IMPAD; OF NETWORK STRUCTURE ON THE STABILITY OF GREEDY PROTOCOLS. . . . 251 DMITRIOS KOUKOPOULOS, MARIOS MAINVNICOLAS. SOTITIS NIKOLELSEAS, PAUL SPVRAKIS IMPROVING CUSTOMER PROXHNITY TO RAIHVAY SLATIONS 2(3-1 EVANGELOS KLANAKTS, PAOLO PTNNA, KONRAD SCHLUDE. DAVID SCOL TAYLOR, PETER WIDMAYER DIFFERENTIAL APPROXIMATION FOR SONIC ROUTING PROBLEMS 277 CRISTINA PAZGAN, REFAEL FFASSIII, JEROME. A'IONNOT AUTHOR INDEX 289
any_adam_object	1
building	Verbundindex
bvnumber	BV017159410
callnumber-first	Q - Science
callnumber-label	QA9
callnumber-raw	QA9.58
callnumber-search	QA9.58
callnumber-sort	QA 19.58
callnumber-subject	QA - Mathematics
classification_rvk	SS 4800
classification_tum	DAT 517f DAT 530f
ctrlnum	(OCoLC)52288775 (DE-599)BVBBV017159410
dewey-full	511/.8
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511/.8
dewey-search	511/.8
dewey-sort	3511 18
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik
format	Conference Proceeding Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV017159410</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030718</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">030520s2003 gw \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">967569818</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540401768</subfield><subfield code="9">3-540-40176-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)52288775</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017159410</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.8</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and complexity</subfield><subfield code="b">5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings</subfield><subfield code="c">Rossella Petreschi ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 288 S.</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="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2653</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computerwiskunde</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-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)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2003</subfield><subfield code="z">Rom</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="700" ind1="1" ind2=" "><subfield code="a">Petreschi, Rossella</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">CIAC</subfield><subfield code="n">5</subfield><subfield code="d">2003</subfield><subfield code="c">Rom</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10058396-9</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2653</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">2653</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=010344061&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-010344061</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2003 Rom gnd-content
genre_facet	Konferenzschrift 2003 Rom
id	DE-604.BV017159410
illustrated	Not Illustrated
indexdate	2025-03-10T15:05:48Z
institution	BVB
institution_GND	(DE-588)10058396-9
isbn	3540401768
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-010344061
oclc_num	52288775
open_access_boolean
owner	DE-384 DE-91G DE-BY-TUM DE-11 DE-706
owner_facet	DE-384 DE-91G DE-BY-TUM DE-11 DE-706
physical	X, 288 S.
publishDate	2003
publishDateSearch	2003
publishDateSort	2003
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spelling	Algorithms and complexity 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings Rossella Petreschi ... (eds.) Berlin u.a. Springer 2003 X, 288 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 2653 Algorithmes - Congrès Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) - Congrès Computerwiskunde gtt Algorithms Congresses Computational complexity Congresses Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2003 Rom gnd-content Algorithmus (DE-588)4001183-5 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 Petreschi, Rossella Sonstige oth CIAC 5 2003 Rom Sonstige (DE-588)10058396-9 oth Lecture notes in computer science 2653 (DE-604)BV000000607 2653 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010344061&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Algorithms and complexity 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings Lecture notes in computer science Algorithmes - Congrès Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) - Congrès Computerwiskunde gtt Algorithms Congresses Computational complexity Congresses Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4120591-1 (DE-588)4001183-5 (DE-588)1071861417
title	Algorithms and complexity 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings
title_auth	Algorithms and complexity 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings
title_exact_search	Algorithms and complexity 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings
title_full	Algorithms and complexity 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings Rossella Petreschi ... (eds.)
title_fullStr	Algorithms and complexity 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings Rossella Petreschi ... (eds.)
title_full_unstemmed	Algorithms and complexity 5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings Rossella Petreschi ... (eds.)
title_short	Algorithms and complexity
title_sort	algorithms and complexity 5th italian conference ciac 2003 rome italy may 28 30 2003 proceedings
title_sub	5th Italian conference, CIAC 2003, Rome, Italy, May 28 - 30, 2003 ; proceedings
topic	Algorithmes - Congrès Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) - Congrès Computerwiskunde gtt Algorithms Congresses Computational complexity Congresses Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Algorithmes - Congrès Algoritmen Complexiteit Complexité de calcul (Informatique) - Congrès Computerwiskunde Algorithms Congresses Computational complexity Congresses Komplexitätstheorie Algorithmus Konferenzschrift 2003 Rom
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010344061&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT petreschirossella algorithmsandcomplexity5thitalianconferenceciac2003romeitalymay28302003proceedings AT ciacrom algorithmsandcomplexity5thitalianconferenceciac2003romeitalymay28302003proceedings

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge