Publications
DBLP page Google Scholar
Journals
[J5] Goldsztejn A., Jaulin L.,
Inner Approximation of the Range of Vector-Valued Functions
Reliable Computing (Springer), to appear.
[J4] Goldsztejn A., Michel C., Rueher M.
Efficient Handling of Universally Quantified Inequalities
Constraints (Springer), to appear.
(extended version of [C8])
[J3] Chabert G., Goldsztejn A.,
Extension of Hansen-Bliek's Method to Right-Quantified Linear Systems
Reliable Computing (Springer), volume 13(4), pages 325-349, 2007.
[J2] Goldsztejn A.,
Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr Existence Tests,
Computing (Springer), volume 79(1), pages 53-60, 2007.
[J1] Goldsztejn A.,
A Right-Preconditioning Process for the Formal-Algebraic Approach to Inner and Outer Estimation of AE-solution Set,
Reliable Computing (Springer), volume 11(6), pages 443-478, 2005.
Conferences
[C13] Collins P., Goldsztejn A.
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems,
Accepted for publication at WRP 2008.
[C12] Rueher M., Goldsztejn A., Lebbah Y., Michel C.
Capabilities of Constraint Programming in Rigorous Global Optimization,
Accepted for publication at NOLTA 2008.
[C11] Normand J.-M., Goldsztejn A., Christie M., Benhamou F.
A Branch and Bound Algorithm for Numerical MAX-CSP,
Accepted for publication at CP 2008.
html preview (Mathematica notebook for LIP implementation of the facility location problem, requires Mathematica 6 or Mathematica Player)
[C10] Goldsztejn A., Lebbah Y., Michel C., Rueher M.
Revisiting the upper bounding process in a safe Branch and Bound algorithm,
Accepted for publication at CP 2008 (short paper).
[C9] Goldsztejn A., Granvilliers L.
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions,
Accepted for publication at CP 2008.
[C8] Goldsztejn A., Michel C., Rueher M.
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities,
SAC 2008: Proceedings of the 23rd Annual ACM Symposium on Applied Computing
[C7] Goldsztejn A., Hayes W.,
A New Containment Method For Rigorous Shadowing
SCICADE 2007: International Conference on SCIentific Computation And Differential Equations.
[C6] Goldsztejn A., Hayes W.,
Reliable inner approximation of the solution set to initial value problems with uncertain initial value
SCAN 2006: Post-proceedings of 12th GAMM – IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics.
[C5] Goldsztejn A., Chabert G.,
On the approximation of linear AE-solution sets
SCAN 2006: Post-proceedings of 12th GAMM – IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics.
[C4] Goldsztejn A., Jaulin L.,
Inner and Outer Approximations of Existentially Quantified Equality Constraints,
CP 2006: LNCS 4204/2006 pages 198-212.
[C3] Goldsztejn A., Chabert G.
A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems,
NM&A 2006: LNCS 4310/2007 pages 312-319.
[C2] Grandon C., Goldsztejn A.,
Quantifier Elimination versus Generalized Interval Evaluation: a Comparison on a Specific Class of Quantified Constraint,
IPMU 2006: Proceedings of the 11th International
Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems.
(extended version of [P1])
[C1] Goldsztejn A.,
A branch and prune algorithm for the approximation of non-linear AE-solution sets,
SAC 2006: Proceedings of the 21st Annual ACM Symposium on Applied Computing.
Posters
[P1] Grandon C., Goldsztejn A.,
Inner approximation of distance constraints with existential quantification of parameters,
SAC '06: Proceedings pages 1660--1661.
(poster)
(short paper)
Workshops with full paper reviewing process
[W2] Goldsztejn A., Daney D., Rueher M., Taillibert P.,
Modal intervals revisited: a mean-value extension to generalized intervals,
QCP 2005: First International Workshop on Quantification in Constraint Programming (held in conjunction with CP 2005).
[W1] Goldsztejn A.,
Verified Projection of the Solution Set of Parametric Real Systems,
COCOS 2003: 2nd International Workshop on Global Constrained Optimization and Constraint Satisfaction.
Research reports
Goldsztejn A.,
Modal Intervals Revisited Part I: A Generalized Interval Natural Extension
HAL report number hal-00294219.
Goldsztejn A.,
Modal Intervals Revisited Part II: A Generalized Interval Mean-Value Extension
HAL report number hal-00294222.
In reviewing process
Goldsztejn A.,
Modal Intervals Revisited
Submitted to Reliable Computing ( Springer Science+Business Media B.V.).
(part 1)
(part 2)
Thesis
[PhD] Goldsztejn A.,
Définition et Applications des Extensions des Fonctions Réelles aux Intervalles Généralisés: Nouvelle Formulation de la Théorie des Intervalles Modaux et Nouveaux Résultats,
PhD thesis, university of Nice Sophia Antipolis, 2005.