Algorithms and Complexity: 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings: Lecture Notes in Computer Science, cartea 2653
Autor Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestrien Limba Engleză Paperback – 15 mai 2003
Din seria Lecture Notes in Computer Science
- 20% Preț: 297.45 lei
- 20% Preț: 297.45 lei
- 20% Preț: 517.29 lei
- 5% Preț: 343.06 lei
- 20% Preț: 241.52 lei
- 20% Preț: 303.27 lei
- 20% Preț: 624.06 lei
- 20% Preț: 296.89 lei
- Preț: 346.79 lei
- Preț: 340.83 lei
- 20% Preț: 379.02 lei
- 20% Preț: 221.75 lei
- 20% Preț: 275.91 lei
- Preț: 262.38 lei
- 20% Preț: 298.57 lei
- 20% Preț: 266.97 lei
- 20% Preț: 360.10 lei
- 20% Preț: 310.09 lei
- 20% Preț: 284.43 lei
- 20% Preț: 308.00 lei
- 20% Preț: 202.42 lei
- 20% Preț: 283.35 lei
- 20% Preț: 315.25 lei
- 20% Preț: 572.84 lei
- 20% Preț: 475.27 lei
- 20% Preț: 291.91 lei
- 20% Preț: 289.52 lei
- 20% Preț: 290.45 lei
- 20% Preț: 698.69 lei
- 20% Preț: 347.90 lei
- 20% Preț: 413.13 lei
- 17% Preț: 338.16 lei
- 20% Preț: 771.51 lei
- 20% Preț: 447.62 lei
- 20% Preț: 298.57 lei
- 20% Preț: 287.43 lei
- 20% Preț: 414.27 lei
- 20% Preț: 413.75 lei
- 20% Preț: 639.35 lei
- 20% Preț: 267.73 lei
- 20% Preț: 322.75 lei
- 20% Preț: 297.58 lei
- 20% Preț: 367.40 lei
- 20% Preț: 607.93 lei
- 20% Preț: 297.58 lei
- 20% Preț: 377.31 lei
- 20% Preț: 289.95 lei
- 20% Preț: 418.32 lei
- 20% Preț: 345.69 lei
Preț: 385.81 lei
Puncte Express: 579
Preț estimativ în valută:
73.91€ • 80.25$ • 63.39£
73.91€ • 80.25$ • 63.39£
Carte tipărită la comandă
Livrare economică 06-11 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540401766
ISBN-10: 3540401768
Pagini: 308
Ilustrații: X, 290 p.
Dimensiuni: 155 x 233 x 16 mm
Greutate: 0.96 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540401768
Pagini: 308
Ilustrații: X, 290 p.
Dimensiuni: 155 x 233 x 16 mm
Greutate: 0.96 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.