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.
Mathematical Foundations of Computer Science 1994 [[electronic resource] ] : 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994. Proceedings / / edited by Igor Privara, Branislav Rovan, Peter Ruzicka
| Mathematical Foundations of Computer Science 1994 [[electronic resource] ] : 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994. Proceedings / / edited by Igor Privara, Branislav Rovan, Peter Ruzicka |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XI, 633 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Software engineering Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering |
| ISBN | 3-540-48663-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models, languages, and compiler technology for high performance computers -- On NC-real complexity classes for additive circuits and their relations with NC -- E-complete sets do not have optimal polynomial time approximations -- Solving polynomial fixed point equations -- Capturing complexity classes with Lindström quantifiers -- Communication throughput of interconnection networks -- Intuitive counterexamples for constructive fallacies -- Algebraic methods in the compositional analysis of logic programs -- Longest common subsequences -- Towards DNA sequencing chips -- On-line scheduling of parallel jobs -- Stable bistructure models of PCF -- A Competitive analysis of the list update problem with lookahead -- May and must convergency in concurrent ?-calculus -- Genericity and measure for exponential time -- Analysis of bounded disorder -- On languages accepted with simultaneous complexity bounds and their ranking problem -- A proof system for asynchronously communicating deterministic processes -- Embedding complete binary trees into star networks -- Inductive counting below logspace -- Decision problems for edge grammars -- “The big sweep”: On the power of the wavefront approach to Voronoi diagrams -- Reliable minimum finding comparator networks -- On parallel complexity of maximum f-matching and the degree sequence problem -- A comparison of two lower bound methods for communication complexity -- Efficient solving of the word equations in one variable -- A ?-calculus with explicit substitutions: The late semantics -- Processes and hyperuniverses -- The combinatorial complexity of a finite string -- A fully abstract semantics for termination in Petri nets -- Passive and active rules in deductive databases -- Combinatorial results on the complexity of teaching and learning -- Degrees and reducibilities of easy tally sets -- MSO definable text languages -- Two lower bounds on distributive generation of languages -- Rational rewriting -- On the size of independent systems of equations in semigroups -- On a sublinear time parallel construction of optimal binary search trees -- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems -- The relationship between gossiping in vertex-disjoint paths mode and bisection width -- A comparison of finite and cellular automata -- Empty alternation -- On the minimization problem for ?-automata -- On the complexity of constructing optimal ordered binary decision diagrams -- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach -- A completeness theorem for nondeterministic Kleene algebras -- How a rainbow coloring function can simulate wait-free handshaking -- Critical pairs in term graph rewriting -- Read-write causality -- Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable -- Complexity of EOL structural equivalence -- Shorter queues for permutation routing on meshes -- Full abstraction for the second order subset of an ALGOL-like language -- The finest homophonic partition and related code concepts. |
| Record Nr. | UNISA-996466099103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Foundations of Computer Science 1997 [[electronic resource] ] : 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings / / edited by Igor Privara, Peter Ruzicka
| Mathematical Foundations of Computer Science 1997 [[electronic resource] ] : 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings / / edited by Igor Privara, Peter Ruzicka |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 526 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Programming languages (Electronic computers) Software engineering Computer science—Mathematics Theory of Computation Programming Languages, Compilers, Interpreters Software Engineering Discrete Mathematics in Computer Science |
| ISBN | 3-540-69547-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Game semantics for programming languages -- Communication complexity -- Treewidth: Algorithmic techniques and results -- When are two rewrite systems more than none? -- Positive applications of lattices to cryptography -- A tile-based coordination view of asynchronous ?-calculus -- Communication complexity and sequential computation -- Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus -- Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds -- Learning to perform knowledge-intensive inferences -- Resolution proofs, exponential bounds, and Kolmogorov complexity -- The expressiveness of Datalog cicuits (DAC) -- The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes -- A category of transition systems and its relations with orthomodular posets -- Accepting Zeno words without making time stand still -- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams -- Specifying computations using hyper transition systems -- A shift-invariant metric on S zz inducing a non-trivial topology -- Subtyping calculus of construction (extended abstract) -- Distances between languages and reflexivity of relations -- Partial characterization of synchronization languages -- Integrating the specification techniques of graph transformation and temporal logic -- On the generation of trees by hyperedge replacement -- Regulation by valences -- Simulation as a correct transformation of rewrite systems -- On the dilation of interval routing -- Relating conflict-free stable transition and event models (extended abstract) -- The giant component threshold for random regular graphs with edge faults -- A topological generalization of propositional linear time temporal logic -- Multi-head finite automata: Data-independent versus data-dependent computations -- Complexity of finding short resolution proofs -- On P versus NP?co-NP for decision trees and read-once branching programs -- A characterization of abstract families of algebraic power series -- Repetitiveness of D0L-languages is decidable in polynomial time -- Minimal letter frequency in n-th power-free binary words -- Real-time generation of primes by a one-dimensional cellular automaton with 11 states -- Optimal algorithms for complete linkage clustering in d dimensions -- Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects -- Two-level contextual grammars: The internal case -- Counting problems over the reals -- On the influence of the state encoding on OBDD-representations of finite state machines -- Decomposition of TrPTL formulas -- NP-hard sets have many hard instances -- Deciding verbose languages with linear advice -- Homomorphic images of sentential forms and terminating grammars (extended abstract) -- Simplification orders for term graph rewriting -- Dependency-based action refinement -- A hierarchy for (1, +k)-branching programs with respect to k -- Routing with finite speeds of memory and network -- Queries and algorithms computable by polynomial time existential reflective machines -- Partial order semantics and read arcs. |
| Record Nr. | UNINA-9910144917503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Foundations of Computer Science 1997 [[electronic resource] ] : 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings / / edited by Igor Privara, Peter Ruzicka
| Mathematical Foundations of Computer Science 1997 [[electronic resource] ] : 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings / / edited by Igor Privara, Peter Ruzicka |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 526 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Programming languages (Electronic computers) Software engineering Computer science—Mathematics Theory of Computation Programming Languages, Compilers, Interpreters Software Engineering Discrete Mathematics in Computer Science |
| ISBN | 3-540-69547-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Game semantics for programming languages -- Communication complexity -- Treewidth: Algorithmic techniques and results -- When are two rewrite systems more than none? -- Positive applications of lattices to cryptography -- A tile-based coordination view of asynchronous ?-calculus -- Communication complexity and sequential computation -- Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus -- Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds -- Learning to perform knowledge-intensive inferences -- Resolution proofs, exponential bounds, and Kolmogorov complexity -- The expressiveness of Datalog cicuits (DAC) -- The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes -- A category of transition systems and its relations with orthomodular posets -- Accepting Zeno words without making time stand still -- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams -- Specifying computations using hyper transition systems -- A shift-invariant metric on S zz inducing a non-trivial topology -- Subtyping calculus of construction (extended abstract) -- Distances between languages and reflexivity of relations -- Partial characterization of synchronization languages -- Integrating the specification techniques of graph transformation and temporal logic -- On the generation of trees by hyperedge replacement -- Regulation by valences -- Simulation as a correct transformation of rewrite systems -- On the dilation of interval routing -- Relating conflict-free stable transition and event models (extended abstract) -- The giant component threshold for random regular graphs with edge faults -- A topological generalization of propositional linear time temporal logic -- Multi-head finite automata: Data-independent versus data-dependent computations -- Complexity of finding short resolution proofs -- On P versus NP?co-NP for decision trees and read-once branching programs -- A characterization of abstract families of algebraic power series -- Repetitiveness of D0L-languages is decidable in polynomial time -- Minimal letter frequency in n-th power-free binary words -- Real-time generation of primes by a one-dimensional cellular automaton with 11 states -- Optimal algorithms for complete linkage clustering in d dimensions -- Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects -- Two-level contextual grammars: The internal case -- Counting problems over the reals -- On the influence of the state encoding on OBDD-representations of finite state machines -- Decomposition of TrPTL formulas -- NP-hard sets have many hard instances -- Deciding verbose languages with linear advice -- Homomorphic images of sentential forms and terminating grammars (extended abstract) -- Simplification orders for term graph rewriting -- Dependency-based action refinement -- A hierarchy for (1, +k)-branching programs with respect to k -- Routing with finite speeds of memory and network -- Queries and algorithms computable by polynomial time existential reflective machines -- Partial order semantics and read arcs. |
| Record Nr. | UNISA-996465768203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||