Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008808411/catalog> ?p ?o. }

• catalog contributor b12351643.
• catalog contributor b12351644.
• catalog created "2001.".
• catalog date "2001".
• catalog date "2001.".
• catalog dateCopyrighted "2001.".
• catalog description "A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms / K. Mehlhorn and G. Schafer -- A Separation Bound for Real Algebraic Expressions / C. Burnikel, S. Funke and K. Mehlhorn / [et al.] -- Property Testing with Geometric Queries / A. Czumaj and C. Sohler -- Smallest Color-Spanning Objects / M. Abellanas, F. Hurtado and C. Icking / [et al.] -- Explicit Deterministic Constructions for Membership in the Bitprobe Model / J. Radhakrishnan, V. Raman and S. S. Rao -- Lossy Dictionaries / R. Pagh and F. F. Rodler -- Splitting a Delaunay Triangulation in Linear Time / B. Chazelle, O. Devillers and F. Hurtado / [et al.] -- A Fast Algorithm for Approximating the Detour of a Polygonal Chain / A. Ebbers-Baumann, R. Klein and E. Langetepe / [et al.] -- An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee / S. Eidenbenz and P. Widmayer -- ".
• catalog description "Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode / P. Fraigniaud -- Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks / A. E. F. Clementi, A. Monti and R. Silvestri -- Online and Offline Distance Constrained Labeling of Disk Graphs / J. Fiala, A. V. Fishkin and F. V. Fomin -- Approximate Distance Labeling Schemes / C. Gavoille, M. Katz and N. A. Katz / [et al.] -- On the Parameterized Complexity of Layered Graph Drawing / V. Dujmovic, M. Fellows and M. Hallett / [et al.] -- A General Model of Undirected Web Graphs / C. Cooper and A. M. Frieze -- Packing Cycles and Cuts in Undirected Graphs / A. Caprara, A. Panconesi and R. Rizzi -- Greedy Algorithms for Minimisation Problems in Random Regular Graphs / M. Zito.".
• catalog description "Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints / R. Lepere, D. Trystram and G. J. Woeginger -- On the Approximability of the Minimum Test Collection Problem / B. V. Halldorsson, M. M. Halldorsson and R. Ravi -- Finding Approximate Repetitions under Hamming Distance / R. Kolpakov and G. Kucherov -- SNPs Problems Complexity, and Algorithms / G. Lancia, V. Bafna and S. Istrail / [et al.] -- A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs / E. Angel, E. Bampis and A. Kononov -- Grouping Techniques for Scheduling Problems: Simpler and Faster / A. V. Fishkin, K. Jansen and M. Mastrolilli -- A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times / Y. Karuno and H. Nagamochi -- A Simple Shortest Path Algorithm with Linear Average Time / A. V. Goldberg -- ".
• catalog description "Distributed O([Delta]log n)-Edge-Coloring Algorithm / A. Czygrinow, M. Hanckowiak and M. Karonski -- Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation / J. R. Douceur and R. P. Wattenhofer -- Computing Cycle Covers without Short Cycles / M. Blaser and B. Siebert -- A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth / D. M. Thilikos, M. J. Serna and H. L. Bodlaender -- Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows / N. Sensen -- Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options / K. Akcoglu, M.-Y. Kao and S. V. Raghavan -- Competitive Auctions for Multiple Digital Goods / A. V. Coldberg and J. D. Hartline -- Algorithms for Efficient Filtering in Content-Based Multicast / S. Langerman, S. Lodha and R. Shah -- ".
• catalog description "External Memory Data Structures / L. Arge -- Some Algorithmic Problems in Large Networks / S. Albers -- Exact and Approximate Distances in Graphs -- A Survey / U. Zwick -- Strongly Competitive Algorithms for Caching with Pipelined Prefetching / A. Gaysinsky, A. Itai and H. Shachnai -- Duality between Prefetching and Queued Writing with Parallel Disks / D. A. Hutchinson, P. Sanders and J. S. Vitter -- Online Bin Coloring / S. O. Krumke, W. E. de Paepe and J. Rambau / [et al.] -- A General Decomposition Theorem for the k-Server Problem / S. S. Seiden -- Buying a Constant Competitive Ratio for Paging / J. Csirik, C. Imreh and J. Noga / [et al.] -- Simple Minimal Perfect Hashing in Less Space / M. Dietzfelbinger and T. Hagerup -- Cuckoo Hashing / R. Pagh and F. F. Rodler -- Coupling Variable Fixing Algorithms for the Automatic Recording Problem / M. Sellmann and T. Fahle -- ".
• catalog description "Includes bibliographical references and index.".
• catalog extent "xii, 538 p. :".
• catalog identifier "3540424938 (softcover)".
• catalog isPartOf "Lecture notes in computer science ; 2161".
• catalog issued "2001".
• catalog issued "2001.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "005.1 21".
• catalog subject "Computer algorithms Congresses.".
• catalog subject "QA76.9.A43 E83 2001".
• catalog tableOfContents "A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms / K. Mehlhorn and G. Schafer -- A Separation Bound for Real Algebraic Expressions / C. Burnikel, S. Funke and K. Mehlhorn / [et al.] -- Property Testing with Geometric Queries / A. Czumaj and C. Sohler -- Smallest Color-Spanning Objects / M. Abellanas, F. Hurtado and C. Icking / [et al.] -- Explicit Deterministic Constructions for Membership in the Bitprobe Model / J. Radhakrishnan, V. Raman and S. S. Rao -- Lossy Dictionaries / R. Pagh and F. F. Rodler -- Splitting a Delaunay Triangulation in Linear Time / B. Chazelle, O. Devillers and F. Hurtado / [et al.] -- A Fast Algorithm for Approximating the Detour of a Polygonal Chain / A. Ebbers-Baumann, R. Klein and E. Langetepe / [et al.] -- An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee / S. Eidenbenz and P. Widmayer -- ".
• catalog tableOfContents "Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode / P. Fraigniaud -- Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks / A. E. F. Clementi, A. Monti and R. Silvestri -- Online and Offline Distance Constrained Labeling of Disk Graphs / J. Fiala, A. V. Fishkin and F. V. Fomin -- Approximate Distance Labeling Schemes / C. Gavoille, M. Katz and N. A. Katz / [et al.] -- On the Parameterized Complexity of Layered Graph Drawing / V. Dujmovic, M. Fellows and M. Hallett / [et al.] -- A General Model of Undirected Web Graphs / C. Cooper and A. M. Frieze -- Packing Cycles and Cuts in Undirected Graphs / A. Caprara, A. Panconesi and R. Rizzi -- Greedy Algorithms for Minimisation Problems in Random Regular Graphs / M. Zito.".
• catalog tableOfContents "Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints / R. Lepere, D. Trystram and G. J. Woeginger -- On the Approximability of the Minimum Test Collection Problem / B. V. Halldorsson, M. M. Halldorsson and R. Ravi -- Finding Approximate Repetitions under Hamming Distance / R. Kolpakov and G. Kucherov -- SNPs Problems Complexity, and Algorithms / G. Lancia, V. Bafna and S. Istrail / [et al.] -- A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs / E. Angel, E. Bampis and A. Kononov -- Grouping Techniques for Scheduling Problems: Simpler and Faster / A. V. Fishkin, K. Jansen and M. Mastrolilli -- A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times / Y. Karuno and H. Nagamochi -- A Simple Shortest Path Algorithm with Linear Average Time / A. V. Goldberg -- ".
• catalog tableOfContents "Distributed O([Delta]log n)-Edge-Coloring Algorithm / A. Czygrinow, M. Hanckowiak and M. Karonski -- Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation / J. R. Douceur and R. P. Wattenhofer -- Computing Cycle Covers without Short Cycles / M. Blaser and B. Siebert -- A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth / D. M. Thilikos, M. J. Serna and H. L. Bodlaender -- Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows / N. Sensen -- Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options / K. Akcoglu, M.-Y. Kao and S. V. Raghavan -- Competitive Auctions for Multiple Digital Goods / A. V. Coldberg and J. D. Hartline -- Algorithms for Efficient Filtering in Content-Based Multicast / S. Langerman, S. Lodha and R. Shah -- ".
• catalog tableOfContents "External Memory Data Structures / L. Arge -- Some Algorithmic Problems in Large Networks / S. Albers -- Exact and Approximate Distances in Graphs -- A Survey / U. Zwick -- Strongly Competitive Algorithms for Caching with Pipelined Prefetching / A. Gaysinsky, A. Itai and H. Shachnai -- Duality between Prefetching and Queued Writing with Parallel Disks / D. A. Hutchinson, P. Sanders and J. S. Vitter -- Online Bin Coloring / S. O. Krumke, W. E. de Paepe and J. Rambau / [et al.] -- A General Decomposition Theorem for the k-Server Problem / S. S. Seiden -- Buying a Constant Competitive Ratio for Paging / J. Csirik, C. Imreh and J. Noga / [et al.] -- Simple Minimal Perfect Hashing in Less Space / M. Dietzfelbinger and T. Hagerup -- Cuckoo Hashing / R. Pagh and F. F. Rodler -- Coupling Variable Fixing Algorithms for the Automatic Recording Problem / M. Sellmann and T. Fahle -- ".
• catalog title "Algorithms-ESA 2001 : 9th annual European symposium, Åarhus, Denmark, August 28-31, 2001 : proceedings / Friedhelm Meyer auf der Heide (ed.).".
• catalog type "Conference proceedings. fast".
• catalog type "text".