Data Portal @ linkeddatafragments.org

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

• catalog abstract "th This volume contains the proceedings of the 18 FST&TCS conference (Fo- dations of Software Technology and Theoretical Computer Science), organized under the auspices of the Indian Association for Research in Computing Science (http://www. imsc. ernet. in/ iarcs). This year’s conference attracted 93 submissions from as many as 22 co- tries. Each submission was reviewed by at least three independent referees. The Programme Committee met on August 1 and 2, 1998, at Chennai and selected 28 papers for inclusion in the conference programme. We thank the Programme Committee members and the reviewers for their sincere e?orts. We are fortunate to have six invited speakers this year, providing for a very attractive programme: Rajeev Alur, Ken McMillan, Neil Immerman, John Reif, Erik Meineche Schmidt and Umesh Vazirani. The conference has two theme sessions: Model Checking (with invited talks by Alur and McMillan, and 4 c- tributedpapers),andQuantumComputation(withinvitedtalksbySchmidtand Vazirani). Moreover,the conference is preceded by a two-day workshop(Dec- ber 14–15, 1998) on Molecular Computing (organized by Kamala Krithivasan), and a two-day school (December 15–16, 1998) on Finite Model Theory (or- nized by Anuj Dawar and Anil Seth). The Molecular Computation Workshop includes talks by Natasha Jonoska, Kamala Krithivasan, Georghe Paun, John Reif,YasubumiSakakibara,RaniSiromoneyandK. G. Subramanian. Thespe- ers at the Finite Model Theory school include Anuj Dawar, Martin Grohe, Neil Immerman, Anil Seth, Wolfgang Thomas, Moshe Vardi and Victor Vianu.".
• catalog alternative "FSTTCS'98".
• catalog contributor b11066877.
• catalog contributor b11066878.
• catalog contributor b11066879.
• catalog created "c1998.".
• catalog date "1998".
• catalog date "c1998.".
• catalog dateCopyrighted "c1998.".
• catalog description "Benefits of Tree Transducers for Optimizing Functional Programs -- Implementable Failure Detectors in Asynchronous Systems -- Invited Talk 3 -- BRICS and Quantum Information Processing -- Session 5(a) -- Martingales and Locality in Distributed Computing -- Space Efficient Suffix Trees -- Session 5(b) -- Formal Verification of an O.S. Submodule -- Infinite Probabilistic and Nonprobabilistic Testing -- Session 6(a) -- On Generating Strong Elimination Orderings of Strongly Chordal Graphs -- A Parallel Approximation Algorithm for Minimum Weight Triangulation -- Session 6(b) -- The Power of Reachability Testing for Timed Automata -- Recursive Mean-Value Calculus -- Invited Talk 4 -- Efficient Formal Verification of Hierarchical Descriptions -- Invited Talk 5 -- Proof Rules for Model Checking Systems with Data -- Session 7 -- Partial Order Reductions for Bisimulation Checking -- First-Order-CTL Model Checking -- Session 8(a) -- ".
• catalog description "Includes bibliographical references and index.".
• catalog description "Invited Talk 1 -- Descriptive Complexity and Model Checking -- Session 1(a) -- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem -- A Hamiltonian Approach to the Assignment of Non-reusable Frequencies -- Session 1(b) -- Deadlock Sensitive Types for Lambda Calculus with Resources -- On encoding p? in m? -- Session 2(a) -- Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets -- Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling -- Session 2(b) -- A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems -- Testing Theories for Asynchronous Languages -- Invited Talk 2 -- Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation -- Session 3 -- Optimal Regular Tree Pattern Matching Using Pushdown Automata -- Locating Matches of Tree Patterns in Forests -- Session 4 -- ".
• catalog description "On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms -- Remarks on Graph Complexity -- Session 8(b) -- On the Confluence of Trace Rewriting Systems -- A String-Rewriting Characterization of Muller and Schupp’s Context-Free Graphs -- Session 9 -- Different Types of Monotonicity for Restarting Automata -- A Kleene Iteration for Parallelism -- Invited Talk 6 -- Quantum Computation and Information.".
• catalog description "th This volume contains the proceedings of the 18 FST&TCS conference (Fo- dations of Software Technology and Theoretical Computer Science), organized under the auspices of the Indian Association for Research in Computing Science (http://www. imsc. ernet. in/ iarcs). This year’s conference attracted 93 submissions from as many as 22 co- tries. Each submission was reviewed by at least three independent referees. The Programme Committee met on August 1 and 2, 1998, at Chennai and selected 28 papers for inclusion in the conference programme. We thank the Programme Committee members and the reviewers for their sincere e?orts. We are fortunate to have six invited speakers this year, providing for a very attractive programme: Rajeev Alur, Ken McMillan, Neil Immerman, John Reif, Erik Meineche Schmidt and Umesh Vazirani. The conference has two theme sessions: Model Checking (with invited talks by Alur and McMillan, and 4 c- tributedpapers),andQuantumComputation(withinvitedtalksbySchmidtand Vazirani). Moreover,the conference is preceded by a two-day workshop(Dec- ber 14–15, 1998) on Molecular Computing (organized by Kamala Krithivasan), and a two-day school (December 15–16, 1998) on Finite Model Theory (or- nized by Anuj Dawar and Anil Seth). The Molecular Computation Workshop includes talks by Natasha Jonoska, Kamala Krithivasan, Georghe Paun, John Reif,YasubumiSakakibara,RaniSiromoneyandK. G. Subramanian. Thespe- ers at the Finite Model Theory school include Anuj Dawar, Martin Grohe, Neil Immerman, Anil Seth, Wolfgang Thomas, Moshe Vardi and Victor Vianu.".
• catalog extent "xii, 366 p. :".
• catalog identifier "3540653848 (pbk)".
• catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 1530".
• catalog issued "1998".
• catalog issued "c1998.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "511.3 21".
• catalog subject "Computational complexity.".
• catalog subject "Computer science.".
• catalog subject "Evolutionary programming (Computer science) Congresses.".
• catalog subject "Information theory.".
• catalog subject "Molecular computers Congresses.".
• catalog subject "Quantum computers Congresses.".
• catalog subject "Software engineering.".
• catalog tableOfContents "Benefits of Tree Transducers for Optimizing Functional Programs -- Implementable Failure Detectors in Asynchronous Systems -- Invited Talk 3 -- BRICS and Quantum Information Processing -- Session 5(a) -- Martingales and Locality in Distributed Computing -- Space Efficient Suffix Trees -- Session 5(b) -- Formal Verification of an O.S. Submodule -- Infinite Probabilistic and Nonprobabilistic Testing -- Session 6(a) -- On Generating Strong Elimination Orderings of Strongly Chordal Graphs -- A Parallel Approximation Algorithm for Minimum Weight Triangulation -- Session 6(b) -- The Power of Reachability Testing for Timed Automata -- Recursive Mean-Value Calculus -- Invited Talk 4 -- Efficient Formal Verification of Hierarchical Descriptions -- Invited Talk 5 -- Proof Rules for Model Checking Systems with Data -- Session 7 -- Partial Order Reductions for Bisimulation Checking -- First-Order-CTL Model Checking -- Session 8(a) -- ".
• catalog tableOfContents "Invited Talk 1 -- Descriptive Complexity and Model Checking -- Session 1(a) -- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem -- A Hamiltonian Approach to the Assignment of Non-reusable Frequencies -- Session 1(b) -- Deadlock Sensitive Types for Lambda Calculus with Resources -- On encoding p? in m? -- Session 2(a) -- Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets -- Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling -- Session 2(b) -- A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems -- Testing Theories for Asynchronous Languages -- Invited Talk 2 -- Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation -- Session 3 -- Optimal Regular Tree Pattern Matching Using Pushdown Automata -- Locating Matches of Tree Patterns in Forests -- Session 4 -- ".
• catalog tableOfContents "On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms -- Remarks on Graph Complexity -- Session 8(b) -- On the Confluence of Trace Rewriting Systems -- A String-Rewriting Characterization of Muller and Schupp’s Context-Free Graphs -- Session 9 -- Different Types of Monotonicity for Restarting Automata -- A Kleene Iteration for Parallelism -- Invited Talk 6 -- Quantum Computation and Information.".
• catalog title "FSTTCS'98".
• catalog title "Foundations of software technology and theoretical computer science : 18th conference, Chennai, India, December 17-19, 1998 : proceedings / V. Arvind, R. Ramanujam (eds.).".
• catalog type "text".