American Mathematical Society

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

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

[1] Jonathan Sorenson and Jonathan Webster. Strong pseudoprimes to twelve prime bases. Math. Comp. 86 (2017) 985-1003.
Abstract, references, and article information   
View Article: PDF

[2] Yu-Hong Dai, Deren Han, Xiaoming Yuan and Wenxing Zhang. A sequential updating scheme of the Lagrange multiplier for separable convex programming. Math. Comp. 86 (2017) 315-343.
Abstract, references, and article information   
View Article: PDF

[3] Jean Fromentin and Florent Hivert. Exploring the tree of numerical semigroups. Math. Comp. 85 (2016) 2553-2568.
Abstract, references, and article information   
View Article: PDF

[4] Shuhong Gao, Frank Volny IV and Mingsheng Wang. A new framework for computing Gr\"obner bases. Math. Comp. 85 (2016) 449-465.
Abstract, references, and article information   
View Article: PDF

[5] Janko Böhm, Wolfram Decker, Claus Fieker and Gerhard Pfister. The use of bad primes in rational reconstruction. Math. Comp. 84 (2015) 3013-3027.
Abstract, references, and article information   
View Article: PDF

[6] Blake Schultze, Micah Witt, Yair Censor, Reinhard Schulte and Keith Evan Schubert. Performance of Hull-Detection Algorithms for Proton Computed Tomography Reconstruction. Contemporary Mathematics 636 (2015) 211-224.
Book volume table of contents
View Article: PDF

[7] Bernd Bank, Marc Giusti and Joos Heintz. Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity. Math. Comp. 83 (2014) 873-897.
Abstract, references, and article information   
View Article: PDF

[8] Bernd Bank, Marc Giusti and Joos Heintz. Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity. Contemporary Mathematics 604 (2013) 55-70.
Book volume table of contents   
View Article: PDF

[9] Henning Meyerhenke. Shape optimizing load balancing for MPI-parallel adaptive numerical simulations. Contemporary Mathematics 588 (2013) 67-81.
Book volume table of contents
View Article: PDF

[10] Aydın Buluç and Kamesh Madduri. Graph partitioning for scalable distributed graph computations. Contemporary Mathematics 588 (2013) 83-101.
Book volume table of contents   
View Article: PDF

[11] Sivasankaran Rajamanickam and Erik G. Boman. Parallel partitioning with Zoltan: Is hypergraph partitioning worth it?. Contemporary Mathematics 588 (2013) 37-52.
Book volume table of contents   
View Article: PDF

[12] Peter Sanders and Christian Schulz. High quality graph partitioning. Contemporary Mathematics 588 (2013) 1-17.
Book volume table of contents   
View Article: PDF

[13] B. O. Fagginger Auer and R. H. Bisseling. Graph coarsening and clustering on the GPU. Contemporary Mathematics 588 (2013) 223-240.
Book volume table of contents   
View Article: PDF

[14] E. Jason Riedy, Henning Meyerhenke, David Ediger and David A. Bader. Parallel community detection for massive graphs. Contemporary Mathematics 588 (2013) 207-221.
Book volume table of contents   
View Article: PDF

[15] 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

[16] 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

[17] 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

[18] 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

[19] 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

[20] 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

[21] 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

[22] 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

[23] 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

[24] 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

[25] 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

[26] 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

[27] 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

[28] 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

[29] 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

[30] Lars Arge and Peter Miltersen. On showing lower bounds for external-memory computational geometry problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 139-159.
Book volume table of contents
View Article: PDF


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


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