mathematical foundations computer science de koubek vaclav (43 résultats)

Etat : Good. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 20 (sale item)* 562 pp., softcover, ex library, else text clean & binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Etat : Good. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 20 (sale item)* 521 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Paperback. Etat : Very Good. We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.

1st ed. 915 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7791 9783540228233 Sprache: Englisch Gewicht in Gramm: 900.

OBrosch., IX+562, 16,5 x 24 cm, Deckel leicht verschmutzt u. vorne befleckt, Seitenränder leicht ausgeblichen, sonst innen unbeschädigt u. schön, insgesamt sehr guter Zustand. Book Language/s: English.

Paperback. Etat : new. Paperback. This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Numerous topics are covered in this volume. The invited papers cover: range searching with semialgebraic sets, graph layout problems, parallel recognition and ranking of context-free languages, expansion of combinatorial polytopes, neural networks and complexity theory, theory of computation over stream algebras, methods in parallel algorithms, the complexity of small descriptions, weak parallel machines, and the complexity of graph connectivity. A collection of conference papers which includes discussion of graph layout problems, parallel recognition and ranking of context-free languages, the expansion of combinatorial polytopes, neural networks and complexity theory, methods in parallel algorithms and graph connectivity. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Etat : New.

Etat : New.

Etat : New. In.

Paperback. Etat : New.

Flexibound. Etat : Fine. Leichte Abnutzungen; Gebogener Buchrucken. This volume features papers from the 29th Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague from August 22-27, 2004. Organized by the Institute for Theoretical Computer Science and the Department of Theoretical Computer Science and Mathematical Logic at Charles University, the event received support from the European Association for Theoretical Computer Science and the European Research Consortium for Informatics and Mathematics. The MFCS symposia traditionally promote high-quality research across all areas of theoretical computer science. Topics covered include automata, formal languages, data structures, algorithms, computational geometry, complexity theory, models of computation, and applications in computational biology, cryptography, security, and artificial intelligence. This conference provided a unique platform for researchers from various fields to present their findings to a broader audience. The scientific program took place in the recently renovated Faculty of Mathematics and Physics building, located in the historic center of Prague, with views of notable landmarks like Prague Castle. The competition for audience attention was fierce, yet the quality of presentations ensured significant interest. The conference program included 60 contributed papers selected from 167 submissions by the Program Committee.

Flexibound. Etat : As New. Leichte Abnutzungen. This volume features papers from the 29th Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague from August 22-27, 2004. Organized by the Institute for Theoretical Computer Science and the Department of Theoretical Computer Science and Mathematical Logic at Charles University, the event received support from the European Association for Theoretical Computer Science and the European Research Consortium for Informatics and Mathematics. The MFCS symposia traditionally promote high-quality research across all areas of theoretical computer science. Topics covered include automata, formal languages, data structures, algorithms, computational geometry, complexity theory, models of computation, and applications in computational biology, cryptography, security, and artificial intelligence. This conference provided a unique platform for researchers from various fields to present their findings to a broader audience. The scientific program took place in the recently renovated Faculty of Mathematics and Physics building, located in the historic center of Prague, with views of notable landmarks like Prague Castle. The competition for audience attention was fierce, yet the quality of presentations ensured significant interest. The conference program included 60 contributed papers selected from 167 submissions by the Program Committee.

Flexibound. Etat : As New. Originalverpackt. This volume features papers from the 29th Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague from August 22-27, 2004. Organized by the Institute for Theoretical Computer Science and the Department of Theoretical Computer Science and Mathematical Logic at Charles University, the event received support from the European Association for Theoretical Computer Science and the European Research Consortium for Informatics and Mathematics. The MFCS symposia traditionally promote high-quality research across all areas of theoretical computer science. Topics covered include automata, formal languages, data structures, algorithms, computational geometry, complexity theory, models of computation, and applications in computational biology, cryptography, security, and artificial intelligence. This conference provided a unique platform for researchers from various fields to present their findings to a broader audience. The scientific program took place in the recently renovated Faculty of Mathematics and Physics building, located in the historic center of Prague, with views of notable landmarks like Prague Castle. The competition for audience attention was fierce, yet the quality of presentations ensured significant interest. The conference program included 60 contributed papers selected from 167 submissions by the Program Committee.

Paperback. Etat : new. Paperback. This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Etat : New.

Etat : New.

Paperback. Etat : new. Paperback. This book constitutes the refereed proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic in August 2004. The 60 revised full papers presented together with full papers or abstracts of 10 invited talks were carefully reviewed and selected from 167 submissions. The papers are organised in topical sections on graph algorithms, approximation, graphs and complexity, circuits, general complexity, automata, parameterized and kolmogrov complexity, semantics, scheduling, algebraic theory of languages, games, languages, geometry, languages and complexity, quantum computing, and XML. This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 2227, 2004. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Etat : New.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains 10 invited papers and 40 shortcommunications contributed for presentation at the 17thSymposium on Mathematical Foundations of Computer Science,held in Prague, Czechoslovakia, August 24-28, 1992.The series of MFCS symposia, organized alternately in Polandand Czechoslovakia since 1972, has a long and wellestablished tradition. The purpose of the series is toencourage high-quality research in all branches oftheoretical computer science and to bring togetherspecialists working actively in the area.Numerous topics are covered in this volume. The invitedpapers cover: range searching with semialgebraic sets, graphlayout problems, parallel recognition and ranking ofcontext-free languages, expansion of combinatorialpolytopes, neural networks and complexity theory, theory ofcomputation over stream algebras, methods in parallelalgorithms, the complexity of small descriptions, weakparallel machines, and the complexity of graph connectivity.

Etat : New. In.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New. In.

Softcover. Etat : Gut. 521 Computerwissenschaften Slightly brownish paper. Guter Zustand/ Good With figures. Ex-Library. Stamped edges. ha1055026 Sprache: Englisch Gewicht in Gramm: 800.

Etat : As New. Unread book in perfect condition.

Paperback. Etat : new. Paperback. This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Numerous topics are covered in this volume. The invited papers cover: range searching with semialgebraic sets, graph layout problems, parallel recognition and ranking of context-free languages, expansion of combinatorial polytopes, neural networks and complexity theory, theory of computation over stream algebras, methods in parallel algorithms, the complexity of small descriptions, weak parallel machines, and the complexity of graph connectivity. A collection of conference papers which includes discussion of graph layout problems, parallel recognition and ranking of context-free languages, the expansion of combinatorial polytopes, neural networks and complexity theory, methods in parallel algorithms and graph connectivity. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Etat : New. pp. 540.

Etat : New.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.

Taschenbuch. Etat : Neu. Neuware - This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22-27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti cial intelligence, the conference o ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti c program of this year's MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year's MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.