Verfügbarkeit: WALCOM: algorithms and computation | Technische Universität München

WALCOM: algorithms and computation: 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings

Gespeichert in:

Bibliographische Detailangaben
Körperschaft:	WALCOM Gauhati (VerfasserIn)
Weitere beteiligte Personen:	Das, Gautam Kumar (HerausgeberIn), Mandal, Partha S. (HerausgeberIn), Mukhopadhyaya, Krishnendu (HerausgeberIn), Nakano, Shin-ichi (HerausgeberIn)
Format:	Elektronisch Tagungsbericht E-Book
Sprache:	Englisch
Veröffentlicht:	Cham, Switzerland Springer 2019
Ausgabe:	Corrected publication
Schriftenreihe:	Lecture notes in computer science 11355 : Theoretical computer science and general issues
Schlagwörter:	Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing Math Applications in Computer Science Data Structures Computer software Computational complexity Electronic data processing Computer science Data structures (Computer scienc Graph Approximationsalgorithmus Informatik Algorithmische Geometrie Graphenzeichnen Algorithmus Berechnungskomplexität Konferenzschrift
Links:	https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8 https://doi.org/10.1007/978-3-030-10564-8
Umfang:	1 Online-Ressource (xv, 420 Seiten) Illustrationen, Diagramme
ISBN:	9783030105648
DOI:	10.1007/978-3-030-10564-8

Internformat

MARC


LEADER	00000nam a2200000zcb4500
001	BV045500702
003	DE-604
005	20220119
007	cr\|uuu---uuuuu
008	190307s2019 xx a\|\|\| o\|\|\|\| 10\|\|\| eng d
020			\|a 9783030105648 \|c Online \|9 978-3-030-10564-8
024	7		\|a 10.1007/978-3-030-10564-8 \|2 doi
035			\|a (ZDB-2-SCS)9783030105648
035			\|a (ZDB-2-LNC)9783030105648
035			\|a (OCoLC)1089712830
035			\|a (DE-599)BVBBV045500702
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
049			\|a DE-355 \|a DE-860 \|a DE-91 \|a DE-19 \|a DE-Aug4 \|a DE-898 \|a DE-861 \|a DE-523 \|a DE-859 \|a DE-473 \|a DE-29 \|a DE-863 \|a DE-20 \|a DE-862 \|a DE-92 \|a DE-573 \|a DE-M347 \|a DE-703 \|a DE-706 \|a DE-739 \|a DE-634
082	0		\|a 005.1 \|2 23
084			\|a DAT 000 \|2 stub
084			\|a DAT 530 \|2 stub
111	2		\|a WALCOM \|n 13. \|d 2019 \|c Gauhati \|j Verfasser \|0 (DE-588)1176442570 \|4 aut
245	1	0	\|a WALCOM: algorithms and computation \|b 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings \|c Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.)
250			\|a Corrected publication
264		1	\|a Cham, Switzerland \|b Springer \|c 2019
300			\|a 1 Online-Ressource (xv, 420 Seiten) \|b Illustrationen, Diagramme
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 11355 \|a Theoretical computer science and general issues
650		4	\|a Algorithm Analysis and Problem Complexity
650		4	\|a Discrete Mathematics in Computer Science
650		4	\|a Numeric Computing
650		4	\|a Math Applications in Computer Science
650		4	\|a Data Structures
650		4	\|a Computer software
650		4	\|a Computational complexity
650		4	\|a Electronic data processing
650		4	\|a Computer science
650		4	\|a Data structures (Computer scienc
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Informatik \|0 (DE-588)4026894-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmische Geometrie \|0 (DE-588)4130267-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graphenzeichnen \|0 (DE-588)4706480-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|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 \|2 gnd-content
689	0	0	\|a Informatik \|0 (DE-588)4026894-9 \|D s
689	0	1	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	0	2	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0	3	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	0	4	\|a Graphenzeichnen \|0 (DE-588)4706480-8 \|D s
689	0	5	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	0		\|5 DE-604
689	1	0	\|a Algorithmische Geometrie \|0 (DE-588)4130267-9 \|D s
689	1		\|8 1\p \|5 DE-604
700	1		\|a Das, Gautam Kumar \|4 edt
700	1		\|a Mandal, Partha S. \|4 edt
700	1		\|a Mukhopadhyaya, Krishnendu \|4 edt
700	1		\|a Nakano, Shin-ichi \|4 edt
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-3-030-10563-1
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-3-030-10565-5
830		0	\|a Lecture notes in computer science \|v 11355 : Theoretical computer science and general issues \|w (DE-604)BV014880109 \|9 11355
856	4	0	\|u https://doi.org/10.1007/978-3-030-10564-8 \|x Verlag \|z URL des Erstveröffentlichers \|3 Volltext
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
912			\|a ZDB-2-SCS
912			\|a ZDB-2-LNC
940	1		\|q ZDB-2-SCS_2019
940	1		\|q ZDB-2-LNC_2019
943	1		\|a oai:aleph.bib-bvb.de:BVB01-030885403
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-634 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-Aug4 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-573 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-M347 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-92 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-898 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-859 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-860 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-861 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-863 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-862 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-523 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-91 \|p ZDB-2-LNC \|q ZDB-2-LNC_2019 \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-473 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-19 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-355 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-703 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-20 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-706 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-29 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-10564-8 \|l DE-739 \|p ZDB-2-LNC \|x Verlag \|3 Volltext

Datensatz im Suchindex

DE-BY-OTHR_katkey	6109717
DE-BY-TUM_katkey	2395803
_version_	1831257266703040512
adam_text
any_adam_object
author2	Das, Gautam Kumar Mandal, Partha S. Mukhopadhyaya, Krishnendu Nakano, Shin-ichi
author2_role	edt edt edt edt
author2_variant	g k d gk gkd p s m ps psm k m km s i n sin
author_corporate	WALCOM Gauhati
author_corporate_role	aut
author_facet	Das, Gautam Kumar Mandal, Partha S. Mukhopadhyaya, Krishnendu Nakano, Shin-ichi WALCOM Gauhati
author_sort	WALCOM Gauhati
building	Verbundindex
bvnumber	BV045500702
classification_rvk	SS 4800
classification_tum	DAT 000 DAT 530
collection	ZDB-2-SCS ZDB-2-LNC
ctrlnum	(ZDB-2-SCS)9783030105648 (ZDB-2-LNC)9783030105648 (OCoLC)1089712830 (DE-599)BVBBV045500702
dewey-full	005.1
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.1
dewey-search	005.1
dewey-sort	15.1
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
doi_str_mv	10.1007/978-3-030-10564-8
edition	Corrected publication
format	Electronic Conference Proceeding eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV045500702</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220119</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">190307s2019 xx a\|\|\| o\|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030105648</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-030-10564-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-030-10564-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)9783030105648</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-LNC)9783030105648</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1089712830</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045500702</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">13.</subfield><subfield code="d">2019</subfield><subfield code="c">Gauhati</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1176442570</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">WALCOM: algorithms and computation</subfield><subfield code="b">13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings</subfield><subfield code="c">Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.)</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Corrected publication</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham, Switzerland</subfield><subfield code="b">Springer</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xv, 420 Seiten)</subfield><subfield code="b">Illustrationen, Diagramme</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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">11355</subfield><subfield code="a">Theoretical computer science and general issues</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numeric Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Math Applications in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer scienc</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</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="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="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="3"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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="700" ind1="1" ind2=" "><subfield code="a">Das, Gautam Kumar</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mandal, Partha S.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mukhopadhyaya, Krishnendu</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nakano, Shin-ichi</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-030-10563-1</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-030-10565-5</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">11355 : Theoretical computer science and general issues</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">11355</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</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="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2019</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-LNC_2019</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030885403</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-Aug4</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-573</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-M347</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-898</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-859</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-860</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-861</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-863</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-862</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-523</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="q">ZDB-2-LNC_2019</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-19</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-703</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-20</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-29</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-10564-8</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift gnd-content
genre_facet	Konferenzschrift
id	DE-604.BV045500702
illustrated	Illustrated
indexdate	2025-01-11T19:08:48Z
institution	BVB
institution_GND	(DE-588)1176442570
isbn	9783030105648
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-030885403
oclc_num	1089712830
open_access_boolean
owner	DE-355 DE-BY-UBR DE-860 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-20 DE-862 DE-BY-FWS DE-92 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634
owner_facet	DE-355 DE-BY-UBR DE-860 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-20 DE-862 DE-BY-FWS DE-92 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634
physical	1 Online-Ressource (xv, 420 Seiten) Illustrationen, Diagramme
psigel	ZDB-2-SCS ZDB-2-LNC ZDB-2-SCS_2019 ZDB-2-LNC_2019 ZDB-2-LNC ZDB-2-LNC_2019
publishDate	2019
publishDateSearch	2019
publishDateSort	2019
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science Theoretical computer science and general issues
spellingShingle	WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings Lecture notes in computer science Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing Math Applications in Computer Science Data Structures Computer software Computational complexity Electronic data processing Computer science Data structures (Computer scienc Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Informatik (DE-588)4026894-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd
subject_GND	(DE-588)4021842-9 (DE-588)4500954-5 (DE-588)4026894-9 (DE-588)4130267-9 (DE-588)4706480-8 (DE-588)4001183-5 (DE-588)4134751-1 (DE-588)1071861417
title	WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings
title_auth	WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings
title_exact_search	WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings
title_full	WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.)
title_fullStr	WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.)
title_full_unstemmed	WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.)
title_short	WALCOM: algorithms and computation
title_sort	walcom algorithms and computation 13th international conference walcom 2019 guwahati india february 27 march 2 2019 proceedings
title_sub	13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, proceedings
topic	Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing Math Applications in Computer Science Data Structures Computer software Computational complexity Electronic data processing Computer science Data structures (Computer scienc Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Informatik (DE-588)4026894-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd
topic_facet	Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing Math Applications in Computer Science Data Structures Computer software Computational complexity Electronic data processing Computer science Data structures (Computer scienc Graph Approximationsalgorithmus Informatik Algorithmische Geometrie Graphenzeichnen Algorithmus Berechnungskomplexität Konferenzschrift
url	https://doi.org/10.1007/978-3-030-10564-8
volume_link	(DE-604)BV014880109
work_keys_str_mv	AT walcomgauhati walcomalgorithmsandcomputation13thinternationalconferencewalcom2019guwahatiindiafebruary27march22019proceedings AT dasgautamkumar walcomalgorithmsandcomputation13thinternationalconferencewalcom2019guwahatiindiafebruary27march22019proceedings AT mandalparthas walcomalgorithmsandcomputation13thinternationalconferencewalcom2019guwahatiindiafebruary27march22019proceedings AT mukhopadhyayakrishnendu walcomalgorithmsandcomputation13thinternationalconferencewalcom2019guwahatiindiafebruary27march22019proceedings AT nakanoshinichi walcomalgorithmsandcomputation13thinternationalconferencewalcom2019guwahatiindiafebruary27march22019proceedings

Verfügbarkeit

Bestellen (Login erforderlich)

Online lesen