American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(68P05) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 1 to 30 of 33 found      Go to page: 1 2

[1] Sariel Har-Peled. Geometric Approximation Algorithms. Math. Surveys Monogr. 173 (2011) MR 2760023.
Book volume table of contents   

[2] Steve Smale and Ding-Xuan Zhou. Shannon sampling and function reconstruction from point values. Bull. Amer. Math. Soc. 41 (2004) 279-305. MR 2058288.
Abstract, references, and article information   
View Article: PDF

[3] Bernard Moret. Towards a discipline of experimental algorithmics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 197-213.
Book volume table of contents
View Article: PDF

[4] Catherine McGeoch. A bibliography of algorithm experimentation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 251-256.
Book volume table of contents
View Article: PDF

[5] Juan-Carlos Perez-Cortes and Enrique Vidal. Approximate nearest neighbor search using the extended general space-filling curves heuristic. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 125-175.
Book volume table of contents
View Article: PDF

[6] David Johnson. A theoretician's guide to the experimental analysis of algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 215-250.
Book volume table of contents
View Article: PDF

[7] Andrew Goldberg and Craig Silverstein. Computational evaluation of hot queues. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 49-67.
Book volume table of contents
View Article: PDF

[8] R. Battiti. Partially persistent dynamic sets for history-sensitive heuristics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 1-21.
Book volume table of contents
View Article: PDF

[9] Craig Silverstein. A practical perfect hashing algorithm. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 23-47.
Book volume table of contents
View Article: PDF

[10] Michael H. Goldwasser, David S. Johnson and Catherine C. McGeoch (Editors). Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) MR MR1967938.
Book volume table of contents

[11] Norio Katayama and Shin’ichi Satoh. Experimental evaluation of disk-based data structures for nearest neighbor searching. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 87-104.
Book volume table of contents
View Article: PDF

[12] Richard Anderson. The role of experiment in the theory of algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 191-195.
Book volume table of contents
View Article: PDF

[13] Kevin Zatloukal, Mary Johnson and Richard Ladner. Nearest neighbor search for data compression. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 69-86.
Book volume table of contents
View Article: PDF

[14] Songrit Maneewongvatana and David Mount. Analysis of approximate nearest neighbor searching with clustered point sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 105-123.
Book volume table of contents
View Article: PDF

[15] Peter Yianilos. Locally lifting the curse of dimensionality for nearest neighbor search. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 177-190.
Book volume table of contents
View Article: PDF

[16] Sajal Das and M. Pinotti. Efficient schemes for distributing data on parallel memory systems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 233-245.
Book volume table of contents
View Article: PDF

[17] Kiem-Phong Vo. Concrete software libraries. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 181-205.
Book volume table of contents
View Article: PDF

[18] Mahesh Kallahalla and Peter Varman. ASP: Adaptive online parallel disk scheduling. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 223-232.
Book volume table of contents
View Article: PDF

[19] A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer and E. Ramos. I/O-optimal computation of segment intersections. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 131-138.
Book volume table of contents
View Article: PDF

[20] Konstantin Shvachko. S(b)-tree library: An efficient way of indexing data. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 207-222.
Book volume table of contents
View Article: PDF

[21] Ibraheem Al-Furaih, Theodore Johnson and Sanjay Ranka. Calculating robust depth measures for large data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 71-86.
Book volume table of contents
View Article: PDF

[22] Jeffrey Vitter. External memory algorithms and data structures. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 1-38.
Book volume table of contents
View Article: PDF

[23] Phillip Gibbons and Yossi Matias. Synopsis data structures for massive data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 39-70.
Book volume table of contents
View Article: PDF

[24] Scott Leutenegger and Kwan-Liu Ma. R-tree retrieval of unstructured volume data for visualization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 279-291.
Book volume table of contents
View Article: PDF

[25] Yi-Jen Chiang and Cláudio Silva. External memory techniques for isosurface extraction in scientific visualization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 247-277.
Book volume table of contents
View Article: PDF

[26] James M. Abello and Jeffrey Scott Vitter (Editors). External Memory Algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) MR MR1732453.
Book volume table of contents

[27] Monika Henzinger, Prabhakar Raghavan and Sridhar Rajagopalan. Computing on data streams. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 107-118.
Book volume table of contents
View Article: PDF

[28] Sivan Toledo. A survey of out-of-core algorithms in numerical linear algebra. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 161-179.
Book volume table of contents
View Article: PDF

[29] Roberto Grossi and Giuseppe Italiano. Efficient cross-trees for external memory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 87-106.
Book volume table of contents
View Article: PDF

[30] J. Abello, Panos Pardalos and M. Resende. On maximum clique problems in very large graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 119-130.
Book volume table of contents
View Article: PDF


Results: 1 to 30 of 33 found      Go to page: 1 2


Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia