The Resource Algorithms and Complexity : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri, (electronic resource)

Algorithms and Complexity : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri, (electronic resource)

Label
Algorithms and Complexity : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings
Title
Algorithms and Complexity
Title remainder
5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings
Statement of responsibility
by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri
Creator
Contributor
Author
Author
Subject
Language
  • eng
  • eng
Member of
http://bibfra.me/vocab/relation/corporateauthor
J7kfY7Hu6hQ
http://library.link/vocab/creatorName
Petreschi, Rosella
Dewey number
511/.8
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsaut
  • o4UWhTmMIUs
  • lM5FobyaBgY
  • ik_GxHLrJio
Image bit depth
0
Language note
English
LC call number
QA8.9-10.3
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2003
http://bibfra.me/vocab/lite/meetingName
Italian Conference on Algorithms and Complexity
Nature of contents
dictionaries
http://bibfra.me/vocab/lite/organizationName
Italian Conference on Algorithms and Complexity
http://library.link/vocab/relatedWorkOrContributorName
  • Italian Conference on Algorithms and Complexity
  • Persiano, Giuseppe.
  • Silvestri, Riccardo.
Series statement
Lecture Notes in Computer Science,
Series volume
2653
http://library.link/vocab/subjectName
  • Logic, Symbolic and mathematical
  • Computer software
  • Data structures (Computer scienc
  • Computer science
  • Computational complexity
  • Computer graphics
  • Mathematical Logic and Foundations
  • Algorithm Analysis and Problem Complexity
  • Data Structures
  • Computation by Abstract Devices
  • Discrete Mathematics in Computer Science
  • Computer Graphics
Label
Algorithms and Complexity : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems
Dimensions
unknown
Edition
1st ed. 2003.
Extent
1 online resource (X, 290 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540448495
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/3-540-44849-7
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000212159
  • (SSID)ssj0000321200
  • (PQKBManifestationID)11231225
  • (PQKBTitleCode)TC0000321200
  • (PQKBWorkID)10263232
  • (PQKB)10458570
  • (DE-He213)978-3-540-44849-5
  • (MiAaPQ)EBC3072107
  • (EXLCZ)991000000000212159
Label
Algorithms and Complexity : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems
Dimensions
unknown
Edition
1st ed. 2003.
Extent
1 online resource (X, 290 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540448495
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/3-540-44849-7
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000212159
  • (SSID)ssj0000321200
  • (PQKBManifestationID)11231225
  • (PQKBTitleCode)TC0000321200
  • (PQKBWorkID)10263232
  • (PQKB)10458570
  • (DE-He213)978-3-540-44849-5
  • (MiAaPQ)EBC3072107
  • (EXLCZ)991000000000212159

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...