05273nam 22008175 450 991014386000332120200701011359.03-540-44849-710.1007/3-540-44849-7(CKB)1000000000212159(SSID)ssj0000321200(PQKBManifestationID)11231225(PQKBTitleCode)TC0000321200(PQKBWorkID)10263232(PQKB)10458570(DE-He213)978-3-540-44849-5(MiAaPQ)EBC3072107(PPN)155206397(EXLCZ)99100000000021215920121227d2003 u| 0engurnn|008mamaatxtccrAlgorithms and Complexity 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings /by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (X, 290 p.) Lecture Notes in Computer Science,0302-9743 ;2653Bibliographic Level Mode of Issuance: Monograph3-540-40176-8 Includes bibliographical references and index.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.Lecture Notes in Computer Science,0302-9743 ;2653Mathematical logicAlgorithmsData structures (Computer science)ComputersComputer science—MathematicsComputer graphicsMathematical Logic and Foundationshttps://scigraph.springernature.com/ontologies/product-market-codes/M24005Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Mathematical logic.Algorithms.Data structures (Computer science).Computers.Computer science—Mathematics.Computer graphics.Mathematical Logic and Foundations.Algorithm Analysis and Problem Complexity.Data Structures.Computation by Abstract Devices.Discrete Mathematics in Computer Science.Computer Graphics.511/.8Petreschi Rosellaauthttp://id.loc.gov/vocabulary/relators/aut871316Persiano Giuseppeauthttp://id.loc.gov/vocabulary/relators/autSilvestri Riccardoauthttp://id.loc.gov/vocabulary/relators/autItalian Conference on Algorithms and ComplexityMiAaPQMiAaPQMiAaPQBOOK9910143860003321Algorithms and Complexity1945102UNINA