Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007717469/catalog> ?p ?o. }

• catalog abstract "This book constitutes the refereed proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS '97, held in Bratislava, Slovakia, in August 1997. The 40 revised full papers presented were carefully selected from a total of 94 submissions. Also included are nine invited papers and two abstracts of invited talks. The papers cover the whole range of theoretical computer science including programming theory, complexity theory, mathematical logic, rewriting, grammars, formal languages, theory of algorithms, computational graph theory, etc.".
• catalog contributor b10670020.
• catalog contributor b10670021.
• catalog contributor b10670022.
• catalog created "c1997.".
• catalog date "1997".
• catalog date "c1997.".
• catalog dateCopyrighted "c1997.".
• catalog description "Game semantics for programming languages / S. Abramsky -- Communication complexity / L. Babai -- Treewidth: algorithmic techniques and results / H.L. Bodlaender -- When are two rewrite systems more than none? / N. Dershowitz -- Positive applications of lattices to cryptography / C. Dwork -- A tile-based coordination view of asynchronous pi-calculus / G.L. Ferrari, U. Montanari -- Communication complexity and sequential computation / J. Hromkovic, G. Schnitger -- Lower bounds for a proof system with an exponential speed-up over constant-depth frege systems and over polynomial calculus / J. Krajicek -- Computational limitations of stochastic turing machines and Arthur-Merlin games with small space bounds / M. Liskiewicz, R. Reischuk -- Learning to perform knowledge-intensive inferences / D. Roth -- Resolution proofs, exponential bounds, and Kolmogorov complexity / U. Schoning -- The expressiveness of datalog circuits (DAC) / F. Afrati, I. Guessarian, M. de Rougemont -- ".
• catalog description "Includes bibliographic references and index.".
• catalog description "On the generation of trees by hyperedge replacement / F. Drewes -- Regulation by valences / H. Fernau, R. Stiebe -- Simulation as a correct transformation of rewrite systems / W. Fokkink, J. van de Pol -- On the dilation of interval routing / C. Gavoille -- Relating conflict-free stable transition and event models / Z. Khasidashvili, J. Glauert -- The giant component threshold for random regular graphs with edge faults / A. Goerdt -- A topological generalization of propositional linear time temporal logic / B. Heinemann -- Multi-head finite automata / M. Holzer -- Complexity of finding short resolution proofs / K. Iwama -- On P versus NP co-NP for decision trees and read-once branching programs / S. Jukna [and others] -- A characterization of abstract families of algebraic / G. Karner, W. Kuich -- Repetitiveness of DOL-languages is decidable in polynomial time / Y. Kobayashi, F. Otto -- Minimal letter frequency in n-th power free binary words / R. Kolpakov, G. Kucherov -- ".
• catalog description "Real-time generation of primes by a one-dimensional cellular automaton with 11 states / I. Korec -- Optimal algorithms for complete linkage clustering in d dimensions / D. Krznaric, C. Levcopoulos -- Invertible linear cellular automata over z[subscript m] / G. Manzini, L. Margara -- Two-level contextual grammars / C. Martin-Vide, J. Miquel-Verges, G. Paun -- Counting problems over the reals / K. Meer -- On the influence of the state encoding on OBDD-representations of finite state machines / Ch. Meinel, T. Theobald -- Decomposition of TrPTL formulas / R. Meyer, A. Petit -- NP-hard sets have many hard instances / M. Mundhenk -- Deciding verbose languages with linear advice / A. Nickelsen -- Homomorphic images of sentential forms and terminating grammars / H. Petersen -- Simplification orders for term graph rewriting / D. Plump -- Dependency-based action refinement / A. Rensink, H. Wehrheim -- A hierarchy for (1,+k)-branching programs with respect to k / P. Savicky, S. Zak -- ".
• catalog description "Routing with finite speeds of memory and network / J.F. Sibeyn -- Queries and algorithms computable by polynomial time existential reflective machines / J. Tyszkiewicz -- Partial order semantics and read arcs / W. Vogler.".
• catalog description "The complexity of policy evaluation for finite-horizon partially-observable markov decision processes / M. Mundhenk, J. Goldsmith, E. Allender -- A category of transition systems and its relations with orthomodular posets / L. Bernardinello, L. Pomello --Accepting zeno words without time stand still / B. Berard, C. Picaronny -- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams / B. Bollig, I. Wegener -- Specifying computations using hyper transition systems / M.M. Bonsangue, J.N. Kok -- A shift-invariant metric on s[superscript z] inducing a non-trivial topology / G. Cattaneo [and others] -- Subtyping calculus of construction / G. Chen -- Distances between languages and reflexivity of relations / C. Choffrut, G. Pighizzini -- Partial characterization of synchronization languages / I. Ryl, Y. Roos, M. Clerbout -- Integrating the specification techniques of graph transformation and temporal logic / R. Heckel [and others] -- ".
• catalog description "This book constitutes the refereed proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS '97, held in Bratislava, Slovakia, in August 1997. The 40 revised full papers presented were carefully selected from a total of 94 submissions. Also included are nine invited papers and two abstracts of invited talks. The papers cover the whole range of theoretical computer science including programming theory, complexity theory, mathematical logic, rewriting, grammars, formal languages, theory of algorithms, computational graph theory, etc.".
• catalog extent "x, 517 p. :".
• catalog identifier "3540634371 (pbk)".
• catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 1295".
• catalog issued "1997".
• catalog issued "c1997.".
• catalog language "eng".
• catalog publisher "Berlin ; London : Springer,".
• catalog subject "004.0151 21".
• catalog subject "Computational complexity.".
• catalog subject "Computer science Mathematics Congresses.".
• catalog subject "Computer science.".
• catalog subject "Information theory.".
• catalog subject "QA76.9.M35 M387 1997".
• catalog subject "Software engineering.".
• catalog tableOfContents "Game semantics for programming languages / S. Abramsky -- Communication complexity / L. Babai -- Treewidth: algorithmic techniques and results / H.L. Bodlaender -- When are two rewrite systems more than none? / N. Dershowitz -- Positive applications of lattices to cryptography / C. Dwork -- A tile-based coordination view of asynchronous pi-calculus / G.L. Ferrari, U. Montanari -- Communication complexity and sequential computation / J. Hromkovic, G. Schnitger -- Lower bounds for a proof system with an exponential speed-up over constant-depth frege systems and over polynomial calculus / J. Krajicek -- Computational limitations of stochastic turing machines and Arthur-Merlin games with small space bounds / M. Liskiewicz, R. Reischuk -- Learning to perform knowledge-intensive inferences / D. Roth -- Resolution proofs, exponential bounds, and Kolmogorov complexity / U. Schoning -- The expressiveness of datalog circuits (DAC) / F. Afrati, I. Guessarian, M. de Rougemont -- ".
• catalog tableOfContents "On the generation of trees by hyperedge replacement / F. Drewes -- Regulation by valences / H. Fernau, R. Stiebe -- Simulation as a correct transformation of rewrite systems / W. Fokkink, J. van de Pol -- On the dilation of interval routing / C. Gavoille -- Relating conflict-free stable transition and event models / Z. Khasidashvili, J. Glauert -- The giant component threshold for random regular graphs with edge faults / A. Goerdt -- A topological generalization of propositional linear time temporal logic / B. Heinemann -- Multi-head finite automata / M. Holzer -- Complexity of finding short resolution proofs / K. Iwama -- On P versus NP co-NP for decision trees and read-once branching programs / S. Jukna [and others] -- A characterization of abstract families of algebraic / G. Karner, W. Kuich -- Repetitiveness of DOL-languages is decidable in polynomial time / Y. Kobayashi, F. Otto -- Minimal letter frequency in n-th power free binary words / R. Kolpakov, G. Kucherov -- ".
• catalog tableOfContents "Real-time generation of primes by a one-dimensional cellular automaton with 11 states / I. Korec -- Optimal algorithms for complete linkage clustering in d dimensions / D. Krznaric, C. Levcopoulos -- Invertible linear cellular automata over z[subscript m] / G. Manzini, L. Margara -- Two-level contextual grammars / C. Martin-Vide, J. Miquel-Verges, G. Paun -- Counting problems over the reals / K. Meer -- On the influence of the state encoding on OBDD-representations of finite state machines / Ch. Meinel, T. Theobald -- Decomposition of TrPTL formulas / R. Meyer, A. Petit -- NP-hard sets have many hard instances / M. Mundhenk -- Deciding verbose languages with linear advice / A. Nickelsen -- Homomorphic images of sentential forms and terminating grammars / H. Petersen -- Simplification orders for term graph rewriting / D. Plump -- Dependency-based action refinement / A. Rensink, H. Wehrheim -- A hierarchy for (1,+k)-branching programs with respect to k / P. Savicky, S. Zak -- ".
• catalog tableOfContents "Routing with finite speeds of memory and network / J.F. Sibeyn -- Queries and algorithms computable by polynomial time existential reflective machines / J. Tyszkiewicz -- Partial order semantics and read arcs / W. Vogler.".
• catalog tableOfContents "The complexity of policy evaluation for finite-horizon partially-observable markov decision processes / M. Mundhenk, J. Goldsmith, E. Allender -- A category of transition systems and its relations with orthomodular posets / L. Bernardinello, L. Pomello --Accepting zeno words without time stand still / B. Berard, C. Picaronny -- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams / B. Bollig, I. Wegener -- Specifying computations using hyper transition systems / M.M. Bonsangue, J.N. Kok -- A shift-invariant metric on s[superscript z] inducing a non-trivial topology / G. Cattaneo [and others] -- Subtyping calculus of construction / G. Chen -- Distances between languages and reflexivity of relations / C. Choffrut, G. Pighizzini -- Partial characterization of synchronization languages / I. Ryl, Y. Roos, M. Clerbout -- Integrating the specification techniques of graph transformation and temporal logic / R. Heckel [and others] -- ".
• catalog title "Mathematical foundations of computer science 1997 : 22nd International Symposium, MFCS '97, Bratislava, Slovakia, August 25-29, 1997 : proceedings / Igor Prívara, Peter Ružička (eds.).".
• catalog type "Conference proceedings. fast".
• catalog type "Pressburg (1997) swd".
• catalog type "text".