Data Portal @ linkeddatafragments.org

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

• catalog abstract ""The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis."--PUBLISHER'S WEBSITE.".
• catalog contributor b6182778.
• catalog contributor b6182779.
• catalog contributor b6182780.
• catalog contributor b6182781.
• catalog contributor b6182782.
• catalog created "c1994.".
• catalog date "1994".
• catalog date "c1994.".
• catalog dateCopyrighted "c1994.".
• catalog description ""The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis."--PUBLISHER'S WEBSITE.".
• catalog description "Includes bibliographical references.".
• catalog description "On the intellectual terrain around NP / J. Hartmanis, S. Chari -- Advances in graph drawing / A. Garg, R. Tamassia -- On a parallel-algorithms method for string matching problems / S.C. Sahinalp, U. Vishkin -- Some open problems in approximation / M. Yannakakis -- New local search approximation techniques for maximum generalized satisfiability problems / P. Alimonti -- Learning behaviors of automata from multiplicity and equivalence queries / F. Bergadano, S. Varricchio -- Measures of boolean function complexity based on harmonic analysis / A. Bernasconi, B. Codenotti -- Graph theory and interactive protocols for reachability problems on finite cellular Automata / A. Clementi, R. Impagliazzo -- Parallel pruning decomposition (PDS) and biconnected components of graphs / E. Dekel, J. Hu -- A non-interactive electronic cash system / G. Di Crescenzo -- A unified scheme for routing in expander based networks / S. Even, A. Litman -- Dynamization of backtrack-free search for the constraint satisfaction problem / D. Frigioni, A. Marchetti-Spaccamela, U. Nanni -- Efficient reorganization of binary search trees / M. Hofri, H. Shachnai -- Time-message trade-offs for the weak unison problem / A. Israeli [and others] -- On set equality-testing / T.W. Lam, K.H. Lee -- On the complexity of some reachability problems / A. Monti, A. Roncato -- On self-reducible sets of low information content / M. Mundhenk -- Lower bounds for merging on the hypercube / C. Rub.".
• catalog extent "viii, 222 p. :".
• catalog identifier "0387578110 (New York : acid-free paper)".
• catalog identifier "3540578110 (Berlin : acid-free paper)".
• catalog isPartOf "Lecture notes in computer science ; 778".
• catalog issued "1994".
• catalog issued "c1994.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer-Verlag,".
• catalog subject "511.3 20".
• catalog subject "Algorithms Congresses.".
• catalog subject "Computational complexity Congresses.".
• catalog subject "QA9.58 .A42 1994".
• catalog tableOfContents "On the intellectual terrain around NP / J. Hartmanis, S. Chari -- Advances in graph drawing / A. Garg, R. Tamassia -- On a parallel-algorithms method for string matching problems / S.C. Sahinalp, U. Vishkin -- Some open problems in approximation / M. Yannakakis -- New local search approximation techniques for maximum generalized satisfiability problems / P. Alimonti -- Learning behaviors of automata from multiplicity and equivalence queries / F. Bergadano, S. Varricchio -- Measures of boolean function complexity based on harmonic analysis / A. Bernasconi, B. Codenotti -- Graph theory and interactive protocols for reachability problems on finite cellular Automata / A. Clementi, R. Impagliazzo -- Parallel pruning decomposition (PDS) and biconnected components of graphs / E. Dekel, J. Hu -- A non-interactive electronic cash system / G. Di Crescenzo -- A unified scheme for routing in expander based networks / S. Even, A. Litman -- Dynamization of backtrack-free search for the constraint satisfaction problem / D. Frigioni, A. Marchetti-Spaccamela, U. Nanni -- Efficient reorganization of binary search trees / M. Hofri, H. Shachnai -- Time-message trade-offs for the weak unison problem / A. Israeli [and others] -- On set equality-testing / T.W. Lam, K.H. Lee -- On the complexity of some reachability problems / A. Monti, A. Roncato -- On self-reducible sets of low information content / M. Mundhenk -- Lower bounds for merging on the hypercube / C. Rub.".
• catalog title "Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994 : proceedings / M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.).".
• catalog type "Conference proceedings. fast".
• catalog type "text".