Produktart
Zustand
Einband
Weitere Eigenschaften
Gratisversand
Land des Verkäufers
Verkäuferbewertung
Verlag: Springer Berlin Heidelberg, 2013
ISBN 10: 3642403123ISBN 13: 9783642403125
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Verlag: Springer Berlin Heidelberg 2011-06-27, Heidelberg, 2011
ISBN 10: 3642220053ISBN 13: 9783642220050
Anbieter: Blackwell's, London, Vereinigtes Königreich
Buch
paperback. Zustand: New. Language: ENG.
Verlag: Springer Berlin Heidelberg, 2001
ISBN 10: 3540424962ISBN 13: 9783540424963
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains papers selected for presentation at the 26th International Symposium on Mathematical Foundations of Computer Science MFCS 2001, held in Mari ansk eL azn e, Czech Republic, August 27 31, 2001. MFCS 2001 was organized by the Mathematical Institute (Academy of S- ences of the Czech Republic), the Institute for Theoretical Computer Science (Charles University, Faculty of Mathematics and Physics), the Institute of C- puter Science (Academy of Sciences of the Czech Republic), and Action M Agency. It was supported by the European Research Consortium for Informatics and Mathematics, the Czech Research Consortium for Informatics and Ma- ematics, and the European Association for Theoretical Computer Science. We gratefully acknowledge the support of all these institutions. The series of MFCS symposia, organized on a rotating basis in Poland, S- vakia, and the Czech Republic, has a well-established tradition. The aim is to encourage high-quality research in all branches of theoretical computer science and bring together specialists who do not usually meet at specialized confer- ences. Previous meetings tookplace in Jablonna, 1972; Strbsk e Pleso, 1973; J- wisin, 1974; Marian sk eL azn e, 1975; Gdan sk, 1976; Tatransk a Lomnica, 1977; Za- kopane, 1978; Olomouc, 1979; Rydzina, 1980; Strbsk e Pleso, 1981; Prague, 1984; Bratislava, 1986; Karlovy Vary, 1988; Porabk a-Kozubnik, 1989; Bansk aBystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdan sk, 1993; Ko sice, 1994; Prague, 1995; Krak ow, 1996; Bratislava, 1997; Brno, 1998; Szklarska Por eba, 1999; and Bratislava, 2000.
Verlag: Springer Berlin, 2013
ISBN 10: 3642403123ISBN 13: 9783642403125
Anbieter: Buchpark, Trebbin, Deutschland
Buch
Zustand: Sehr gut. 2013. Buchschnitt verkürzt- gepflegter, sauberer Zustand - Ausgabejahr 2013 24097466/12.
Verlag: Springer, Berlin 2001, 2001
Anbieter: Antiquariat Thomas & Reinhard, Recklinghausen, NRW, Deutschland
Bibl.Ex., keine Markierungen-Unterstreichungen-Anmerkungen im Text, Format groß 8°, 716 Seiten, broschiert, Stempel Vorsatz/Kopfschnitt, sonst wie neu. Shipping to abroad insured with tracking number.
Verlag: Springer Berlin, 2011
ISBN 10: 3642220118ISBN 13: 9783642220111
Anbieter: Buchpark, Trebbin, Deutschland
Buch
Zustand: Sehr gut. 2011. Neubindung, Buchrücken leicht geknickt und eingerissen, Part 2, Ausg. 2011 10868185/12.
Verlag: Springer Berlin, 2011
ISBN 10: 3642220053ISBN 13: 9783642220050
Anbieter: Buchpark, Trebbin, Deutschland
Buch
Zustand: Sehr gut. 2011. Neubindung, Buchrücken leicht geknickt und eingerissen, Part 1, Ausg. 2011 10868174/12.