Verfügbarkeit: Mathematical foundations of computer science 2011

Mathematical foundations of computer science 2011: 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings

Gespeichert in:

Bibliographische Detailangaben
Format:	Tagungsbericht Buch
Sprache:	English
Veröffentlicht:	Heidelberg [u.a.] Springer 2011
Schriftenreihe:	Lecture notes in computer science 6907
Schlagworte:	Theoretische Informatik Konferenzschrift > 2011 > Warschau
Online-Zugang:	Inhaltstext Inhaltsverzeichnis
Beschreibung:	Literaturangaben
Beschreibung:	XV, 618 S. graph. Darst.
ISBN:	9783642229923 3642229921

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV039558734
003	DE-604
005	20111115
007	t\|
008	110901s2011 xx d\|\|\| \|\|\|\| 10\|\|\| eng d
016	7		\|a 1013327071 \|2 DE-101
020			\|a 9783642229923 \|9 978-3-642-22992-3
020			\|a 3642229921 \|9 3-642-22992-1
035			\|a (OCoLC)751012792
035			\|a (DE-599)DNB1013327071
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-11 \|a DE-706 \|a DE-83 \|a DE-91G
082	0		\|a 005.1015113 \|2 22/ger
084			\|a 004 \|2 sdnb
084			\|a 510 \|2 sdnb
084			\|a DAT 500f \|2 stub
245	1	0	\|a Mathematical foundations of computer science 2011 \|b 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings \|c Filip Murlak ... (ed.)
264		1	\|a Heidelberg [u.a.] \|b Springer \|c 2011
300			\|a XV, 618 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 6907
500			\|a Literaturangaben
650	0	7	\|a Theoretische Informatik \|0 (DE-588)4196735-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2011 \|z Warschau \|2 gnd-content
689	0	0	\|a Theoretische Informatik \|0 (DE-588)4196735-5 \|D s
689	0		\|5 DE-604
700	1		\|a Murlak, Filip \|e Sonstige \|4 oth
711	2		\|a MFCS \|n 36 \|d 2011 \|c Warschau \|j Sonstige \|0 (DE-588)16168299-6 \|4 oth
830		0	\|a Lecture notes in computer science \|v 6907 \|w (DE-604)BV000000607 \|9 6907
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=3850536&prov=M&dok_var=1&dok_ext=htm \|3 Inhaltstext
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=024410463&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-024410463

Datensatz im Suchindex

_version_	1820875338956144640
adam_text	IMAGE 1 TABLE OF CONTENTS INVITED PAPERS NEAREST NEIGHBOR SEARCH IN HIGH-DIMENSIONAL SPACES (ABSTRACT) 1 ALEXANDR ANDONI INVARIANTIZATION OF LISTINGS (ABSTRACT) 2 JOERG FLUM DUALITY AND RECOGNITION 3 MAI GEHRKE SOME VARIANTS OF THE STAR HEIGHT PROBLEM 19 DANIEL KIRSTEN GENERIC TECHNIQUES TO ROUND SDP RELAXATIONS (ABSTRACT) 34 PRASAD RAGHAVENDRA NEW PROOFS IN GRAPH MINORS (ABSTRACT) 35 PAUL WOLLAN CONTRIBUTED PAPERS THE LEAST-CORE OF THRESHOLD NETWORK FLOW GAMES 36 YORAM BACHRACH ADHESIVITY IS NOT ENOUGH: LOCAL CHURCH-ROSSER REVISITED 48 PAOLO BALDAN, FABIO GADDUCD, AND PAWEL SOBOCIRISKI QUANTITATIVE REFINEMENT FOR WEIGHTED MODAL TRANSITION SYSTEMS 60 SEBASTIAN S. BAUER, ULI FAHRENBERG, LINE JUHL, KIM G. LARSEN, AXEL LEGAY, AND CLAUS THRONE FASTER COUPON COLLECTING VIA REPLICATION WITH APPLICATIONS IN GOSSIPING 72 PETRA BERENBRINK, ROBERT ELSAESSER, TOM FRIEDETZKY, LARS NAGEL, AND THOMAS SAUERWALD VERIFYING PROOFS IN CONSTANT DEPTH 84 OLAF BEYERSDORFF, SAMIR DATTA, MEENA MAHAJAN, GIDO SCHARFENBERGER-FABIAN, KARTEEK SREENIVASAIAH, MICHAEL THOMAS, AND HERIBERT VOLLMER BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1013327071 DIGITALISIERT DURCH IMAGE 2 XII TABLE OF CONTENTS THE COMPLEXITY OF THE COVER POLYNOMIALS FOR PLANAR GRAPHS OF BOUNDED DEGREE 96 MARKUS BLAESER AND RADU CURTICAPEAN MODEL CHECKING COVERABILITY GRAPHS OF VECTOR ADDITION SYSTEMS 108 MICHEL BLOCKELET AND SYLVAIN SCHMITZ HARD FUNCTIONS FOR LOW-DEGREE POLYNOMIALS OVER PRIME FIELDS 120 ANDREJ BOGDANOV, AKINORI KAWACHI, AND HIDETOKI TANAKA TEMPORAL LOGICS FOR CONCURRENT RECURSIVE PROGRAMS: SATISFIABILITY AND MODEL CHECKING 132 BENEDIKT BOLLIG, AISWARYA CYRIAC, PAUL GASTIN, AND MARC ZEITOUN THE REACHABILITY PROBLEM FOR VECTOR ADDITION SYSTEM WITH ONE ZERO-TEST 145 REMI BONNET THE BOUNDED SEARCH TREE ALGORITHM FOR THE CLOSEST STRING PROBLEM HAS QUADRATIC SMOOTHED COMPLEXITY 158 CHRISTINA BOUCHER SOLVING ANALYTIC DIFFERENTIAL EQUATIONS IN POLYNOMIAL TIME OVER UNBOUNDED DOMAINS 170 OLIVIER BOURNEZ, DANIEL S. GRACA, AND AMAURY POULY PATTERN-GUIDED DATA ANONYMIZATION AND CLUSTERING 182 ROBERT BREDERECK, ANDRE NICHTERLEIN, ROLF NIEDERMEIER, AND GEEVARGHESE PHILIP LANGUAGE EQUIVALENCE OF DETERMINISTIC REAL-TIME ONE-COUNTER AUTOMATA IS IML-COMPLETE 194 STANISLAV BOEHM AND STEFAN GOELLER ENERGY AND MEAN-PAYOFF PARITY MARKOV DECISION PROCESSES 206 KRISHNENDU CHATTERJEE AND LAURENT DOYEN THE ROLE OF POLYMORPHISM IN THE CHARACTERISATION OF COMPLEXITY BY SOFT TYPES 219 JACEK CHRZQSZCZ AND ALEKSY SCHUBERT AN ALGEBRAIC THEORY OF COMPLEXITY FOR VALUED CONSTRAINTS: ESTABLISHING A GALOIS CONNECTION 231 DAVID A. COHEN, PAIDI CREED, PETER G. JEAVONS, AND STANISLAV ZIVNY ON THE USE OF GUARDS FOR LOGICS WITH DATA 243 THOMAS COLCOMBET, CLEMENS LEY, AND GABRIELE PUPPIS IMAGE 3 TABLE OF CONTENTS XIII AN ELEMENTARY PROOF OF A 2 N-O(N) LOWER BOUND ON THE CIRCUIT COMPLEXITY OF AFFINE DISPERSERS 256 EVGENY DEMENKOV AND ALEXANDER S. KULIKOV ON THE COMPLEXITY OF THE Z-DIVERSITY PROBLEM 266 RICCARDO DONDI, GIANCARLO MAURI, AND ITALO ZOPPIS INFINITE SYNCHRONIZING WORDS FOR PROBABILISTIC AUTOMATA 278 LAURENT DOYEN, THIERRY MASSART, AND MAHSA SHIRMOHAMMADI CHARACTERIZING EF OVER INFINITE TREES AND MODAL LOGIC ON TRANSITIVE GRAPHS 290 BALDER TEN CATE AND ALESSANDRO FACCHINI PARITY GAMES ON GRAPHS WITH MEDIUM TREE-WIDTH 303 JOHN FEARNLEY AND ODED LACHISH SATISFIABILITY OF SYSTEMS OF EQUATIONS OF REAL ANALYTIC FUNCTIONS IS QUASI-DECIDABLE 315 PETER FRANEK, STEFAN RATSCHAN, AND PIOTR ZGLICZYNSKI ON MINIMISING AUTOMATA WITH ERRORS 327 PAWEL GAWRYCHOWSKI, ARTUR JEZ, AND ANDREAS MALETTI CONTRACTING A CHORDAL GRAPH TO A SPLIT GRAPH OR A TREE 339 PETR A. GOLOVACH, MARCIN KAMINSKI, AND DANIEL PAULUSMA QUANTUM FINITE AUTOMATA AND PROBABILISTIC REVERSIBLE AUTOMATA: R-TRIVIAL IDEMPOTENT LANGUAGES 351 MARATS GOLOVKINS, MAKSIM KRAVTSEV, AND VASILIJS KRAVCEVS A UNIVERSALLY DEFINED UNDECIDABLE UNIMODAL LOGIC 364 EDITH HEMASPAANDRA AND HENNING SCHNOOR ON THE APPROXIMABILITY OF MINIMUM TOPIC CONNECTED OVERLAY AND ITS SPECIAL INSTANCES 376 JUN HOSODA, JURAJ HROMKOVIC, TAISUKE IZUMI, HIROTAKA ONO, MONIKA STEINOVA, AND KOICHI WADA CAN EVERYBODY SIT CLOSER TO THEIR FRIENDS THAN THEIR ENEMIES? 388 ANNE-MARIE KERMARREC AND CHRISTOPHER THRAVES SUBMODULARITY ON A TREE: UNIFYING .L''-CONVEX AND BISUBMODULAR FUNCTIONS 400 VLADIMIR KOLMOGOROV IMAGE 4 XIV TABLE OF CONTENTS STREAMING ALGORITHMS FOR RECOGNIZING NEARLY WELL-PARENTHESIZED EXPRESSIONS 412 ANDREAS KREBS, NUTAN LIMAYE, AND SRIKANTH SRINIVASAN SIZE AND COMPUTATION OF INJECTIVE TREE AUTOMATIC PRESENTATIONS 424 DIETRICH KUSKE AND THOMAS WEIDNER SYMMETRIC FUNCTIONS CAPTURE GENERAL FUNCTIONS 436 RICHARD J. LIPTON, KENNETH W. REGAN, AND A TRI RUDRA COMPRESSED WORD PROBLEMS FOR INVERSE MONOIDS 448 MARKUS LOHREY PUSHING FOR WEIGHTED TREE AUTOMATA 460 ANDREAS MALETTI AND DANIEL QUERNHEIM PERIODICITY ALGORITHMS FOR PARTIAL WORDS 472 FLORIN MANEA, ROBERT MERCA§, AND CAETAELIN TISEANU STATE COMPLEXITY OF OPERATIONS ON INPUT-DRIVEN PUSHDOWN AUTOMATA 485 ALEXANDER OKHOTIN AND KAI SALOMAA CONFLICT PACKING YIELDS LINEAR VERTEX-KERNELS FOR FC-FAST, FC-DENSE RTI AND A RELATED PROBLEM 497 CHRISTOPHE PAUL, ANTHONY PEREZ, AND STEPHAN THOMASSE TRANSDUCTION ON KADANOFF SAND PILE MODEL AVALANCHES, APPLICATION TO WAVE PATTERN EMERGENCE 508 KEVIN PERROT AND ERIC REMILA PROBLEMS PARAMETERIZED BY TREEWIDTH TRACTABLE IN SINGLE EXPONENTIAL TIME: A LOGICAL APPROACH 520 MICHAL PILIPCZUK DISTRIBUTED SYNTHESIS FOR REGULAR AND CONTEXTFREE SPECIFICATIONS 532 WLADIMIR FRIDMAN AND BERND PUCHALA GEOMETRIC GRAPHS WITH RANDOMLY DELETED EDGES - CONNECTIVITY AND ROUTING PROTOCOLS 544 KRZYSZTOF KRZYWDZINSKI AND KATARZYNA RYBARCZYK UNTIMED LANGUAGE PRESERVATION IN TIMED SYSTEMS 556 OCAN SANKUR LOWER BOUNDS FOR LINEAR DECISION TREES VIA AN ENERGY COMPLEXITY ARGUMENT 568 KEI UCHIZAWA AND EIJI TAKIMOTO IMAGE 5 TABLE OF CONTENTS XV WEAK COST MONADIC LOGIC OVER INFINITE TREES 580 MICHAEL VANDEN BOOM LINEAR PROBLEM KERNELS FOR PLANAR GRAPH PROBLEMS WITH SMALL DISTANCE PROPERTY 592 JIANXIN WANG, YONGJIE YANG, JIONG GUO, AND JIANER CHEN NEW PARAMETERIZED ALGORITHMS FOR THE EDGE DOMINATING SET PROBLEM 604 MINGYU XIAO, TON KLOKS, AND SHEUNG-HUNG POON AUTHOR INDEX 617
any_adam_object	1
building	Verbundindex
bvnumber	BV039558734
classification_rvk	SS 4800
classification_tum	DAT 500f
ctrlnum	(OCoLC)751012792 (DE-599)DNB1013327071
dewey-full	005.1015113
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.1015113
dewey-search	005.1015113
dewey-sort	15.1015113
dewey-tens	000 - Computer science, information, general works
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">BV039558734</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111115</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">110901s2011 xx d\|\|\| \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1013327071</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642229923</subfield><subfield code="9">978-3-642-22992-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642229921</subfield><subfield code="9">3-642-22992-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)751012792</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1013327071</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-11</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1015113</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematical foundations of computer science 2011</subfield><subfield code="b">36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings</subfield><subfield code="c">Filip Murlak ... (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Heidelberg [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 618 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="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">6907</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-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">2011</subfield><subfield code="z">Warschau</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</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">Murlak, Filip</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">MFCS</subfield><subfield code="n">36</subfield><subfield code="d">2011</subfield><subfield code="c">Warschau</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16168299-6</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">6907</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6907</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3850536&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=024410463&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-024410463</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2011 Warschau gnd-content
genre_facet	Konferenzschrift 2011 Warschau
id	DE-604.BV039558734
illustrated	Illustrated
indexdate	2025-01-10T15:14:03Z
institution	BVB
institution_GND	(DE-588)16168299-6
isbn	9783642229923 3642229921
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-024410463
oclc_num	751012792
open_access_boolean
owner	DE-11 DE-706 DE-83 DE-91G DE-BY-TUM
owner_facet	DE-11 DE-706 DE-83 DE-91G DE-BY-TUM
physical	XV, 618 S. graph. Darst.
publishDate	2011
publishDateSearch	2011
publishDateSort	2011
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spelling	Mathematical foundations of computer science 2011 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings Filip Murlak ... (ed.) Heidelberg [u.a.] Springer 2011 XV, 618 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 6907 Literaturangaben Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2011 Warschau gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Murlak, Filip Sonstige oth MFCS 36 2011 Warschau Sonstige (DE-588)16168299-6 oth Lecture notes in computer science 6907 (DE-604)BV000000607 6907 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3850536&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024410463&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Mathematical foundations of computer science 2011 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings Lecture notes in computer science Theoretische Informatik (DE-588)4196735-5 gnd
subject_GND	(DE-588)4196735-5 (DE-588)1071861417
title	Mathematical foundations of computer science 2011 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings
title_auth	Mathematical foundations of computer science 2011 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings
title_exact_search	Mathematical foundations of computer science 2011 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings
title_full	Mathematical foundations of computer science 2011 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings Filip Murlak ... (ed.)
title_fullStr	Mathematical foundations of computer science 2011 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings Filip Murlak ... (ed.)
title_full_unstemmed	Mathematical foundations of computer science 2011 36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings Filip Murlak ... (ed.)
title_short	Mathematical foundations of computer science 2011
title_sort	mathematical foundations of computer science 2011 36th international symposium mfcs 2011 warsaw poland august 22 26 2011 proceedings
title_sub	36th international symposium, MFCS 2011, Warsaw, Poland, August 22 - 26, 2011 ; proceedings
topic	Theoretische Informatik (DE-588)4196735-5 gnd
topic_facet	Theoretische Informatik Konferenzschrift 2011 Warschau
url	http://deposit.dnb.de/cgi-bin/dokserv?id=3850536&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024410463&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT murlakfilip mathematicalfoundationsofcomputerscience201136thinternationalsymposiummfcs2011warsawpolandaugust22262011proceedings AT mfcswarschau mathematicalfoundationsofcomputerscience201136thinternationalsymposiummfcs2011warsawpolandaugust22262011proceedings

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Beschreibung

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge