Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007571474/catalog> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- catalog abstract "This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.".
- catalog contributor b10461347.
- catalog contributor b10461348.
- catalog contributor b10461349.
- catalog created "c1997.".
- catalog date "1997".
- catalog date "c1997.".
- catalog dateCopyrighted "c1997.".
- catalog description "Includes bibliographical references and index.".
- catalog description "This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.".
- catalog description "Unifying Models / B. Steffen -- Predecessor Queries in Dynamic Integer Sets / G.S. Brodal -- Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs / P.G. Franciosa, D. Frigioni and R. Giaccio -- Greibach Normal Form Transformation, Revisited / R. Koch and N. Blum -- Translating Regular Expressions into Small [epsilon]-Free Nondeterministic Finite Automata / J. Hromkovic, S. Seibert and T. Wilke -- Memory Management for Union-Find Algorithms / C. Fiorio and J. Gustedt -- Fast Online Multiplication of Real Numbers / M. Schroder -- The Operators min and max on the Polynomial Hierarchy / H. Hempel and G. Wechsung -- Resource-Bounded Kolmogorov Complexity Revisited / H. Buhrman and L. Fortnow -- Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations / P. Duris, J. Hromkovic and J.D.P. Rolim [and others].".
- catalog extent "xiii, 611 p. :".
- catalog hasFormat "STACS 97.".
- catalog identifier "3540626166 (alk. paper)".
- catalog isFormatOf "STACS 97.".
- catalog isPartOf "Lecture notes in computer science ; 1200".
- catalog issued "1997".
- catalog issued "c1997.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog relation "STACS 97.".
- catalog subject "004 21".
- catalog subject "Computational complexity.".
- catalog subject "Computer science Congresses.".
- catalog subject "Computer science.".
- catalog subject "Information theory.".
- catalog subject "QA75.5 .S956 1997".
- catalog tableOfContents "Unifying Models / B. Steffen -- Predecessor Queries in Dynamic Integer Sets / G.S. Brodal -- Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs / P.G. Franciosa, D. Frigioni and R. Giaccio -- Greibach Normal Form Transformation, Revisited / R. Koch and N. Blum -- Translating Regular Expressions into Small [epsilon]-Free Nondeterministic Finite Automata / J. Hromkovic, S. Seibert and T. Wilke -- Memory Management for Union-Find Algorithms / C. Fiorio and J. Gustedt -- Fast Online Multiplication of Real Numbers / M. Schroder -- The Operators min and max on the Polynomial Hierarchy / H. Hempel and G. Wechsung -- Resource-Bounded Kolmogorov Complexity Revisited / H. Buhrman and L. Fortnow -- Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations / P. Duris, J. Hromkovic and J.D.P. Rolim [and others].".
- catalog title "STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27-March 1, 1997 : proceedings / Rüdiger Reischuk, Michel Morvan (eds.).".
- catalog type "Conference proceedings. fast".
- catalog type "text".