The Resource Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)
Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)
Resource Information
The item Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 "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
 Language
 eng
 Extent
 viii, 222 pages
 Note
 "Papers presented at the Second Italian Conference on Algorithms and Complexity (CIAC '94)"Pref
 Contents

 On the intellectual terrain around NP / J. Hartmanis, S. Chari
 Advances in graph drawing / A. Garg, R. Tamassia
 On a parallelalgorithms 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 noninteractive electronic cash system / G. Di Crescenzo
 A unified scheme for routing in expander based networks / S. Even, A. Litman
 Dynamization of backtrackfree search for the constraint satisfaction problem / D. Frigioni, A. MarchettiSpaccamela, U. Nanni
 Efficient reorganization of binary search trees / M. Hofri, H. Shachnai
 Timemessage tradeoffs for the weak unison problem / A. Israeli ... [et al.]
 On set equalitytesting / T.W. Lam, K.H. Lee
 On the complexity of some reachability problems / A. Monti, A. Roncato
 On selfreducible sets of low information content / M. Mundhenk
 Lower bounds for merging on the hypercube / C. Rub
 Isbn
 9780387578118
 Label
 Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings
 Title
 Algorithms and complexity
 Title remainder
 second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings
 Statement of responsibility
 M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)
 Language
 eng
 Summary
 "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
 Cataloging source
 DLC
 Dewey number
 511.3
 Illustrations
 illustrations
 Index
 no index present
 LC call number
 QA9.58
 LC item number
 .A42 1994
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 1994
 http://bibfra.me/vocab/lite/meetingName
 Italian Conference on Algorithms and Complexity
 Nature of contents
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate

 1952
 1950
 http://library.link/vocab/relatedWorkOrContributorName

 Bonuccelli, M.
 Crescenzi, Pierluigi
 Petreschi, Rossella
 Series statement
 Lecture notes in computer science
 Series volume
 778
 http://library.link/vocab/subjectName

 Algorithms
 Computational complexity
 Label
 Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)
 Note
 "Papers presented at the Second Italian Conference on Algorithms and Complexity (CIAC '94)"Pref
 Bibliography note
 Includes bibliographical references
 Carrier category
 volume
 Carrier category code
 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 On the intellectual terrain around NP / J. Hartmanis, S. Chari  Advances in graph drawing / A. Garg, R. Tamassia  On a parallelalgorithms 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 noninteractive electronic cash system / G. Di Crescenzo  A unified scheme for routing in expander based networks / S. Even, A. Litman  Dynamization of backtrackfree search for the constraint satisfaction problem / D. Frigioni, A. MarchettiSpaccamela, U. Nanni  Efficient reorganization of binary search trees / M. Hofri, H. Shachnai  Timemessage tradeoffs for the weak unison problem / A. Israeli ... [et al.]  On set equalitytesting / T.W. Lam, K.H. Lee  On the complexity of some reachability problems / A. Monti, A. Roncato  On selfreducible sets of low information content / M. Mundhenk  Lower bounds for merging on the hypercube / C. Rub
 Control code
 29843490
 Dimensions
 24 cm
 Extent
 viii, 222 pages
 Isbn
 9780387578118
 Isbn Type
 (New York : acidfree paper)
 Lccn
 94003186
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code
 n
 Other physical details
 illustrations
 System control number
 (WaOLN)1574604
 Label
 Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)
 Note
 "Papers presented at the Second Italian Conference on Algorithms and Complexity (CIAC '94)"Pref
 Bibliography note
 Includes bibliographical references
 Carrier category
 volume
 Carrier category code
 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 On the intellectual terrain around NP / J. Hartmanis, S. Chari  Advances in graph drawing / A. Garg, R. Tamassia  On a parallelalgorithms 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 noninteractive electronic cash system / G. Di Crescenzo  A unified scheme for routing in expander based networks / S. Even, A. Litman  Dynamization of backtrackfree search for the constraint satisfaction problem / D. Frigioni, A. MarchettiSpaccamela, U. Nanni  Efficient reorganization of binary search trees / M. Hofri, H. Shachnai  Timemessage tradeoffs for the weak unison problem / A. Israeli ... [et al.]  On set equalitytesting / T.W. Lam, K.H. Lee  On the complexity of some reachability problems / A. Monti, A. Roncato  On selfreducible sets of low information content / M. Mundhenk  Lower bounds for merging on the hypercube / C. Rub
 Control code
 29843490
 Dimensions
 24 cm
 Extent
 viii, 222 pages
 Isbn
 9780387578118
 Isbn Type
 (New York : acidfree paper)
 Lccn
 94003186
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code
 n
 Other physical details
 illustrations
 System control number
 (WaOLN)1574604
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AlgorithmsandcomplexitysecondItalian/l3GL2IP24EM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AlgorithmsandcomplexitysecondItalian/l3GL2IP24EM/">Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AlgorithmsandcomplexitysecondItalian/l3GL2IP24EM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AlgorithmsandcomplexitysecondItalian/l3GL2IP24EM/">Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 2325, 1994 : proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>