Mathematical foundations of computer science 1986 : proceedings of the 12th symposium, Bratislava, Czechoslovakia, August 25-29, 1986
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
233 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of computer science 1986, proceedings of the 12th symposium, Bratislava, Czechoslovakia, August 25-29, 1986, edited by J. Gruska, B. Rovan, and J. Wiedermann, Berlin, Springer-Verlag, 1986, 1 vol. (ix, 650 p.), Lecture notes in computer science • Mathematical Foundations of Computer Science 1986, Texte imprimé, 9783662180846 |
| LEADER | 06382nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 944950 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155208330 | ||
| 020 | |a 9783540399094 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 005.1 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on Mathematical Foundations of Computer Science |n (12 |d :1986 |c :Bratislava, Slovaquie). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 1986 : |b proceedings of the 12th symposium, Bratislava, Czechoslovakia, August 25-29, 1986 |c edited by J. Gruska, B. Rovan, and J. Wiedermann. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 233 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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 offinite automata -- Learning in knowledge based systems, a possibilistic approach -- Proofs that Release Minimum Knowledge. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Langages formels | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Gruska, Jozef, |d 1933- |4 pbd | |
| 700 | 1 | |a Rovan, Branislav, |d 1947- |4 pbd | |
| 700 | 1 | |a Wiedermann, Juraj, |d 1948- |4 pbd | |
| 776 | 0 | |0 031022936 |t Mathematical foundations of computer science 1986 |o proceedings of the 12th symposium, Bratislava, Czechoslovakia, August 25-29, 1986 |f edited by J. Gruska, B. Rovan, and J. Wiedermann |c Berlin |n Springer-Verlag |d 1986 |p 1 vol. (ix, 650 p.) |s Lecture notes in computer science | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1986 |b Texte imprimé |z 9783662180846 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0016229 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-82M105L0-H |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747915008 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0016229 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750927666 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0016229 |z Accès INSA CVL | |
| 997 | |0 944950 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||