PASCO 2010: Grenoble, France
Marc Moreno Maza, Jean-Louis Roch (Eds.): Proceedings of the 4th International Workshop on Parallel Symbolic Computation, PASCO 2010, July 21-23, 2010, Grenoble, France. ACM 2010 ISBN 978-1-4503-0067-4
Invited talks
- Claude-Pierre Jeannerod, Christophe Mouilleron, Jean-Michel Muller, Guillaume Revy, Christian Bertin, Jingyan Jourdan-Lu, Herve Knochel, Christophe Monat: Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors. 1-9
- Erich Kaltofen: Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010. 10-17
- Stephen Lewin-Berlin: Exploiting multicore systems with Cilk. 18-19
- Jeremy R. Johnson: Automated performance tuning. 20-21
- Daniel Kunkle: Roomy: a system for space limited computations. 22-25
Contributed papers
- Jean-Guillaume Dumas, Thierry Gautier, Jean-Louis Roch: Generic design of Chinese remaindering schemes. 26-34
- Pavel Emeliyanenko: A complete modular resultant algorithm targeted for realization on graphics hardware. 35-43
- Mickaël Gastineau: Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket. 44-52
- Charles E. Leiserson, Marc Moreno Maza, Liyun Li, Yuzhen Xie: Parallel computation of the minimal elements of a poset. 53-62
- Daniel Kunkle, Vlad Slavici, Gene Cooperman: Parallel disk-based computation for large, monolithic binary decision diagrams. 63-72
- Ludovic Jacquin, Vincent Roca, Jean-Louis Roch, Mohamed Al Ali: Parallel arithmetic encryption for high-bandwidth communications on multicore/GPGPU platforms. 73-79
- Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi: Exact sparse matrix-vector multiplication on GPU's and multicore architectures. 80-88
- Jean-Charles Faugère, Sylvain Lachartre: Parallel Gaussian elimination for Gröbner bases computations in finite fields. 89-97
- Andrew Arnold, Michael B. Monagan: A high-performance algorithm for calculating cyclotomic polynomials. 112-120
- Philippe Langlois, Matthieu Martel, Laurent Thévenoux: Accuracy versus time: a case study with summation algorithms. 121-130
- Fatima K. Abu Salem: Cache-oblivious polygon indecomposability testing. 150-159
- Seyed Mohammad Mahdi Javadi, Michael B. Monagan: Parallel sparse polynomial interpolation over finite fields. 160-168
Contributed extended abstracts
- Lingchuan Meng, Yevgen Voronenko, Jeremy R. Johnson, Marc Moreno Maza, Franz Franchetti, Yuzhen Xie: Spiral-generated modular FFT algorithms. 169-170
- Hong Diep Nguyen, Nathalie Revol: High performance linear algebra using interval arithmetic. 171-172
- Kinji Kumura, Hirokazu Anai: Parallel computation of determinants of matrices with polynomial entries for robust control design. 173-174
- Sardar Anisul Haque, Shahadat Hossain, Marc Moreno Maza: Cache friendly sparse matrix-vector multiplication. 175-176
- Reimer Behrends, Alexander Konovalov, Steve Linton, Frank Lübeck, Max Neunhöffer: Parallelising the computational algebra system GAP. 177-178
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team