Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings / / edited by Gunther Schmidt, Rudolf Berghammer
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings / / edited by Gunther Schmidt, Rudolf Berghammer |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (VIII, 256 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Algorithms Combinatorics Computers Data structures (Computer science) Logic design Mathematics of Computing Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures Logic Design |
| ISBN | 3-540-46735-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximating treewidth, pathwidth, and minimum elimination tree height -- Monadic second-order evaluations on tree-decomposable graphs -- Optimal embedding of complete binary trees into lines and grids -- Graph rewriting systems and their application to network reliability analysis -- Nondeterministic control structures for graph rewriting systems -- A language for generic graph-transformations -- Attributed elementary programmed graph grammars -- The complexity of approximating the class Steiner tree problem -- On complexity of some chain and antichain partition problems -- Tight bounds for the rectangular art gallery problem -- Voronoi diagrams of moving points in the plane -- Using maximal independent sets to solve problems in parallel -- Fast parallel algorithms for coloring random graphs -- Optimal vertex ordering of a graph and its application to symmetry detection -- Edge separators for graphs of bounded genus with applications -- Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing -- A generalized encryption scheme based on random graphs -- Dynamic algorithms for shortest paths in planar graphs -- Complete problems for logspace involving lexicographic first paths in graphs -- A new upper bound on the complexity of the all pairs shortest path problem -- On the crossing number of the hypercube and the cube connected cycles -- Logic arrays for interval indicator functions -- On the broadcast time of the butterfly network -- On disjoint cycles -- Short disjoint cycles in cubic bridgeless graphs. |
| Record Nr. | UNISA-996465640103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Relations and Kleene Algebra in Computer Science [[electronic resource] ] : 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and 6th International Conference on Applications of Kleene Algebra, AKA 2009, Doha, Qatar, November 1-5, 2009, Proceedings / / edited by Rudolf Berghammer, Ali Jaoua, Bernhard Möller
| Relations and Kleene Algebra in Computer Science [[electronic resource] ] : 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and 6th International Conference on Applications of Kleene Algebra, AKA 2009, Doha, Qatar, November 1-5, 2009, Proceedings / / edited by Rudolf Berghammer, Ali Jaoua, Bernhard Möller |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (VIII, 367 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Discrete mathematics Computer science Algebra Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Science Logic and Foundations of Programming Order, Lattices, Ordered Algebraic Structures |
| ISBN | 3-642-04639-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Knowledge and Structure in Social Algorithms -- Computational Social Choice Using Relation Algebra and RelView -- A Model of Internet Routing Using Semi-modules -- Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs -- Towards Algebraic Separation Logic -- Domain and Antidomain Semigroups -- Composing Partially Ordered Monads -- A Relation-Algebraic Approach to Liveness of Place/Transition Nets -- ?-Continuous Idempotent Left Semirings and Their Ideal Completion -- A Semiring Approach to Equivalences, Bisimulations and Control -- General Correctness Algebra -- Foundations of Concurrent Kleene Algebra -- Armstrong’s Inference Rules in Dedekind Categories -- Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage -- Collagories for Relational Adhesive Rewriting -- Cardinal Addition in Distributive Allegories -- Relational Methods in the Analysis of While Loops: Observations of Versatility -- Modalities, Relations, and Learning -- The Cube of Kleene Algebras and the Triangular Prism of Multirelations -- Discrete Duality for Relation Algebras and Cylindric Algebras -- Contact Relations with Applications -- A While Program Normal Form Theorem in Total Correctness -- Complements in Distributive Allegories -- On the Skeleton of Stonian p-Ortholattices. |
| Record Nr. | UNISA-996466274103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Relations and Kleene Algebra in Computer Science [[electronic resource] ] : 10th International Conference on Relational Methods in Computer Science, and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008, Frauenwörth, Germany, April 7-11, 2008, Proceedings / / edited by Rudolf Berghammer, Bernhard Möller, Georg Struth
| Relations and Kleene Algebra in Computer Science [[electronic resource] ] : 10th International Conference on Relational Methods in Computer Science, and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008, Frauenwörth, Germany, April 7-11, 2008, Proceedings / / edited by Rudolf Berghammer, Bernhard Möller, Georg Struth |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 402 p.) |
| Disciplina | 511.3/24 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science—Mathematics Artificial intelligence Software engineering Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Artificial Intelligence Software Engineering |
| ISBN | 3-540-78913-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal Methods and the Theory of Social Choice -- Relations Making Their Way from Logics to Mathematics and Applied Sciences -- Boolean Logics with Relations -- Relation Algebra and RelView in Practical Use: Construction of Special University Timetables -- A Relation Algebraic Semantics for a Lazy Functional Logic Language -- Latest News about Demonic Algebra with Domain -- On the Structure of Demonic Refinement Algebras with Enabledness and Termination -- Multi-objective Problems in Terms of Relational Algebra -- The Lattice of Contact Relations on a Boolean Algebra -- A Non-probabilistic Relational Model of Probabilistic Kleene Algebras -- Increasing Bisemigroups and Algebraic Routing -- Lazy Relations -- The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy -- The Algebraic Approach II: Dioids, Quantales and Monads -- Automated Reasoning for Hybrid Systems — Two Case Studies — -- Non-termination in Idempotent Semirings -- Formal Concepts in Dedekind Categories -- The Structure of the One-Generated Free Domain Semiring -- Determinisation of Relational Substitutions in Ordered Categories with Domain -- Boolean Algebras and Stone Maps in Schröder Categories -- Cardinality in Allegories -- Solving Linear Equations in *-continuous Action Lattices -- Reactive Probabilistic Programs and Refinement Algebra -- Knowledge and Games in Modal Semirings -- Theorem Proving Modulo Based on Boolean Equational Procedures -- Rectangles, Fringes, and Inverses -- An Ordered Category of Processes -- Automatic Proof Generation in Kleene Algebra. |
| Record Nr. | UNISA-996465498403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||