American Mathematical Society

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

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

[1] Will Perkins. Birthday inequalities, repulsion, and hard spheres. Proc. Amer. Math. Soc. 144 (2016) 2635-2649.
Abstract, references, and article information   
View Article: PDF

[2] Miklós Abért, Péter Csikvári, Péter E. Frenkel and Gábor Kun. Matchings in Benjamini--Schramm convergent graph sequences. Trans. Amer. Math. Soc. 368 (2016) 4197-4218.
Abstract, references, and article information   
View Article: PDF

[3] Andrew S. Marks. A determinacy approach to Borel combinatorics. J. Amer. Math. Soc. 29 (2016) 579-600.
Abstract, references, and article information   
View Article: PDF

[4] Yi-Huang Shen. When will the Stanley depth increase?. Proc. Amer. Math. Soc. 141 (2013) 2265-2274.
Abstract, references, and article information   
View Article: PDF

[5] Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya and Bora Uçar. UMPa: A multi-objective, multi-level partitioner for communication minimization. Contemporary Mathematics 588 (2013) 53-65.
Book volume table of contents   
View Article: PDF

[6] B. O. Fagginger Auer and R. H. Bisseling. Abusing a hypergraph partitioner for unweighted graph partitioning. Contemporary Mathematics 588 (2013) 19-35.
Book volume table of contents   
View Article: PDF

[7] Ümit V. Çatalyürek, Kamer Kaya, Johannes Langguth and Bora Uçar. A partitioning-based divisive clustering technique for maximizing the modularity. Contemporary Mathematics 588 (2013) 171-186.
Book volume table of contents   
View Article: PDF

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

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

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

[11] Michael Ovelgönne and Andreas Geyer-Schulz. An ensemble learning strategy for graph clustering. Contemporary Mathematics 588 (2013) 187-205.
Book volume table of contents   
View Article: PDF

[12] Anderson N. Martinhão and Emerson L. Monte Carmelo. Short covering codes arising from matchings in weighted graphs. Math. Comp. 82 (2013) 605-616.
Abstract, references, and article information   
View Article: PDF

[13] Jiří Matoušek. Cutting cheaply using eigenvectors. The Student Mathematical Library 53 (2010) 153-161.
Book volume table of contents
View Article: PDF

[14] Jiří Matoušek. Three Petersens are not enough. The Student Mathematical Library 53 (2010) 41-43.
Book volume table of contents
View Article: PDF

[15] Jiří Matoušek. Where is the triangle?. The Student Mathematical Library 53 (2010) 31-34.
Book volume table of contents
View Article: PDF

[16] Jiří Matoušek. Thirty-three Miniatures. The Student Mathematical Library 53 (2010) MR MR2656313.
Book volume table of contents   

[17] Jiří Matoušek. Shannon capacity of the union: A tale of two fields. The Student Mathematical Library 53 (2010) 139-145.
Book volume table of contents   
View Article: PDF

[18] Jiří Matoušek. Tiling a rectangle by squares. The Student Mathematical Library 53 (2010) 39-40.
Book volume table of contents   
View Article: PDF

[19] Jiří Matoušek. Set pairs and exterior products. The Student Mathematical Library 53 (2010) 171-178.
Book volume table of contents   
View Article: PDF

[20] Jiří Matoušek. Are these distances Euclidean?. The Student Mathematical Library 53 (2010) 19-22.
Book volume table of contents   
View Article: PDF

[21] Jiří Matoušek. Checking matrix multiplication. The Student Mathematical Library 53 (2010) 35-37.
Book volume table of contents   
View Article: PDF

[22] Jiří Matoušek. The secret agent and umbrella. The Student Mathematical Library 53 (2010) 131-137.
Book volume table of contents   
View Article: PDF

[23] Jiří Matoušek. The clubs of Oddtown. The Student Mathematical Library 53 (2010) 5-6.
Book volume table of contents   
View Article: PDF

[24] Jiří Matoušek. Fibonacci numbers, quickly. The Student Mathematical Library 53 (2010) 1-2.
Book volume table of contents   
View Article: PDF

[25] Jiří Matoušek. On the difficulty of reducing the diameter. The Student Mathematical Library 53 (2010) 61-65.
Book volume table of contents   
View Article: PDF

[26] Jiří Matoušek. Fibonacci numbers, the formula. The Student Mathematical Library 53 (2010) 3-4.
Book volume table of contents   
View Article: PDF

[27] Jiří Matoušek. More bricks---more walls?. The Student Mathematical Library 53 (2010) 97-105.
Book volume table of contents   
View Article: PDF

[28] Jiří Matoušek. Counting compositions. The Student Mathematical Library 53 (2010) 119-123.
Book volume table of contents   
View Article: PDF

[29] Jiří Matoušek. Counting spanning trees. The Student Mathematical Library 53 (2010) 77-83.
Book volume table of contents   
View Article: PDF

[30] Jiří Matoušek. Only two distances. The Student Mathematical Library 53 (2010) 51-54.
Book volume table of contents   
View Article: PDF


Results: 1 to 30 of 51 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