*** Apologies for multiple postings ***

MACIS 2007 - International Conference on Mathematical Aspects of Computer and Information Sciences Paris, France, December 5-7, 2007

http://www-spiral.lip6.fr/MACIS2007

CALL FOR PARTICIPATION

Mathematical Aspects of Computer and Information Sciences (MACIS) is a new series of conferences where foundational research on theoretical and practical problems of mathematics for computing and information processing may be presented and discussed. MACIS also addresses experimental and case studies, scientific and engineering computation, design and implementation of algorithms and software systems, and applications of mathematical methods and tools to outstanding and emerging problems in applied computer and information sciences. Each conference focuses on two or three themes.

The themes for MACIS 2007 are: - Computational Geometry and Computer Aided Geometric Design - Polynomial System Solving - Algorithms and Complexity

The first MACIS conference took place in Beijing (China), July 24-26, 2006 (see http://www.cc4cm.org/macis2006/ for more details).

Registration information is available at http://www-spiral.lip6.fr/MACIS2007.

INVITED SPEAKERS Mark Van Hoeij (Florida State University, USA) The complexity of factoring univariate polynomials over the rationals Oliver Labs (University of Saarbrucken, GERMANY) Visualization Challenges in Real Algebraic Geometry Chee Yap (New York University, USA) Complete Adaptive Subdivision Algorithms and their Analysis

GENERAL CHAIRS Fabrice Rouillier (INRIA, France) and Zhiming Zheng (Beihang University, China)

LOCAL COMMITTEE CHAIR Mohab Safey El Din (Universite Pierre et Marie Curie, France)

PROGRAM COMMITTEE Saugata Basu, Jean-Charles Faugere, Laureano Gonzalez-Vega (Chair), David Jeffrey, Bert Juttler, Sylvain Lazard, Konrad Polthier, Fabrice Rouillier, Raimund Seidel, Rafael Sendra, Frank Sottile, Gert Vegter, Dongming Wang, Lihong Zhi

ACCEPTED PAPERS Wei Wei, Binghui Guo and Zhiming Zheng. Complexity Analysis of Random Massive Algebraic System

Mridul Aanjaneya and Monique Teillaud. Triangulating the Real Projective Plane

Brian Moore and Bert Juettler. Computing Roots of Polynomials using Bivariate Quadratic Clipping

Michael Bender, Sandor Fekete, Alexander Kroller, Vincenzo Liberatore, Joseph Mitchell, Valentin Polishchuk and Jukka Suomela. The Minimum-Backlog Problem

Chris Jefferson, Peter Jeavons, Martin Green and Marc van Dongen. Representing and Solving Finite-Domain Constraint Problems Using Systems of Polynomials

Shmuel Friedland and Mechie Nkengla. Fast low rank approximations of matrices and tensors

David Daney, Jean Pierre Merlet and Odile Pourtallier. Certified solutions of polynomials with uncertainties

Francois Boulier, Marc Lefranc, Francois Lemaire and Pierre-Emmanuel Morant. Model Reduction of Chemical Reaction Systems using Elimination

Serge Burckel. Certified 2-SAT with Modus Ponens

Songxin Liang, Jurgen Gerhard and David Jeffrey. A New Maple Package for Solving Parametric Polynomial Systems

Bingyu Li, Zhuojun Liu and Lihong Zhi. Structured Condition Numbers of Sylvester Matrices (Extended Abstract)

Isabel Bermejo, Ignacio Garcia-Marco and Juan Jose Salazar-Gonzalez. An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection

Gwenole Ars and Amir Hashemi. Efficient Computation of Syzygies by Faugere's F5 algorithm

Ekaterina Shemyakova and Franz Winkler. On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators

Masaaki Kanno, Silvia Gandy, Hirokazu Anai and Kazuhiro Yokoyama. Optimizing the maximal real root of a polynomial by a special cylindrical algebraic decomposition

ChenGuang LIU, Kazuyuki TANAKA and Takeshi YAMAZAKI. On the algorithmic complexity of partially random reals

Stefan Schuster and Armin Groelinger. On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter

Isabel Bermejo and Philippe Gimenez. Computational aspects of Castelnuovo-Mumford regularity

Sunayana Ghosh and Gert Vegter. Minimizing the symmetric difference distance in conic spline approximation

Claire Herrbach, Alain Denise and Serge Dulucq. Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm

Gema M. Diaz-Toca, Laureano Gonzalez-Vega and Jounaidi Abdeljaoued. Bezout matrices, Subresultants and Parameters

Jurgen Garloff and Andrew Smith. Application of Bernstein Expansion to the Solution of Polynomial Problems

Mark Giesbrecht and Daniel Roche. Interpolation of Shifted-Lacunary Polynomials

Yun Guan and Jan Verschelde. Parallel Implementation of a Subsystem-by-Subsystem Solver

Kathy Piret and Jan Verschelde. Computing Critical Points by Continuation

Mohab Safey El Din. Real solving polynomial systems of inequalities: the case of bounded sets of solutions

Jorge Caravantes and Laureano Gonzalez-Vega. Dealing with the algebraic numbers arising when analyzing arrangements of quartic plane curves

Jean-Charles Faugere and Ye Liang Numerical Computation of Grobner Bases for Zero-dimensional Polynomial Ideals

Andre Galligo. Resultant and Random Multivariate Polynomials