Publications
DBLP page Google Scholar
Journals
[J9] Goldsztejn A., Wayne Hayes, Pieter Collins,
Tinkerbell Is Chaotic
SIAM Journal on Applied Dynamical Systems, volume 10(4), pages 1480-1501, 2011.
[J8] Goldsztejn A., Yahia Lebbah, Claude Michel, Rueher M.,
Capabilities of Constraint Programming in Safe Global Optimization
Reliable Computing (electronic edition), volume 15(1), pages 47-59, 2011.
[J7] Goldsztejn A., Jaulin L.,
Inner Approximation of the Range of Vector-Valued Functions
Reliable Computing (electronic edition), volume 14, pages 1-23, 2010.
[J6] Normand J.M., Goldsztejn A., Christie M., Benhamou F.,
A Branch and Bound Algorithm for Numerical MAX-CSP
Constraints (Springer), volume 15(2), pages 213-237, 2010.
(extended version of [C11] presented at CP 2008)
[J5] Goldsztejn A., Granvilliers L.,
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
Constraints (Springer), volume 15(2), pages 190-212, 2010.
(extended version of [C9] presented at CP 2008)
[J4] Goldsztejn A., Michel C., Rueher M.
Efficient Handling of Universally Quantified Inequalities
Constraints (Springer), volume 14(1), pages 117-135, 2009.
(extended version of [C8] presented at SAC 2008)
[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.
Book Chapters
[B1] Grandon C., Goldsztejn A.,
Quantifier Elimination versus Generalized Interval Evaluation: a Comparison on a Specific Class of Quantified Constraint,
In B. Bouchon-Meunier, C. Marsala, M. Rifqi, and R.R. Yager, editors, Uncertainty and Intelligent Information Systems, chapter 36, pages 501-511. World Scientific, 2008.
(extended version of [C2] presented at IPMU 2006)
Conferences
[C21] Goldsztejn A., Jermann C., Ruiz de Angulo V., Torras C.
Symmetry Breaking in Numeric Constraint Problems,
CP 2011: LNCS 6876 pages 317-324.
[C20] Tannous M., Caro S., Goldsztejn A.
Sensitivity Analysis of Parallel Manipulators Using a Fixed Point Interval Iteration Method,
IFToMM 13th World Congress in Mechanism and Machine Science, 2011
[C19] Goldsztejn A., Mullier O., Eveillard D., Hosobe H.
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework,
CP 2010: LNCS 6308 pages 221-235.
[C18] Berger N., Soto R., Goldsztejn A., Caro S., Cardou P.
Finding the Maximal Pose Error in Robotic Mechanical Systems Using Constraint Programming,
IEA-AIE 2010: LNAI 6096, pages 82-91.
[C17] Goldsztejn A., Goualard F.
Box Consistency through Adaptive Shaving,
SAC 2010: Proceedings of the 25th Annual ACM Symposium on Applied Computing, pages 2049-2054.
[C16] Ishii D., Ueda K., Hosobe H., Goldsztejn A.
Interval-based Solving of Hybrid Constraint Systems,
ADHS 2009: Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems, pages 144-149.
[C15] Chenouard R., Goldsztejn A., Jermann C.
Search Strategies for an Anytime Usage of the Branch and Prune Algorithm,
IJCAI 2009: Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence, pages 468-473.
[C14] Goualard F., Goldsztejn A.
A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations,
PDCAT 2008: Proceedings of the Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies (IEEE Computer Society Press), pages 39-46.
[C13] Collins P., Goldsztejn A.
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems,
WRP 2008: ENTCS 223 pages 87-102.
[C12] Rueher M., Goldsztejn A., Lebbah Y., Michel C.
Capabilities of Constraint Programming in Rigorous Global Optimization,
NOLTA 2008.
[C11] Normand J.-M., Goldsztejn A., Christie M., Benhamou F.
A Branch and Bound Algorithm for Numerical MAX-CSP,
CP 2008: LNCS 5202 pages 205-219 (best student paper award).
(Mathematica Player - html preview)
[C10] Goldsztejn A., Lebbah Y., Michel C., Rueher M.
Revisiting the upper bounding process in a safe Branch and Bound algorithm,
CP 2008: LNCS 5202 pages 598-602 (short paper).
[C9] Goldsztejn A., Granvilliers L.
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions,
CP 2008: LNCS 5202 pages 190-204 (best research paper award).
[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.,
Rigorous Inner Approximation of the Range of Functions
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 pages 198-212.
[C3] Goldsztejn A., Chabert G.
A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems,
NMA 2006: LNCS 4310 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] presented at SAC 2006)
[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.,
On the Exponentiation of Interval Matrices
HAL report number hal-00411330.
Goldsztejn A.,
Sensitivity Analysis Using a Fixed Point Interval Iteration
HAL report number hal-00339377.
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.
Goldsztejn A.,
Manifold approximation of set-valued functions
HAL report number hal-00350447.
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.
Also available at Edition Universitaires Européennes.