Eintrag weiter verarbeiten
Online-Ressource

Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings

Gespeichert in:

Personen und Körperschaften: Chatterjee, Krishnendu (VerfasserIn), Sgall, Jiří (HerausgeberIn)
Titel: Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings/ edited by Krishnendu Chatterjee, Jirí Sgall
Format: E-Book Konferenzbericht
Sprache: Englisch
veröffentlicht:
Berlin, Heidelberg Springer 2013
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 8087
Schlagwörter:
Data structures (Computer science)
Computer software
Electronic data processing
Computational complexity
Computer Science
Computer science
Algorithms.
Discrete mathematics.
Numerical analysis.
Artificial intelligence
Machine theory.
Konferenzschrift > 2013 > Klosterneuburg
Konferenzschrift
Druckausg.: Mathematical foundations of computer science 2013, Heidelberg : Springer, 2013, XVI, 851 S.
Quelle: Verbunddaten SWB
Zugangsinformationen: Elektronischer Volltext - Campuslizenz
LEADER 06491cam a22011052 4500
001 0-1652995188
003 DE-627
005 20240122104901.0
007 cr uuu---uuuuu
008 130911s2013 gw |||||o 00| ||eng c
020 |a 9783642403132  |9 978-3-642-40313-2 
024 7 |a 10.1007/978-3-642-40313-2  |2 doi 
035 |a (DE-627)1652995188 
035 |a (DE-576)393381781 
035 |a (DE-599)BSZ393381781 
035 |a (OCoLC)857390905 
035 |a (ZBM)1270.68020 
035 |a (ZBM)1270.68020 
035 |a (DE-He213)978-3-642-40313-2 
035 |a (EBP)040550494 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE  |c XA-DE-BE 
050 0 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
084 |a SS 4800  |q SEPA  |2 rvk  |0 (DE-625)rvk/143528: 
084 |a *68-06  |2 msc 
084 |a 68Qxx  |2 msc 
084 |a 00B25  |2 msc 
084 |a 54.10  |2 bkl 
100 1 |a Chatterjee, Krishnendu  |4 aut 
245 1 0 |a Mathematical Foundations of Computer Science 2013  |b 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings  |c edited by Krishnendu Chatterjee, Jirí Sgall 
264 1 |a Berlin, Heidelberg  |b Springer  |c 2013 
300 |a Online-Ressource (XVI, 851 p. 92 illus, online resource) 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science  |v 8087 
490 0 |a SpringerLink  |a Bücher 
500 |a Literaturangaben 
505 8 0 |a Alternation Trading Proofs and Their LimitationsBin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic. 
520 |a This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence 
650 0 |a Data structures (Computer science) 
650 0 |a Computer software 
650 0 |a Electronic data processing 
650 0 |a Computational complexity 
650 0 |a Computer Science 
650 0 |a Computer science 
650 0 |a Data structures (Computer science) 
650 0 |a Computer software 
650 0 |a Electronic data processing 
650 0 |a Computational complexity 
650 0 |a Computer science 
650 0 |a Algorithms. 
650 0 |a Discrete mathematics. 
650 0 |a Numerical analysis. 
650 0 |a Artificial intelligence 
650 0 |a Machine theory. 
655 7 |a Konferenzschrift  |y 2013  |z Klosterneuburg  |0 (DE-588)1071861417  |0 (DE-627)826484824  |0 (DE-576)433375485  |2 gnd-content 
655 7 |a Konferenzschrift  |0 (DE-588)1071861417  |0 (DE-627)826484824  |0 (DE-576)433375485  |2 gnd-content 
689 0 0 |D s  |0 (DE-588)4196735-5  |0 (DE-627)105201693  |0 (DE-576)210109750  |a Theoretische Informatik  |2 gnd 
689 0 |5 DE-101 
700 1 |a Sgall, Jiří  |e Hrsg.  |4 edt 
776 1 |z 9783642403125 
776 0 8 |i Druckausg.  |t Mathematical foundations of computer science 2013  |d Heidelberg : Springer, 2013  |h XVI, 851 S.  |w (DE-627)76670713X  |w (DE-576)40811973X  |z 9783642403125 
830 0 |a Lecture notes in computer science  |v 8087  |9 8087  |w (DE-627)316228877  |w (DE-576)093890923  |w (DE-600)2018930-8  |x 1611-3349  |7 ns 
856 4 0 |u https://doi.org/10.1007/978-3-642-40313-2  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-40313-2  |x Resolving-System  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://swbplus.bsz-bw.de/bsz393381781cov.jpg  |m V:DE-576  |m X:springer  |q image/jpeg  |v 20150316113400  |3 Cover 
856 4 2 |u https://zbmath.org/?q=an:1270.68020  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
889 |w (DE-627)766671976 
912 |a ZDB-2-LNC  |b 2013 
912 |a ZDB-2-SCS  |b 2013 
912 |a ZDB-2-SEB 
912 |a ZDB-2-SXCS  |b 2013 
912 |a ZDB-2-SEB  |b 2013 
935 |h GBV  |i ExPruef 
936 r v |a SS 4800  |b Lecture notes in computer science  |k Informatik  |k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen  |k Schriftenreihen (indiv. Sign.)  |k Lecture notes in computer science  |0 (DE-627)1271461242  |0 (DE-625)rvk/143528:  |0 (DE-576)201461242 
936 b k |a 54.10  |j Theoretische Informatik  |q SEPA  |0 (DE-627)106418815 
951 |a BO 
950 |a Informatik 
950 |a Theorie 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-40313-2  |9 DE-14 
852 |a DE-14  |x epn:3361977088  |z 2013-09-11T10:23:29Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-40313-2  |9 DE-15 
852 |a DE-15  |x epn:3361977118  |z 2013-09-11T10:23:29Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-40313-2  |9 DE-Ch1 
852 |a DE-Ch1  |x epn:3361977150  |z 2013-09-11T10:23:29Z 
976 |h Elektronischer Volltext - Campuslizenz 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-40313-2  |z Zum Online-Dokument  |9 DE-Zi4 
852 |a DE-Zi4  |x epn:3361977185  |z 2013-09-11T10:23:29Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-40313-2  |9 DE-520 
852 |a DE-520  |x epn:3361977215  |z 2013-09-11T10:23:29Z 
980 |a 1652995188  |b 0  |k 1652995188  |o 393381781 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Mathematical+Foundations+of+Computer+Science+2013%3A+38th+International+Symposium%2C+MFCS+2013%2C+Klosterneuburg%2C+Austria%2C+August+26-30%2C+2013.+Proceedings&rft.date=2013&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Mathematical+Foundations+of+Computer+Science+2013%3A+38th+International+Symposium%2C+MFCS+2013%2C+Klosterneuburg%2C+Austria%2C+August+26-30%2C+2013.+Proceedings&rft.series=Lecture+notes+in+computer+science%2C+8087&rft.au=Chatterjee%2C+Krishnendu&rft.pub=Springer&rft.edition=&rft.isbn=3642403131
SOLR
_version_ 1792258621291102208
access_facet Electronic Resources
author Chatterjee, Krishnendu
author2 Sgall, Jiří
author2_role edt
author2_variant j s js
author_facet Chatterjee, Krishnendu, Sgall, Jiří
author_role aut
author_sort Chatterjee, Krishnendu
author_variant k c kc
callnumber-first Q - Science
callnumber-label QA76
callnumber-raw QA76.9.A43
callnumber-search QA76.9.A43
callnumber-sort QA 276.9 A43
callnumber-subject QA - Mathematics
collection ZDB-2-LNC, ZDB-2-SCS, ZDB-2-SEB, ZDB-2-SXCS
contents Alternation Trading Proofs and Their LimitationsBin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic., This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence
ctrlnum (DE-627)1652995188, (DE-576)393381781, (DE-599)BSZ393381781, (OCoLC)857390905, (ZBM)1270.68020, (DE-He213)978-3-642-40313-2, (EBP)040550494
de15_date 2013-09-11T10:23:29Z
dech1_date 2013-09-11T10:23:29Z
doi_str_mv 10.1007/978-3-642-40313-2
era_facet 2013
facet_912a ZDB-2-LNC, ZDB-2-SCS, ZDB-2-SEB, ZDB-2-SXCS
facet_avail Online
facet_local_del330 Theoretische Informatik
finc_class_facet Informatik, Mathematik
fincclass_txtF_mv science-computerscience
footnote Literaturangaben
format eBook, ConferenceProceedings
format_access_txtF_mv Book, E-Book
format_de105 Ebook
format_de14 Book, E-Book
format_de15 Book, E-Book
format_del152 Buch
format_detail_txtF_mv text-online-monograph-independent
format_dezi4 e-Book
format_finc Book, E-Book
format_legacy ElectronicBook
format_legacy_nrw Book, E-Book
format_nrw Book, E-Book
format_strict_txtF_mv E-Book
genre Konferenzschrift 2013 Klosterneuburg (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, Konferenzschrift (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content
genre_facet Konferenzschrift
geogr_code not assigned
geogr_code_person not assigned
geographic_facet Klosterneuburg
hierarchy_parent_id 0-316228877
hierarchy_parent_title Lecture notes in computer science
hierarchy_sequence 8087
hierarchy_top_id 0-316228877
hierarchy_top_title Lecture notes in computer science
id 0-1652995188
illustrated Not Illustrated
imprint Berlin, Heidelberg, Springer, 2013
imprint_str_mv Berlin, Heidelberg: Springer, 2013
institution DE-14, DE-Zi4, DE-Ch1, DE-520, DE-15
is_hierarchy_id 0-1652995188
is_hierarchy_title Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
isbn 9783642403132
isbn_isn_mv 9783642403125
issn_isn_mv 1611-3349
kxp_id_str 1652995188
language English
last_indexed 2024-02-29T18:23:32.062Z
local_heading_facet_dezwi2 Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Algorithms., Discrete mathematics., Numerical analysis., Artificial intelligence, Machine theory., Theoretische Informatik
marc024a_ct_mv 10.1007/978-3-642-40313-2
match_str chatterjee2013mathematicalfoundationsofcomputerscience201338thinternationalsymposiummfcs2013klosterneuburgaustriaaugust26302013proceedings
mega_collection Verbunddaten SWB
multipart_link 093890923
multipart_part (093890923)8087
oclc_num 857390905
physical Online-Ressource (XVI, 851 p. 92 illus, online resource)
publishDate 2013
publishDateSort 2013
publishPlace Berlin, Heidelberg
publisher Springer
record_format marcfinc
record_id 393381781
recordtype marcfinc
rsn_id_str_mv (DE-15)3249679
rvk_facet SS 4800
rvk_label Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science
rvk_path SS, SQ - SU, SS 4000 - SS 5999, SS 4800
rvk_path_str_mv SS, SQ - SU, SS 4000 - SS 5999, SS 4800
series Lecture notes in computer science, 8087
series2 Lecture Notes in Computer Science ; 8087, SpringerLink ; Bücher
source_id 0
spelling Chatterjee, Krishnendu aut, Mathematical Foundations of Computer Science 2013 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings edited by Krishnendu Chatterjee, Jirí Sgall, Berlin, Heidelberg Springer 2013, Online-Ressource (XVI, 851 p. 92 illus, online resource), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 8087, SpringerLink Bücher, Literaturangaben, Alternation Trading Proofs and Their LimitationsBin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic., This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Algorithms., Discrete mathematics., Numerical analysis., Artificial intelligence, Machine theory., Konferenzschrift 2013 Klosterneuburg (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, Konferenzschrift (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4196735-5 (DE-627)105201693 (DE-576)210109750 Theoretische Informatik gnd, DE-101, Sgall, Jiří Hrsg. edt, 9783642403125, Druckausg. Mathematical foundations of computer science 2013 Heidelberg : Springer, 2013 XVI, 851 S. (DE-627)76670713X (DE-576)40811973X 9783642403125, Lecture notes in computer science 8087 8087 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-40313-2 X:SPRINGER Verlag lizenzpflichtig Volltext, http://dx.doi.org/10.1007/978-3-642-40313-2 Resolving-System lizenzpflichtig Volltext, https://swbplus.bsz-bw.de/bsz393381781cov.jpg V:DE-576 X:springer image/jpeg 20150316113400 Cover, https://zbmath.org/?q=an:1270.68020 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, (DE-627)766671976, http://dx.doi.org/10.1007/978-3-642-40313-2 DE-14, DE-14 epn:3361977088 2013-09-11T10:23:29Z, http://dx.doi.org/10.1007/978-3-642-40313-2 DE-15, DE-15 epn:3361977118 2013-09-11T10:23:29Z, http://dx.doi.org/10.1007/978-3-642-40313-2 DE-Ch1, DE-Ch1 epn:3361977150 2013-09-11T10:23:29Z, http://dx.doi.org/10.1007/978-3-642-40313-2 Zum Online-Dokument DE-Zi4, DE-Zi4 epn:3361977185 2013-09-11T10:23:29Z, http://dx.doi.org/10.1007/978-3-642-40313-2 DE-520, DE-520 epn:3361977215 2013-09-11T10:23:29Z
spellingShingle Chatterjee, Krishnendu, Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, Lecture notes in computer science, 8087, Alternation Trading Proofs and Their LimitationsBin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic., This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Algorithms., Discrete mathematics., Numerical analysis., Artificial intelligence, Machine theory., Konferenzschrift 2013 Klosterneuburg, Konferenzschrift, Theoretische Informatik
swb_id_str 393381781
title Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
title_auth Mathematical Foundations of Computer Science 2013 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
title_full Mathematical Foundations of Computer Science 2013 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings edited by Krishnendu Chatterjee, Jirí Sgall
title_fullStr Mathematical Foundations of Computer Science 2013 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings edited by Krishnendu Chatterjee, Jirí Sgall
title_full_unstemmed Mathematical Foundations of Computer Science 2013 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings edited by Krishnendu Chatterjee, Jirí Sgall
title_in_hierarchy 8087. Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (2013)
title_short Mathematical Foundations of Computer Science 2013
title_sort mathematical foundations of computer science 2013 38th international symposium mfcs 2013 klosterneuburg austria august 26 30 2013 proceedings
title_sub 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
title_unstemmed Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
topic Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Algorithms., Discrete mathematics., Numerical analysis., Artificial intelligence, Machine theory., Konferenzschrift 2013 Klosterneuburg, Konferenzschrift, Theoretische Informatik
topic_facet Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Algorithms., Discrete mathematics., Numerical analysis., Artificial intelligence, Machine theory., Konferenzschrift, Theoretische Informatik
url https://doi.org/10.1007/978-3-642-40313-2, http://dx.doi.org/10.1007/978-3-642-40313-2, https://swbplus.bsz-bw.de/bsz393381781cov.jpg, https://zbmath.org/?q=an:1270.68020