000  04045nam a22006135i 4500  

001  9783540448495  
003  DEHe213  
005  20170515111550.0  
007  cr nn 008mamaa  
008  121227s2003 gw  s  0eng d  
020 
_a9783540448495 _99783540448495 

024  7 
_a10.1007/3540448497 _2doi 

050  4  _aQA8.910.3  
072  7 
_aPBC _2bicssc 

072  7 
_aPBCD _2bicssc 

072  7 
_aMAT018000 _2bisacsh 

082  0  4 
_a511.3 _223 
245  1  0 
_aAlgorithms and Complexity _h[electronic resource] : _b5th Italian Conference, CIAC 2003, Rome, Italy, May 28–30, 2003. Proceedings / _cedited by Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri. 
264  1 
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003. 

300 
_aX, 290 p. _bonline resource. 

336 
_atext _btxt _2rdacontent 

337 
_acomputer _bc _2rdamedia 

338 
_aonline resource _bcr _2rdacarrier 

347 
_atext file _bPDF _2rda 

490  1 
_aLecture Notes in Computer Science, _x03029743 ; _v2653 

505  0  _aTutorials  Localized Network Representations  Optimal Binary Search Trees with Costs Depending on the Access Paths  On the Generation of Extensions of a Partially Ordered Set  ErrorCorrecting Codes in Complexity Theory  Invited Talks  CacheOblivious 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 APXComplete  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 OnLine Algorithms  OnLine Stream Merging, Max Span, and Min Coverage  Randomised Algorithms for Finding Small WeaklyConnected Dominating Sets of Regular Graphs  Additive Spanners for kChordal Graphs  GraphModeled Data Clustering: FixedParameter 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 NPHard Problems  Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory  Approximation of a Retrieval Problem for Parallel Disks  On kEdgeConnectivity Problems with Sharpened Triangle Inequality  The Complexity of Detecting FixedDensity Clusters  Nearly Bounded Error Probabilistic Sets  Some Properties of MODm Circuits Computing Simple Functions  XORBased 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.  
650  0  _aMathematics.  
650  0  _aData structures (Computer science).  
650  0  _aComputers.  
650  0  _aAlgorithms.  
650  0 
_aComputer science _xMathematics. 

650  0  _aComputer graphics.  
650  0  _aMathematical logic.  
650  1  4  _aMathematics. 
650  2  4  _aMathematical Logic and Foundations. 
650  2  4  _aAlgorithm Analysis and Problem Complexity. 
650  2  4  _aData Structures. 
650  2  4  _aComputation by Abstract Devices. 
650  2  4  _aDiscrete Mathematics in Computer Science. 
650  2  4  _aComputer Graphics. 
700  1 
_aPetreschi, Rossella. _eeditor. 

700  1 
_aPersiano, Giuseppe. _eeditor. 

700  1 
_aSilvestri, Riccardo. _eeditor. 

710  2  _aSpringerLink (Online service)  
773  0  _tSpringer eBooks  
776  0  8 
_iPrinted edition: _z9783540401766 
830  0 
_aLecture Notes in Computer Science, _x03029743 ; _v2653 

856  4  0  _uhttp://dx.doi.org/10.1007/3540448497 
912  _aZDB2SCS  
912  _aZDB2LNC  
912  _aZDB2BAE  
942 
_2ddc _cEB 

950  _aComputer Science (Springer11645)  
999 
_c15828 _d15828 