mathematical foundations computer science von rovan branislav (105 Ergebnisse)

2000. 724 p. Unread book. Very good condition. Minimum traces of storage. 9783540679011 Sprache: Englisch Gewicht in Gramm: 998 Softcover: 15.5 x 4.2 x 23.5 cm.

Zustand: Good. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 6 (sale item)* 544 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.

Zustand: Good. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 6 (sale item)* 708 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.

Zustand: Fair. Unterschrift / Widmung ohne Bezug; Leichte Risse. *** please read this *** Ships from Ohio - no marks - next day shipping - tracking provided - 8-C-26.

paperback. Zustand: Gut. 708 Seiten; 9783540406716.3 Gewicht in Gramm: 3.

Softcover. 1986. 650 p. ATTENTION 1986 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540167839 Sprache: Englisch Gewicht in Gramm: 930.

Zustand: New.

Softcover. 1994. X, 628 S. : graph. Darst. ; 24 cm Very good condition. Reading pages are very clean and without marks. Minimum traces of storage or use. Otherwise very good exemplar. 9783540583387 Sprache: Englisch Gewicht in Gramm: 885.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains papers selected for presentation at the 15th Symposium on Mathematical Foundations of Computer Science, MFCS '90, held at Banská Bystrica, Czechoslovakia, August 27-31, 1990. Previous MFCS proceedings have also been published in the Lecture Notes in Computer Science. This symposium is the 15th in a series of international meetings which have taken place in Czechoslovakia and Poland. The aim of these symposia is to bring together specialists in theoretical fields of computer science from various countries and to stimulate mathematical research in theoretical computer science. These proceedings consist of 10 invited papers and 52 communications selected by the international Program Committee. The papers present the latest results in key areas of computer science by authors from Europe, USA, Japan and China.

Zustand: New. In.

kart., Broschiert. Zustand: Sehr gut. 838 S. Einbd. leicht berieben, ansonsten sehr gut erhalten. ISBN: 9783642325885 Sprache: Englisch Gewicht in Gramm: 1280.

Zustand: New.

Zustand: New. SUPER FAST SHIPPING.

Paperback. Zustand: As New. *** please read this *** Ships from Ohio - no marks bn2-c-18*.

Paperback. Zustand: 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. Text block clean and unmarked. Tight binding.

Paperback. Zustand: Very Good. We are unable to ship to Canada at this time.Ex-library paperback in nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.

Zustand: As New. Unread book in perfect condition.

Zustand: New. 1990. Paperback. . . . . .

Paperback. Zustand: 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.

Zustand: New.

Zustand: New. 1990. Paperback. . . . . . Books ship from the US and Ireland.

Taschenbuch. Zustand: Neu. Neuware -Thisvolumecontainspapersselectedforpresentationatthe28thSymposiumon MathematicalFoundationsofComputerScience¿MFCS2003,heldinBratislava, Slovakia, August 25¿29, 2003. MFCS 2003 was organized by the Slovak Society for Computer Science and the Comenius University in Bratislava, in cooperation with other institutions in Slovakia. It was supported by the European Association for Theoretical C- puter Science and the Slovak Research Consortium for Informatics and Mat- matics. The series of MFCS symposia, organized alternately in the Czech Republic, PolandandSlovakiasince1972,hasawell-establishedtradition. TheMFCSs- posiaencouragehigh-qualityresearchinallbranchesoftheoreticalcomputers- ence. Theirbroadscopeprovidesanopportunitytobringtogetherspecialistswho donotusuallymeetatspecializedconferences. Thepreviousmeetingstookplace in Jablonna, 1972; Strbsk¿ e Pleso, 1973; Jadwisin, 1974; Mari¿ ansk¿eL¿ azn e, 1975; Gdansk, ` 1976; Tatransk¿ a Lomnica, 1977; Zakopane, 1978; Olomouc, 1979; Ry- dzina, 1980; Strbsk¿ e Pleso, 1981; Prague, 1984; Bratislava, 1986; Carlsbad, 1988; Porabk ¿ a-Kozubnik,1989;Bansk¿ aBystrica,1990;KazimierzDolny,1991;Prague, 1992;Gdansk, ` 1993,Ko sice,1994;Prague,1995;Krak¿ ow,1996;Bratislava,1997; Brno, 1998; Szklarska Por¿ eba, 1999; Bratislava, 2000; Mari¿ ansk¿eL¿ azn e, 2001; and Warsaw-Otwock, 2002. The MFCS 2003 Proceedings consists of 7 invited papers and 55 c- tributed papers. The latter were selected by the Program Committee from a total of 137 submitted papers. 712 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Thisvolumecontainspapersselectedforpresentationatthe28thSymposiumon MathematicalFoundationsofComputerScience MFCS2003,heldinBratislava, Slovakia, August 25 29, 2003. MFCS 2003 was organized by the Slovak Society for Computer Science and the Comenius University in Bratislava, in cooperation with other institutions in Slovakia. It was supported by the European Association for Theoretical C- puter Science and the Slovak Research Consortium for Informatics and Mat- matics. The series of MFCS symposia, organized alternately in the Czech Republic, PolandandSlovakiasince1972,hasawell-establishedtradition. TheMFCSs- posiaencouragehigh-qualityresearchinallbranchesoftheoreticalcomputers- ence. Theirbroadscopeprovidesanopportunitytobringtogetherspecialistswho donotusuallymeetatspecializedconferences. Thepreviousmeetingstookplace in Jablonna, 1972; Strbsk e Pleso, 1973; Jadwisin, 1974; Mari ansk eL azn e, 1975; Gdansk, ` 1976; Tatransk a Lomnica, 1977; Zakopane, 1978; Olomouc, 1979; Ry- dzina, 1980; Strbsk e Pleso, 1981; Prague, 1984; Bratislava, 1986; Carlsbad, 1988; Porabk a-Kozubnik,1989;Bansk aBystrica,1990;KazimierzDolny,1991;Prague, 1992;Gdansk, ` 1993,Ko sice,1994;Prague,1995;Krak ow,1996;Bratislava,1997; Brno, 1998; Szklarska Por eba, 1999; Bratislava, 2000; Mari ansk eL azn e, 2001; and Warsaw-Otwock, 2002. The MFCS 2003 Proceedings consists of 7 invited papers and 55 c- tributed papers. The latter were selected by the Program Committee from a total of 137 submitted papers.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Why sometimes probabilistic algorithms can be more effective.- Recent results in the theory of rational sets.- Partial interpretations of higher order algebraic types.- Kins of context-free languages.- Algebraic theory of module specifications with constraints.- A semantical model for integration and modularization of rules.- Parallel arithmetic computations: A survey.- An approach to proof checker.- The promise of electronic prototyping.- Systolic arrays: Characterizations and complexity.- Geometric location problems and their complexity.- Developing implicit data structures.- Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs.- Deterministic simulation of idealized parallel computers on more realistic ones.- Relational specifications and observational semantics.- Efficient testing of optimal time adders.- Properties of complexity measures for PRAMs and WARMs.- Iterative systems of equations.- Polynomial complexity of the Newton-Puiseux algorithm.- Unique decipherability for partially commutative alphabet (extended abstract).- The equivalence of finite valued transducers (on HDTOL languages) is decidable.- A fast parallel algorithm for six-colouring of planar graphs.- Quicksort without a stack.- Towards an efficient merging.- Homomorphic realization of automata with compositions.- Refined bounds on the complexity of sorting and selection in d - dimensional space.- On the inherent combinatorial complexity of geometric problems in d - dimensional space.- The evolution of two stacks in bounded space and random walks in a triangle.- P-genericity and strong p-genericity.- Fibonacci numeration systems and rational functions.- Safe implementation equivalence for asynchronous nondeterministic processes.- Grammars with context dependency restricted to synchronization.- Some improved parallelisms for graphs.- A complete inference system for an algebra of regular acceptance models.- Nondeterministic Turing machines with modified acceptance.- Remark on the power of compass.- Regular chain code picture languages of nonlinear descriptional complexity.- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines.- A new approach to defining the communication complexity for VLSI.- Lower bounds on the complexity of local circuits.- Optimal sorting of seven element sets.- Undecidable problems concerning generalized pascal triangles of commutative algebras.- Regular augmentation of automata and transducers.- On some types of pseudo-random sequences.- The space complexity of the accessibility problem for undirected graphs of log n bounded genus.- An alternative, priority-free, solution to Post's problem.- Near optimal algorithms for finding minimum Steiner trees on random graphs.- Matrix systems and principal cones of algebraic power series.- Two characterizations of the logarithmic alternation hierarchy.- p-Projection reducibility and the complexity classes (nonuniform) and N (nonuniform).- A proof system to derive eventuality properties under justice hypothesis.- Al-Khowarizmi : A formal system for higher-order logic programming.- One-sided Dyck reduction over two letter alphabet and deterministic context-free languages.- Model and complexity of termination for distributed computations.- Complexity of generalized graph coloring.- The parallel complexity of deadlock detection.- The centers of context-sensitive languages.- A greedy algorithm for constructing shortest common superstrings.- The OI-hierarchy is closed under control.- On the degree of ambiguity of finite automata.- Learning in knowledge based systems, a possibilistic approach.- Proofs that Release Minimum Knowledge.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume constitutes the proceedings of the 19th International Symposium on Mathematical Foundations of Theoretical Computer Science, MFCS '94, held in Kosice, Slovakia in August 1994.MFCS '94 brought together specialists in theoretical fields of computer science from various countries in order to stimulate mathematical research in theoretical computer science. Besides 12 papers based on invited talks by renowned experts, the book contains 42 research contributions selected from a total of 112 submissions. All areas of theoretical computer science are presented, some from a particular mathematical point of view.

Paperback. Zustand: 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.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains papers selected for presentation at the Silver Jubilee 25th Symposium on Mathematical Foundations of Computer Science MFCS 2000, held in Bratislava, Slovakia, August 28 { September 1, 2000. MFCS 2000 was organized under the auspices of the Minister of Education of the Slovak Republic, Milan Ft a cnik, by the Slovak Society for Computer Science, and the Comenius University in Bratislava, in cooperation with other institu- ons in Slovakia. It was supported by the European Association for Theoretical Computer Science, the European Research Consortium for Informatics and - thematics, and the Slovak Research Consortium for Informatics and Mathe- tics. The series of MFCS symposia, organized alternately in the Czech Republic, Poland, and Slovakia since 1972, has a well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science. Their broad scope provides an opportunity of bringing together spec- lists who do not usually meet at specialized conferences. The previous meetings took place in Jablonna, 1972; Strbsk e Pleso, 1973; Jadwisin, 1974; Mari ansk e L azn e, 1975; Gdansk, 1976; Tatransk a Lomnica, 1977; Zakopane, 1978; Olomouc, 1979; Rydzina, 1980; Strbsk e Pleso, 1981; Prague, 1984; Bratislava, 1986; C- lsbad, 1988; Porabk a-Kozubnik, 1989; Bansk a Bystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdansk, 1993, Ko sice, 1994; Prague, 1995; Krak ow, 1996; Bratislava, 1997; Brno, 1998; and Szklarska Poreba, 1999.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.