Automata, languages and programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
Saved in:
| Format: | Electronic eBook |
|---|---|
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer
2015
|
| Series: | Lecture Notes in Computer Science
9134 |
| Subjects: | |
| Online Access: | Volltext Inhaltsverzeichnis Abstract |
| Physical Description: | 1 Online-Ressource (XXXI, 1111 p. 78 illus) |
| ISBN: | 9783662476727 9783662476710 |
| ISSN: | 0302-9743 |
| DOI: | 10.1007/978-3-662-47672-7 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042669823 | ||
| 003 | DE-604 | ||
| 005 | 20170419 | ||
| 006 | a |||| 10||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150703s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9783662476727 |c Online |9 978-3-662-47672-7 | ||
| 020 | |a 9783662476710 |c Print |9 978-3-662-47671-0 | ||
| 024 | 7 | |a 10.1007/978-3-662-47672-7 |2 doi | |
| 035 | |a (OCoLC)913220567 | ||
| 035 | |a (DE-599)BVBBV042669823 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-19 |a DE-384 |a DE-Aug4 |a DE-M347 |a DE-573 |a DE-859 |a DE-703 |a DE-473 |a DE-29 |a DE-706 |a DE-20 |a DE-739 |a DE-92 |a DE-634 |a DE-860 |a DE-861 |a DE-355 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 084 | |a DAT 000 |2 stub | ||
| 084 | |a DAT 550f |2 stub | ||
| 245 | 1 | 0 | |a Automata, languages and programming |b 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I |c edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann |
| 264 | 1 | |a Berlin, Heidelberg |b Springer |c 2015 | |
| 300 | |a 1 Online-Ressource (XXXI, 1111 p. 78 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture Notes in Computer Science |v 9134 |x 0302-9743 | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computer Communication Networks | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Information storage and retrieval systems | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Computation by Abstract Devices | |
| 650 | 4 | |a Information Storage and Retrieval | |
| 650 | 4 | |a Information Systems Applications (incl. Internet) | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Informatik | |
| 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 06.07.2015-10.07.2015 |z Kyoto |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Halldórsson, Magnús M. |e Sonstige |4 oth | |
| 830 | 0 | |a Lecture Notes in Computer Science |v 9134 |w (DE-604)BV014880109 |9 9134 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-47672-7 |x Verlag |3 Volltext |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028101907&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028101907&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Abstract |
| 912 | |a ZDB-2-SCS |a ZDB-2-LNC | ||
| 940 | 1 | |q ZDB-2-SCS_2015 | |
| 940 | 1 | |q ZDB-2-LNC_2015 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028101907 | ||
Record in the Search Index
| _version_ | 1804174859811422208 |
|---|---|
| adam_text | AUTOMATA, LANGUAGES, AND PROGRAMMING
/
: 2015
TABLE OF CONTENTS / INHALTSVERZEICHNIS
STATISTICAL RANDOMIZED ENCODINGS: A COMPLEXITY THEORETIC VIEW
TIGHTER FOURIER TRANSFORM LOWER BOUNDS
QUANTIFYING COMPETITIVENESS IN PAGING WITH LOCALITY OF REFERENCE
APPROXIMATION ALGORITHMS FOR COMPUTING MAXIMIN SHARE ALLOCATIONS
ENVY-FREE PRICING IN LARGE MARKETS: APPROXIMATING REVENUE AND WELFARE
BATCHED POINT LOCATION IN SINR DIAGRAMS VIA ALGEBRAIC TOOLS
ON THE RANDOMIZED COMPETITIVE RATIO OF REORDERING BUFFER MANAGEMENT WITH
NON-UNIFORM COSTS
SERVING IN THE DARK SHOULD BE DONE NON-UNIFORMLY
FINDING THE MEDIAN (OBLIVIOUSLY) WITH BOUNDED SPACE
APPROXIMATION ALGORITHMS FOR MIN-SUM K-CLUSTERING
SOLVING LINEAR PROGRAMMING WITH CONSTRAINTS UNKNOWN
DETERMINISTIC RANDOMNESS EXTRACTION FROM GENERALIZED AND DISTRIBUTED
SANTHA-VAZIRANI SOURCES
LIMITATIONS OF ALGEBRAIC APPROACHES TO GRAPH ISOMORPHISM TESTING
FULLY DYNAMIC MATCHING IN BIPARTITE GRAPHS
FEASIBLE INTERPOLATION FOR QBF RESOLUTION CALCULI
SIMULTANEOUS APPROXIMATION OF CONSTRAINT SATISFACTION PROBLEMS
DESIGN OF DYNAMIC ALGORITHMS VIA PRIMAL-DUAL METHOD
WHAT PERCENTAGE OF PROGRAMS HALT?
THE PARITY OF SET SYSTEMS UNDER RANDOM RESTRICTIONS WITH APPLICATIONS TO
EXPONENTIAL TIME PROBLEMS
SPOTTING TREES WITH FEW LEAVES
CONSTRAINT SATISFACTION PROBLEMS OVER THE INTEGERS WITH SUCCESSOR
HARDNESS AMPLIFICATION AND THE APPROXIMATE DEGREE OF CONSTANT-DEPTH
CIRCUITS
ALGORITHMS AND COMPLEXITY FOR TURAEV-VIRO INVARIANTS
BIG DATA ON THE RISE? – TESTING MONOTONICITY OF DISTRIBUTIONS
UNIT INTERVAL EDITING IS FIXED-PARAMETER TRACTABLE
STREAMING ALGORITHMS FOR SUBMODULAR FUNCTION MAXIMIZATION
MULTILINEAR PSEUDORANDOM FUNCTIONS
ZERO-FIXING EXTRACTORS FOR SUB-LOGARITHMIC ENTROPY
INTERACTIVE PROOFS WITH APPROXIMATELY COMMUTING PROVERS
POPULAR MATCHINGS WITH TWO-SIDED PREFERENCES AND ONE-SIDED TIES
BLOCK INTERPOLATION: A FRAMEWORK FOR TIGHT EXPONENTIAL-TIME COUNTING
COMPLEXITY
ON CONVERGENCE AND THRESHOLD PROPERTIES OF DISCRETE LOTKA-VOLTERRA
POPULATION PROTOCOLS
SCHEDULING BIDIRECTIONAL TRAFFIC ON A PATH
ON THE PROBLEM OF APPROXIMATING THE EIGENVALUES OF UNDIRECTED GRAPHS IN
PROBABILISTIC LOGSPACE
ON PLANAR BOOLEAN CSP
ON TEMPORAL GRAPH EXPLORATION
MIND YOUR COINS: FULLY LEAKAGE-RESILIENT SIGNATURES WITH GRACEFUL
DEGRADATION
A (1+E)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH
GRAPHS
LOWER BOUNDS FOR THE GRAPH HOMOMORPHISM PROBLEM
PARAMETERIZED SINGLE-EXPONENTIAL TIME POLYNOMIAL SPACE ALGORITHM FOR
STEINER TREE
RELATIVE DISCREPANCY DOES NOT SEPARATE INFORMATION AND COMMUNICATION
COMPLEXITY
A GALOIS CONNECTION FOR VALUED CONSTRAINT LANGUAGES OF INFINITE SIZE
APPROXIMATELY COUNTING H COLOURINGS IS #BIS-HARD
TAYLOR POLYNOMIAL ESTIMATOR FOR ESTIMATING FREQUENCY MOMENTS
ETR-COMPLETENESS FOR DECISION VERSIONS OF MULTI-PLAYER (SYMMETRIC) NASH
EQUILIBRIA
SEPARATE, MEASURE AND CONQUER: FASTER POLYNOMIAL-SPACE ALGORITHMS FOR
MAX 2-CSP AND COUNTING DOMINATING SETS
SUBMATRIX MAXIMUM QUERIES IN MONGE MATRICES ARE EQUIVALENT TO
PREDECESSOR SEARCH
OPTIMAL ENCODINGS FOR RANGE TOP-K, SELECTION, AND MIN-MAX
2-VERTEX CONNECTIVITY IN DIRECTED GRAPHS
GROUND STATE CONNECTIVITY OF LOCAL HAMILTONIANS
UNIFORM KERNELIZATION COMPLEXITY OF HITTING FORBIDDEN MINORS
COUNTING HOMOMORPHISMS TO SQUARE-FREE GRAPHS, MODULO 2
APPROXIMATELY COUNTING LOCALLY-OPTIMAL STRUCTURES
PROOFS OF PROXIMITY FOR CONTEXT-FREE LANGUAGES AND READ-ONCE BRANCHING
PROGRAMS (EXTENDED ABSTRACT)
FAST ALGORITHMS FOR DIAMETER-OPTIMALLY AUGMENTING PATHS
HOLLOW HEAPS
LINEAR-TIME LIST RECOVERY OF HIGH-RATE EXPANDER CODES
FINDING 2-EDGE AND 2-VERTEX STRONGLY CONNECTED COMPONENTS IN QUADRATIC
TIME
IMPROVED ALGORITHMS FOR DECREMENTAL SINGLE-SOURCE REACHABILITY ON
DIRECTED GRAPHS
WEIGHTED REORDERING BUFFER IMPROVED VIA VARIANTS OF KNAPSACK COVERING
INEQUALITIES
LOCAL REDUCTIONS
QUERY COMPLEXITY IN EXPECTATION
NEAR-LINEAR QUERY COMPLEXITY FOR GRAPH INFERENCE
A QPTAS FOR THE BASE OF THE NUMBER OF CROSSING-FREE STRUCTURES ON A
PLANAR POINT SET
FINDING A PATH IN GROUP-LABELED GRAPHS WITH TWO LABELS FORBIDDEN
LOWER BOUNDS FOR SUMS OF POWERS OF LOW DEGREE UNIVARIATES
APPROXIMATING CSPS USING LP RELAXATION
COMPARATOR CIRCUITS OVER FINITE BOUNDED POSETS
ALGEBRAIC PROPERTIES OF VALUED CONSTRAINT SATISFACTION PROBLEM
TOWARDS UNDERSTANDING THE SMOOTHED APPROXIMATION RATIO OF THE 2-OPT
HEURISTIC
ON THE HARDEST PROBLEM FORMULATIONS FOR THE 0/1 LASSERRE HIERARCHY
REPLACING MARK BITS WITH RANDOMNESS IN FIBONACCI HEAPS
A PTAS FOR THE WEIGHTED UNIT DISK COVER PROBLEM
APPROXIMATING THE EXPECTED VALUES FOR COMBINATORIAL OPTIMIZATION
PROBLEMS OVER STOCHASTIC POINTS
DETERMINISTIC TRUNCATION OF LINEAR MATROIDS
LINEAR TIME PARAMETERIZED ALGORITHMS FOR SUBSET FEEDBACK VERTEX SET
AN OPTIMAL ALGORITHM FOR MINIMUM-LINK RECTILINEAR PATHS IN TRIANGULATED
RECTILINEAR DOMAINS
AMPLIFICATION OF ONE-WAY INFORMATION COMPLEXITY VIA CODES AND NOISE
SENSITIVITY
A (2+E)-APPROXIMATION ALGORITHM FOR THE STORAGE ALLOCATION PROBLEM
SHORTEST RECONFIGURATION PATHS IN THE SOLUTION SPACE OF BOOLEAN FORMULAS
COMPUTING THE FRECHET DISTANCE BETWEEN POLYGONS WITH HOLES
AN IMPROVED PRIVATE MECHANISM FOR SMALL DATABASES
BINARY PATTERN TILE SET SYNTHESIS IS NP-HARD
NEAR-OPTIMAL UPPER BOUND ON FOURIER DIMENSION OF BOOLEAN FUNCTIONS IN
TERMS OF FOURIER SPARSITY
CONDENSED UNPREDICTABILITY
SHERALI-ADAMS RELAXATIONS FOR VALUED CSPS
TWO-SIDED ONLINE BIPARTITE MATCHING AND VERTEX COVER: BEATING THE GREEDY
ALGORITHM
THE SIMULTANEOUS COMMUNICATION OF DISJOINTNESS WITH APPLICATIONS TO DATA
STREAMS
AN IMPROVED COMBINATORIAL ALGORITHM FOR BOOLEAN MATRIX MULTIPLICATION
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
AUTOMATA, LANGUAGES, AND PROGRAMMING
/
: 2015
ABSTRACT / INHALTSTEXT
THE TWO-VOLUME SET LNCS 9134 AND LNCS 9135 CONSTITUTES THE REFEREED
PROCEEDINGS OF THE 42ND INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES
AND PROGRAMMING, ICALP 2015, HELD IN KYOTO, JAPAN, IN JULY 2015. THE 143
REVISED FULL PAPERS PRESENTED WERE CAREFULLY REVIEWED AND SELECTED FROM
507 SUBMISSIONS. THE PAPERS ARE ORGANIZED IN THE FOLLOWING THREE TRACKS:
ALGORITHMS, COMPLEXITY, AND GAMES; LOGIC, SEMANTICS, AUTOMATA, AND
THEORY OF PROGRAMMING; AND FOUNDATIONS OF NETWORKED COMPUTATION: MODELS,
ALGORITHMS, AND INFORMATION MANAGEMENT
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
|
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV042669823 |
| classification_tum | DAT 000 DAT 550f |
| collection | ZDB-2-SCS ZDB-2-LNC |
| ctrlnum | (OCoLC)913220567 (DE-599)BVBBV042669823 |
| 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-662-47672-7 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02915nmm a2200613zcb4500</leader><controlfield tag="001">BV042669823</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170419 </controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150703s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662476727</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-662-47672-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662476710</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-662-47671-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-47672-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)913220567</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042669823</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</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-19</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-355</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 550f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata, languages and programming</subfield><subfield code="b">42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I</subfield><subfield code="c">edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXXI, 1111 p. 78 illus)</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">9134</subfield><subfield code="x">0302-9743</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Communication Networks</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">Information storage and retrieval systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</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">Computation by Abstract Devices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information Storage and Retrieval</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information Systems Applications (incl. Internet)</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">Informatik</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">06.07.2015-10.07.2015</subfield><subfield code="z">Kyoto</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">Halldórsson, Magnús M.</subfield><subfield code="e">Sonstige</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">9134</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">9134</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-47672-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</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=028101907&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</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=028101907&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2015</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-LNC_2015</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028101907</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 06.07.2015-10.07.2015 Kyoto gnd-content |
| genre_facet | Konferenzschrift 06.07.2015-10.07.2015 Kyoto |
| id | DE-604.BV042669823 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:07:06Z |
| institution | BVB |
| isbn | 9783662476727 9783662476710 |
| issn | 0302-9743 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028101907 |
| oclc_num | 913220567 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-384 DE-Aug4 DE-M347 DE-573 DE-859 DE-703 DE-473 DE-BY-UBG DE-29 DE-706 DE-20 DE-739 DE-92 DE-634 DE-860 DE-861 DE-355 DE-BY-UBR |
| owner_facet | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-384 DE-Aug4 DE-M347 DE-573 DE-859 DE-703 DE-473 DE-BY-UBG DE-29 DE-706 DE-20 DE-739 DE-92 DE-634 DE-860 DE-861 DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (XXXI, 1111 p. 78 illus) |
| psigel | ZDB-2-SCS ZDB-2-LNC ZDB-2-SCS_2015 ZDB-2-LNC_2015 |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Springer |
| record_format | marc |
| series | Lecture Notes in Computer Science |
| series2 | Lecture Notes in Computer Science |
| spelling | Automata, languages and programming 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann Berlin, Heidelberg Springer 2015 1 Online-Ressource (XXXI, 1111 p. 78 illus) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Computer Science 9134 0302-9743 Computer science Computer Communication Networks Computer software Computational complexity Information storage and retrieval systems Computer Science Algorithm Analysis and Problem Complexity Computation by Abstract Devices Information Storage and Retrieval Information Systems Applications (incl. Internet) Discrete Mathematics in Computer Science Informatik Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 06.07.2015-10.07.2015 Kyoto gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Halldórsson, Magnús M. Sonstige oth Lecture Notes in Computer Science 9134 (DE-604)BV014880109 9134 https://doi.org/10.1007/978-3-662-47672-7 Verlag Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028101907&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028101907&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract |
| spellingShingle | Automata, languages and programming 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I Lecture Notes in Computer Science Computer science Computer Communication Networks Computer software Computational complexity Information storage and retrieval systems Computer Science Algorithm Analysis and Problem Complexity Computation by Abstract Devices Information Storage and Retrieval Information Systems Applications (incl. Internet) Discrete Mathematics in Computer Science Informatik Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)1071861417 |
| title | Automata, languages and programming 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I |
| title_auth | Automata, languages and programming 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I |
| title_exact_search | Automata, languages and programming 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I |
| title_full | Automata, languages and programming 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann |
| title_fullStr | Automata, languages and programming 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann |
| title_full_unstemmed | Automata, languages and programming 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I edited by Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann |
| title_short | Automata, languages and programming |
| title_sort | automata languages and programming 42nd international colloquium icalp 2015 kyoto japan july 6 10 2015 proceedings part i |
| title_sub | 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I |
| topic | Computer science Computer Communication Networks Computer software Computational complexity Information storage and retrieval systems Computer Science Algorithm Analysis and Problem Complexity Computation by Abstract Devices Information Storage and Retrieval Information Systems Applications (incl. Internet) Discrete Mathematics in Computer Science Informatik Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Computer science Computer Communication Networks Computer software Computational complexity Information storage and retrieval systems Computer Science Algorithm Analysis and Problem Complexity Computation by Abstract Devices Information Storage and Retrieval Information Systems Applications (incl. Internet) Discrete Mathematics in Computer Science Informatik Theoretische Informatik Konferenzschrift 06.07.2015-10.07.2015 Kyoto |
| url | https://doi.org/10.1007/978-3-662-47672-7 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028101907&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028101907&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT halldorssonmagnusm automatalanguagesandprogramming42ndinternationalcolloquiumicalp2015kyotojapanjuly6102015proceedingsparti |