Filtrer vos résultats
- 9
- 5
- 9
- 4
- 1
- 14
- 1
- 1
- 3
- 4
- 1
- 2
- 1
- 1
- 1
- 14
- 10
- 6
- 3
- 3
- 1
- 1
- 1
- 14
- 7
- 6
- 5
- 4
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
14 résultats
|
|
|
triés par
|
|
|
On the Decidability of Membership in Matrix-exponential SemigroupsJournal of the ACM (JACM), 2019, 66 (3), pp.1-24. ⟨10.1145/3286487⟩
Article dans une revue
hal-03011135v1
|
||
|
|
On the complexity of solving polynomial initial value problemsInternational Symposium on Symbolic and Algebraic Computation (ISSAC'12), 2012, France
Communication dans un congrès
hal-00760742v1
|
||
|
|
Continuous models of computation: from computability to complexityComputational Complexity [cs.CC]. Ecole Doctorale Polytechnique; Universidad do Algarve, 2015. English. ⟨NNT : ⟩
Thèse
tel-01223284v2
|
||
|
|
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit ProblemTheory of Computing Systems, 2019, 63 (5), pp.1027-1048. ⟨10.1007/s00224-019-09913-3⟩
Article dans une revue
hal-02503357v1
|
||
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit ProblemSymposium on Theoretical Aspects of Computer Science, STACS, 2017, NA, Germany. ⟨10.4230/LIPIcs.STACS.2017.29⟩
Communication dans un congrès
hal-03410679v1
|
|||
|
|
On the decidability of reachability in continuous time linear time-invariant systemsHSCC '21: 24th ACM International Conference on Hybrid Systems: Computation and Control, May 2021, Nashville, Tennessee, United States. pp.1-12, ⟨10.1145/3447928.3456705⟩
Communication dans un congrès
hal-03440249v1
|
||
|
|
Solving Analytic Differential Equations in Polynomial Time over Unbounded DomainsMathematical Foundations of Computer Science, MFCS'11, 2011, Poland. pp.170-181
Communication dans un congrès
hal-00760919v1
|
||
|
|
A Universal Ordinary Differential EquationLogical Methods in Computer Science, 2020, 16 (1), ⟨10.23638/LMCS-16(1:28)2020⟩
Article dans une revue
hal-03011133v1
|
||
|
|
On the complexity of bounded time and precision reachability for piecewise affine systemsTheoretical Computer Science, 2018, 735, pp.132-146. ⟨10.1016/j.tcs.2016.09.021⟩
Article dans une revue
hal-04303982v1
|
||
|
|
On the Monniaux Problem in Abstract InterpretationSAS, 2019, Porto, Portugal
Communication dans un congrès
hal-02395773v1
|
||
|
|
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital ProgramsCMSB 2017 - 15th International Conference on Computational Methods in Systems Biology, Sep 2017, Darmstadt, Germany. pp.108-127
Communication dans un congrès
hal-01519828v3
|
||
|
|
On the decidability of reachability in linear time-invariant systemsthe 22nd International Conference on Hybrid Systems: Computation and Control (HSCC), Apr 2019, Montreal, France. pp.77-86, ⟨10.1145/3302504.3311796⟩
Communication dans un congrès
hal-02114214v1
|
||
|
|
Reachability in Dynamical Systems with Rounding40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), Dec 2020, Goa, India. pp.36:1--36:17, ⟨10.4230/LIPIcs.FSTTCS.2020.52⟩
Communication dans un congrès
hal-03053817v1
|
||
|
|
Algebraic Invariants for Linear Hybrid Automata31st International Conference on Concurrency Theory (CONCUR), Aug 2020, Vienne, Austria
Communication dans un congrès
hal-03011136v1
|