ICMS 2010: Kobe, Japan

Plenary

• Thomas C. Hales:
  Computational Discrete Geometry. 1-3
  
• Masakazu Kojima:
  Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems. 4-9
  
• Kurt Mehlhorn:
  Reliable and Efficient Geometric Computing. 10-11
  
• Burçin Eröcal, William Stein:
  The Sage Project: Unifying Free Mathematical Software to Create a Viable Alternative to Magma, Maple, Mathematica and MATLAB. 12-27
  

Computation of Special Functions (Invited)

• Sylvain Chevillard, Mioara Joldes, Christoph Quirin Lauter:
  Sollya: An Environment for the Development of Numerical Codes. 28-31
  
• Annie A. M. Cuyt, Franky Backeljauw, Stefan Becuwe, Joris Van Deun:
  Validated Special Functions Software. 32-34
  
• Alexandre Benoit, Frédéric Chyzak, Alexis Darrasse, Stefan Gerhold, Marc Mezzarobba, Bruno Salvy:
  The Dynamic Dictionary of Mathematical Functions (DDMF). 35-41
  
• Paul Zimmermann:
  Reliable Computing with GNU MPFR. 42-45
  

Computational Group Theory (Invited)

• Mohamed Barakat, Simon Görtzen:
  Simplicial Cohomology of Smooth Orbifolds in GAP. 46-49
  
• Bettina Eick, Max Horn:
  Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases. 50-53
  
• Sophie Ambrose, Scott H. Murray, Cheryl E. Praeger, Csaba Schneider:
  Constructive Membership Testing in Black-Box Classical Groups. 54-57
  

Computational Group Theory (Contributed)

• Reimer Behrends, Alexander Konovalov, Steve Linton, Frank Lübeck, Max Neunhöffer:
  Towards High-Performance Computational Algebra with GAP. 58-61
  
• Izumi Miyamoto:
  An Improvement of a Function Computing Normalizers for Permutation Groups. 62-68
  
• Dmitrii V. Pasechnik, Keshav Kini:
  A GAP Package for Computation with Coherent Configurations. 69-72
  

Computer Algebra (Invited)

• John Abbott, Anna Maria Bigatti:
  CoCoALib: A C++ Library for Computations in Commutative Algebra... and Beyond. 73-76
  
• Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders:
  LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation. 77-83
  
• Jean-Charles Faugère:
  FGb: A Library for Computing Gröbner Bases. 84-87
  
• William B. Hart:
  Fast Library for Number Theory: An Introduction. 88-91
  

Exact Numeric Computation for Algebraic and Geometric Computation (Invited)

• Dan Halperin:
  Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic. 92-95
  
• Menelaos I. Karavelas:
  Exact Geometric and Algebraic Computations in CGAL. 96-99
  
• Fabrice Rouillier:
  On Solving Systems of Bivariate Polynomials. 100-104
  
• Siegfried M. Rump:
  Accurate and Reliable Computing in Floating-Point Arithmetic. 105-108
  

Exact Numeric Computation for Algebraic and Geometric Computation (Contributed)

• Marc Mörig:
  Deferring Dag Construction by Storing Sums of Floats Speeds-Up Exact Decision Computations Based on Expression Dags. 109-120
  
• Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Hervé Brönnimann:
  The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra. 121-141
  

Formal Proof (Invited)

• Mark Adams:
  Introducing HOL Zero - (Extended Abstract). 142-143
  
• Jesse Alama:
  Euler's Polyhedron Formula in mizar. 144-147
  
• R. D. Arthan:
  Building a Library of Mechanized Mathematical Proofs: Why Do It? and What Is It Like to Do? 148
  
• Thomas C. Hales:
  Linear Programs for the Kepler Conjecture - (Extended Abstract). 149-151
  
• John Harrison:
  A Formal Proof of Pick's Theorem - (Extended Abstract). 152-154
  

Formal Proof (Contributed)

• Josef Urban, Krystof Hoder, Andrei Voronkov:
  Evaluation of Automated Theorem Proving on the Mizar Mathematical Library. 155-166
  

Geometry and Visualization (Invited)

• Tim Hoffmann:
  On Local Deformations of Planar Quad-Meshes. 167-169
  
• Matthias Weber:
  Construction of Harmonic Surfaces with Prescribed Geometry. 170-173
  

Geometry and Visualization (Contributed)

• Martin von Gagern, Christian Mercat:
  A Library of OpenGL-Based Mathematical Image Filters. 174-185
  
• Antonio Mucherino, Leo Liberti, Carlile Lavor:
  MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems. 186-197
  
• Jan Reininghaus, David Günther, Ingrid Hotz, Steffen Prohaska, Hans-Christian Hege:
  TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory. 198-208
  

Groebner Bases and Applications (Invited)

• Winfried Bruns, Bogdan Ichim, Christof Söger:
  Introduction to Normaliz 2.5. 209-212
  
• Thomas Markwig:
  Computer Algebra Methods in Tropical Geometry. 213-216
  

Groebner Bases and Applications (Contributed)

• Rocío Blanco:
  A New Desingularization Algorithm for Binomial Varieties in Arbitrary Characteristic. 217-220
  
• Hiromasa Nakayama, Kenta Nishiyama:
  An Algorithm of Computing Inhomogeneous Differential Equations for Definite Integrals. 221-232
  
• Masayuki Noro:
  New Algorithms for Computing Primary Decomposition of Polynomial Ideals. 233-244
  
• Loredana Tec, Georg Regensburger, Markus Rosenkranz, Bruno Buchberger:
  An Automated Confluence Proof for an Infinite Rewrite System Parametrized over an Integro-Differential Algebra. 245-248
  
• Vladimir Dotsenko, Mikael Vejdemo-Johansson:
  Operadic Gröbner Bases: An Implementation. 249-252
  

Number Theoretical Software (Invited)

• John Cannon, Steve Donnelly, Claus Fieker, Mark Watkins:
  Magma - A Tool for Number Theory. 253-255
  

Number Theoretical Software (Contributed)

• Craig Citro, Alexandru Ghitza:
  Enumerating Galois Representations in Sage. 256-259
  
• Satoru Tanaka, Naoki Ogura, Ken Nakamula, Tetsushi Matsui, Shigenori Uchiyama:
  NZMATH 1.0. 260-269
  

Software for Optimization and Polyhedral Computation (Invited)

• David Adjiashvili, Michel Baes, Philipp Rostalski:
  Removing Redundant Quadratic Constraints. 270-281
  
• Anders Nedergaard Jensen:
  Traversing Symmetric Polyhedral Fans. 282-294
  
• Thomas Rehn, Achill Schürmann:
  C++ Tools for Exploiting Polyhedral Symmetries. 295-298
  
• Sven Verdoolaege:
  isl: An Integer Set Library for the Polyhedral Model. 299-302
  

Software for Optimization and Polyhedral Computation (Contributed)

• Leo Liberti, Sonia Cafieri, David Savourey:
  The Reformulation-Optimization Software Engine. 303-314
  
• Christian Haase, Benjamin Lorenz, Andreas Paffenholz:
  Generating Smooth Lattice Polytopes. 315-328
  

Reliable Computation (Invited)

• Grégoire Lecerf:
  Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations. 329-332
  
• Markus Neher:
  Complex Inclusion Functions in the CoStLy C++ Class Library. 333-336
  
• Nathalie Revol:
  Standardized Interval Arithmetic and Interval Arithmetic Used in Libraries. 337-341
  

Reliable Computation (Contributed)

• Charles E. Leiserson, Liyun Li, Marc Moreno Maza, Yuzhen Xie:
  Efficient Evaluation of Large Polynomials. 342-353
  
• Evgenija D. Popova, Walter Krämer:
  Communicating Functional Expressions from Mathematica to C-XSC. 354-365
  

Last update Fri May 25 08:19:59 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page