Informatique Mathématique : une photographie en 2013
暂无分享,去创建一个
Mariette Yvinec | Jean-Daniel Boissonnat | Frédéric Chazal | Guillaume Melquiond | Emeric Gioan | Christophe Paul | Matthieu Martel | Sylvie Boldo | Emmanuel Beffara | Lionel Vaux | Jorge Luis Ramírez Alfonsín | Sylvie Boldo | Lionel Vaux | Guillaume Melquiond | Emeric Gioan | Jorge Luis Ramírez Alfonsín | Emmanuel Beffara | J. Boissonnat | F. Chazal | M. Martel | Christophe Paul | Mariette Yvinec
[1] Nicholas J. Higham,et al. INVERSE PROBLEMS NEWSLETTER , 1991 .
[2] H. Whitney. Geometric Integration Theory , 1957 .
[3] Guillaume Melquiond,et al. Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq , 2011, 2011 IEEE 20th Symposium on Computer Arithmetic.
[4] Sylvie Boldo,et al. Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms , 2006, IJCAR.
[5] Michael R. Fellows,et al. On the complexity of fixed parameter problems , 1989, 30th Annual Symposium on Foundations of Computer Science.
[6] Nicholas J. Higham,et al. Testing linear algebra software , 1996, Quality of Numerical Software.
[7] Marcel Paul Schützenberger,et al. On the Definition of a Family of Automata , 1961, Inf. Control..
[8] Jeffrey D. Ullman,et al. Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.
[9] Ge Xia,et al. Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..
[10] W. T. Tutte,et al. A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.
[11] Jean-Daniel Boissonnat,et al. Stability of Delaunay-type structures for manifolds: [extended abstract] , 2012, SoCG '12.
[12] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .
[13] G. Birkhoff. A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .
[14] Jianer Chen,et al. On Parameterized Intractability: Hardness and Completeness , 2008, Comput. J..
[15] Guillaume Melquiond. Proving Bounds on Real-Valued Functions with Computations , 2008, IJCAR.
[16] B. Mourrain,et al. Meshing of Surfaces , 2006 .
[17] Reinhard Diestel,et al. Graph Theory , 1997 .
[18] Frédéric Chazal,et al. Normal cone approximation and offset shape isotopy , 2009, Comput. Geom..
[19] Guillaume Melquiond,et al. Formally certified floating-point filters for homogeneous geometric predicates , 2007, RAIRO Theor. Informatics Appl..
[20] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..
[21] Thomas Wilke,et al. Automata logics, and infinite games: a guide to current research , 2002 .
[22] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .
[23] B. Sturmfels. Oriented Matroids , 1993 .
[24] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[25] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[26] Namio Honda,et al. A Context-Free Language Which is not Acceptable by a Probabilistic Automaton , 1971, Inf. Control..
[27] F. Chazal,et al. Stability and Finiteness Properties of Medial Axis and Skeleton , 2004 .
[28] Jean-Louis Krivine,et al. A call-by-name lambda-calculus machine , 2007, High. Order Symb. Comput..
[29] C. Villani,et al. Quantitative Concentration Inequalities for Empirical Measures on Non-compact Spaces , 2005, math/0503123.
[30] P. Cousot,et al. A gentle introduction to formal verification of computer systems by abstract interpretation , 2010, Logics and Languages for Reliability and Security.
[31] Tom Brylawski,et al. Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .
[32] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[33] Matthieu Martel. Accurate Evaluation of Arithmetic Expressions (Invited Talk) , 2012, Electron. Notes Theor. Comput. Sci..
[34] Matthieu Martel,et al. Static Analysis of the Numerical Stability of Loops , 2002, SAS.
[35] Guillaume Melquiond,et al. Emulation of a FMA and Correctly Rounded Sums: Proved Algorithms Using Rounding to Odd , 2008, IEEE Transactions on Computers.
[36] Bruno Blanchet. Security protocols: from linear to classical logic by abstract interpretation , 2005, Inf. Process. Lett..
[37] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[38] Timothy G. Griffin,et al. A formulae-as-type notion of control , 1989, POPL '90.
[39] Éva Tardos,et al. Algorithm design , 2005 .
[40] Stephen Smale,et al. Finding the Homology of Submanifolds with High Confidence from Random Samples , 2008, Discret. Comput. Geom..
[41] Matthieu Martel,et al. Différentiation automatique et formes de Taylor en analyse statique de programmes numériques , 2009, Tech. Sci. Informatiques.
[42] Noga Alon,et al. Color-coding , 1995, JACM.
[43] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[44] Laurence Rideau,et al. A Generic Library for Floating-Point Numbers and Its Application to Exact Computing , 2001, TPHOLs.
[45] David Monniaux,et al. The pitfalls of verifying floating-point computations , 2007, TOPL.
[46] Peter S. Landweber,et al. Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..
[47] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .
[48] Noga Alon,et al. Ranking Tournaments , 2006, SIAM J. Discret. Math..
[49] S. S. Cairns,et al. A simple triangulation method for smooth manifolds , 1961 .
[50] Alexandre Chapoutot,et al. Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables , 2010, SAS.
[51] Michael R. Fellows,et al. Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.
[52] Leizhen Cai,et al. Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..
[53] Pat H. Sterbenz,et al. Floating-point computation , 1973 .
[54] R. Baker Kearfott,et al. Introduction to Interval Analysis , 2009 .
[55] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[56] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.
[57] Edward J. Sondik,et al. The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..
[58] Richard P. Brent,et al. Modern Computer Arithmetic , 2010 .
[59] Guillaume Melquiond,et al. Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Wave Equation Numerical Resolution: a Comprehensive Mechanized Proof of a C Program , 2022 .
[60] Michael A. Langston,et al. Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation , 2008, Comput. J..
[61] Jean-Louis Krivine,et al. Dependent choice, 'quote' and the clock , 2003, Theor. Comput. Sci..
[62] Mariette Yvinec,et al. Algorithmic geometry , 1998 .
[63] Steve Oudot,et al. Towards persistence-based reconstruction in euclidean spaces , 2007, SCG '08.
[64] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..
[65] W. T. Tutte. A homotopy theorem for matroids. II , 1958 .
[66] Jianer Chen,et al. On Feedback Vertex Set New Measure and New Structures , 2010, SWAT.
[67] Andrew Drucker,et al. New Limits to Classical and Quantum Instance Compression , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[68] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[69] Ioan I. Macarie. Space-Efficient Deterministic Simulation of Probabilistic Automata , 1998, SIAM J. Comput..
[70] Michael R. Fellows,et al. Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..
[71] F. Morgan. Geometric Measure Theory: A Beginner's Guide , 1988 .
[72] Patrick Cousot,et al. A parametric segmentation functor for fully automatic and scalable array content analysis , 2011, POPL '11.
[73] Thomas Ehrhard,et al. Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms , 2006, CiE.
[74] Jean-Yves Girard,et al. The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..
[75] Jürgen Richter-Gebert,et al. Testing Orientability for Matroids is NP-Complete , 1999 .
[76] Philippe Granger. Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract) , 1997, SAS.
[77] C. Villani. Topics in Optimal Transportation , 2003 .
[78] Xavier Allamigeon,et al. Static analysis by abstract interpretation: application to the detection of heap overflows , 2008, Journal in Computer Virology.
[79] Jean-Daniel Boissonnat,et al. Triangulating Smooth Submanifolds with Light Scaffolding , 2010, Math. Comput. Sci..
[80] Gordon D. Plotkin,et al. Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..
[81] H. Crapo,et al. The Tutte polynomial , 1969, 1707.03459.
[82] Matthieu Martel. Program transformation for numerical precision , 2009, PEPM '09.
[83] Jean-Daniel Boissonnat,et al. Manifold Reconstruction Using Tangential Delaunay Complexes , 2010, Discrete & Computational Geometry.
[84] Michael R. Fellows,et al. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.
[85] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[86] Michel Las Vergnas,et al. Orientability of matroids , 1978, J. Comb. Theory B.
[87] L. Devroye,et al. A weighted k-nearest neighbor density estimate for geometric inference , 2011 .
[88] Jean Souyris. WCET Computation of Safety-Critical Avionics Programs: Challenges, Achievements and Perspectives , 2010, WCET.
[89] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .
[90] Edsger W. Dijkstra,et al. Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.
[91] Leonidas J. Guibas,et al. Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes , 2007, SCG '07.
[92] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .
[93] Jean Souyris,et al. Astrée: From Research to Industry , 2007, SAS.
[94] Patrick Cousot,et al. Interpretation abstraite (in French) , 2000 .
[95] Jean-Yves Girard. Normal functors, power series and λ-calculus , 1988, Ann. Pure Appl. Log..
[96] Eric A. Hansen,et al. An Improved Policy Iteration Algorithm for Partially Observable MDPs , 1997, NIPS.
[97] Paul Seymour,et al. On forbidden minors for (3) , 1988 .
[98] Sylvie Boldo,et al. Preuves formelles en arithmétiques à virgule flottante , 2004 .
[99] Christel Baier,et al. Probabilistic ω-automata , 2012, JACM.
[100] Paavo Turakainen. Some Closure Properties of the Family of Stochastic Languages , 1971, Inf. Control..
[101] N. Vieille,et al. Stochastic Games with Imperfect Monitoring , 2006 .
[102] Jérôme Feret,et al. Static Analysis of Digital Filters , 2004, ESOP.
[103] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[104] André Lieutier,et al. Any open bounded subset of Rn has the same homotopy type as its medial axis , 2004, Comput. Aided Des..
[105] Michael R. Fellows,et al. Nonconstructive tools for proving polynomial-time decidability , 1988, JACM.
[106] Nathalie Bertrand,et al. Qualitative Determinacy and Decidability of Stochastic Games with Signals , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.
[107] Michael R. Fellows,et al. On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..
[108] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[109] Nathalie Bertrand,et al. Active Diagnosis for Probabilistic Systems , 2014, FoSSaCS.
[110] Alexandre Miquel. Forcing as a Program Transformation , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.
[111] W. Browder,et al. Annals of Mathematics , 1889 .
[112] S. Sorin. A First Course on Zero Sum Repeated Games , 2002 .
[113] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[114] Milos D. Ercegovac,et al. Digital Arithmetic , 2003, Wiley Encyclopedia of Computer Science and Engineering.
[115] César A. Muñoz,et al. Provably faithful evaluation of polynomials , 2006, SAC.
[116] F. Clarke. Optimization And Nonsmooth Analysis , 1983 .
[117] Faisal N. Abu-Khzam,et al. A kernelization algorithm for d-Hitting Set , 2010, J. Comput. Syst. Sci..
[118] Christel Baier,et al. Recognizing /spl omega/-regular languages with probabilistic automata , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[119] Paul D. Seymour,et al. Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.
[120] Michel Fliess,et al. Propriétés booléennes des langages stochastiques , 1973, Mathematical systems theory.
[121] David S. Johnson,et al. The NP-completeness column , 2005, TALG.
[122] Stefan Kratsch,et al. Cross-Composition: A New Technique for Kernelization Lower Bounds , 2011, STACS.
[123] Dietmar Berwanger,et al. On the Power of Imperfect Information , 2008, FSTTCS.
[124] Sylvie Boldo,et al. Kahan's Algorithm for a Correct Discriminant Computation at Last Formally Proven , 2009, IEEE Transactions on Computers.
[125] Xiaoye S. Li,et al. Algorithms for quad-double precision floating point arithmetic , 2000, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.
[126] Bert Gerards,et al. The Excluded Minors for GF(4)-Representable Matroids , 1997, J. Comb. Theory, Ser. B.
[127] Judy Goldsmith,et al. Nondeterminism Within P , 1993, SIAM J. Comput..
[128] Richard P. Stanley,et al. A Zonotope Associated with Graphical Degree Sequences , 1990, Applied Geometry And Discrete Mathematics.
[129] Manuel Fähndrich,et al. Static Contract Checking with Abstract Interpretation , 2010, FoVeOOS.
[130] Bruce A. Reed,et al. Finding odd cycle transversals , 2004, Oper. Res. Lett..
[131] Eric Goubault,et al. The Zonotope Abstract Domain Taylor1+ , 2009, CAV.
[132] T. J. Dekker,et al. A floating-point technique for extending the available precision , 1971 .
[133] Krishnendu Chatterjee,et al. Qualitative Analysis of Partially-Observable Markov Decision Processes , 2009, MFCS.
[134] William M. Waite,et al. Software manual for the elementary functions , 1980 .
[135] Douglas M. Priest,et al. Algorithms for arbitrary precision floating point arithmetic , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.
[136] Jérôme Renault,et al. The Value of Repeated Games with an Informed Controller , 2008, Math. Oper. Res..
[137] M. Payne,et al. Radian reduction for trigonometric functions , 1983, SGNM.
[138] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.
[139] H. Crapo. A higher invariant for matroids , 1967 .
[140] Jean-Michel Muller,et al. Elementary Functions: Algorithms and Implementation , 1997 .
[141] Matthieu Martel,et al. Propagation of Roundoff Errors in Finite Precision Computations: A Semantics Approach , 2002, ESOP.
[142] Frédéric Chazal,et al. Stability of Curvature Measures , 2008, Comput. Graph. Forum.
[143] Jean-Michel Muller,et al. Exact and Approximated Error of the FMA , 2011, IEEE Transactions on Computers.
[144] Guillaume Melquiond,et al. Floating-point arithmetic in the Coq system , 2012, Inf. Comput..
[145] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[146] Lance Fortnow,et al. Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..
[147] Stéphan Thomassé,et al. A 4k2 kernel for feedback vertex set , 2010, TALG.
[148] Pierre Castéran,et al. Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.
[149] Serge Haddad,et al. Optimal constructions for active diagnosis , 2013, J. Comput. Syst. Sci..
[150] Jérôme Feret,et al. Dependency Analysis of Mobile Systems , 2002, ESOP.
[151] Guillaume Melquiond,et al. Combining Coq and Gappa for Certifying Floating-Point Programs , 2009, Calculemus/MKM.
[152] Paavo Turakainen,et al. Generalized automata and stochastic languages , 1969 .
[153] Arnaud Tisserand,et al. Toward Correctly Rounded Transcendentals , 1998, IEEE Trans. Computers.
[154] Sylvie Boldo,et al. Floats and Ropes: A Case Study for Formal Numerical Program Verification , 2009, ICALP.
[155] Michael L. Littman,et al. Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes , 1997, UAI.
[156] Krishnendu Chatterjee,et al. Randomness for Free , 2010, MFCS.
[157] Franz Aurenhammer,et al. Minkowski-Type Theorems and Least-Squares Clustering , 1998, Algorithmica.
[158] Stefan Kratsch,et al. Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal , 2011, TALG.
[159] Eric Goubault,et al. Static Analysis of Finite Precision Computations , 2011, VMCAI.
[160] Paul D. Seymour,et al. Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.
[161] Dieter van Melkebeek,et al. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses , 2010, STOC '10.
[162] Jonathan Richard Shewchuk,et al. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..
[163] Zohar Manna,et al. The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.
[164] Jean-Louis Krivine,et al. Lambda-calculus, types and models , 1993, Ellis Horwood series in computers and their applications.
[165] Guillaume Melquiond,et al. Certification of bounds on expressions involving rounded operators , 2007, TOMS.
[166] Sylvie Boldo,et al. Proofs of numerical programs when the compiler optimizes , 2011, Innovations in Systems and Software Engineering.
[167] Anders Yeo,et al. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.
[168] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[169] Christel Baier,et al. On Decision Problems for Probabilistic Büchi Automata , 2008, FoSSaCS.
[170] Florent de Dinechin,et al. Certifying the Floating-Point Implementation of an Elementary Function Using Gappa , 2011, IEEE Transactions on Computers.
[171] Richard P. Stanley. Acyclic orientations of graphs , 1973, Discret. Math..
[172] Anne Condon,et al. On the undecidability of probabilistic planning and related stochastic optimization problems , 2003, Artif. Intell..
[173] Guillaume Melquiond,et al. Formal Proof of a Wave Equation Resolution Scheme: The Method Error , 2010, ITP.
[174] Azaria Paz,et al. Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .
[175] Christophe Paul,et al. Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem , 2011, MFCS.
[176] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[177] Stephen Smale,et al. A Topological View of Unsupervised Learning from Noisy Data , 2011, SIAM J. Comput..
[178] Eric Goubault,et al. Towards an Industrial Use of FLUCTUAT on Safety-Critical Avionics Software , 2009, FMICS.
[179] Frédéric Chazal,et al. Deconvolution for the Wasserstein Metric and Geometric Inference , 2011, GSI.
[180] Matthieu Martel,et al. Semantics of roundoff error propagation in finite precision calculations , 2006, High. Order Symb. Comput..
[181] Earl J. Mickle. On a decompostion theorem of Federer , 1959 .
[182] Reuven Bar-Yehuda,et al. Randomized Algorithms for the Loop Cutset Problem , 2000, J. Artif. Intell. Res..
[183] Leonidas J. Guibas,et al. The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.
[184] A. Petrunin. Semiconcave Functions in Alexandrov???s Geometry , 2013, 1304.0292.
[185] R. Downey,et al. Parameterized Computational Feasibility , 1995 .
[186] John Harrison,et al. Formal Verification of IA-64 Division Algorithms , 2000, TPHOLs.
[187] Matthieu Martel. Semantics-Based Transformation of Arithmetic Expressions , 2007, SAS.
[188] Hugo Gimbert,et al. Probabilistic Automata on Finite Words: Decidable and Undecidable Problems , 2010, ICALP.
[189] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[190] Michael R. Fellows,et al. Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps , 2004, WG.
[191] Sariel Har-Peled. Geometric Approximation Algorithms , 2011 .
[192] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[193] Alan H. Karp,et al. High-precision division and square root , 1997, TOMS.
[194] R. Winder. Partitions of N-Space by Hyperplanes , 1966 .
[195] Frédéric Chazal,et al. Geometric Inference for Probability Measures , 2011, Found. Comput. Math..
[196] Michael R. Fellows,et al. Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..
[197] Leonidas J. Guibas,et al. Data-driven trajectory smoothing , 2011, GIS.
[198] Frédéric Chazal,et al. Boundary Measures for Geometric Inference , 2010, Found. Comput. Math..
[199] Guillaume Brat,et al. Precise and efficient static array bound checking for large embedded C programs , 2004, PLDI '04.
[200] Leonidas J. Guibas,et al. Robust Voronoi-based curvature and feature estimation , 2009, Symposium on Solid and Physical Modeling.
[201] Manuel Fähndrich,et al. Pentagons: a weakly relational abstract domain for the efficient validation of array accesses , 2008, SAC '08.
[202] Michael R. Fellows,et al. On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.
[203] Arnault Ioualalen,et al. A New Abstract Domain for the Representation of Mathematically Equivalent Expressions , 2012, SAS.
[204] Frédéric Chazal,et al. Stability and Computation of Topological Invariants of Solids in ${\Bbb R}^n$ , 2007, Discret. Comput. Geom..
[205] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[206] Yves Bertot,et al. Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .
[207] Michael Werman,et al. A Unified Approach to the Change of Resolution: Space and Gray-Level , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[208] Carsten Thomassen,et al. Highly Connected Sets and the Excluded Grid Theorem , 1999, J. Comb. Theory, Ser. B.
[209] Michael A. Langston,et al. Parallel vertex cover: a case study in dynamic load balancing , 2011 .
[210] Phan Dinh Diêu. On the Languages Representable by Finite Probabilistic Automata , 1971 .
[211] David Goldberg. What Every Computer Scientist Should Know About Floating-Point Arithmetic , 1992 .
[212] Henny B. Sipma,et al. Scalable Analysis of Linear Systems Using Mathematical Programming , 2005, VMCAI.
[213] Sanjoy Dasgupta,et al. An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.
[214] Edward J. Sondik,et al. The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs , 1978, Oper. Res..
[215] Sylvie Boldo,et al. A Simple Test Qualifying the Accuracy of Horner'S Rule for Polynomials , 2004, Numerical Algorithms.