Filter your results
- 66
- 33
- 42
- 25
- 20
- 8
- 2
- 1
- 1
- 8
- 5
- 89
- 5
- 4
- 1
- 1
- 1
- 4
- 5
- 6
- 3
- 6
- 5
- 4
- 7
- 6
- 9
- 7
- 8
- 5
- 5
- 5
- 3
- 1
- 1
- 2
- 88
- 11
- 69
- 53
- 34
- 16
- 10
- 8
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 99
- 14
- 14
- 9
- 8
- 8
- 8
- 7
- 7
- 6
- 6
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
99 Results
|
Implicit Complexity over an Arbitrary Structure: Quantifier Alternations[Intern report] A04-R-300 || bournez04e, 2004, 23 p
Reports
inria-00107811v1
|
||
|
Using local planar geometric invariants to match and model images of line segmentsComputer Vision and Image Understanding, 1998, 69 (2), pp.135-155. ⟨10.1006/cviu.1997.0565⟩
Journal articles
istex
inria-00102944v1
|
||
|
Proving Positive Almost Sure Termination Under Strategies17th International Conference on Rewriting Techniques and Applications - RTA'2006, Aug 2006, Seattle, WA/USA, pp.357--371, ⟨10.1007/11805618⟩
Conference papers
inria-00102945v1
|
||
Population Protocols that Correspond to Symmetric GamesInternational Journal of Unconventional Computing, 2013, 9 (1-2), pp.5--36
Journal articles
hal-01198889v1
|
|||
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms14th International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.30-45
Conference papers
inria-00099621v1
|
|||
|
A Survey on Continuous Time ComputationsNew Computational Paradigms. Changing Conceptions of What is Computable, Springer, pp.383-423, 2008
Book sections
hal-00760976v1
|
||
|
Polynomial differential equations compute all real computable functions on computable compact intervalsJournal of Complexity, 2007, 23 (3), pp.317--335
Journal articles
inria-00102947v2
|
||
|
A dynamic approach for load balancingThe Third International Workshop on Game Theory in Communication Networks - GAMECOMM 2009, Samson Lasaulce and Yezekael Hayel, Oct 2009, Pise, Italy
Conference papers
inria-00435160v1
|
||
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures3rd IFIP International Conference on Theoretical Computer Science - TCS'2004, Aug 2004, Toulouse, France, 14 p
Conference papers
inria-00099896v1
|
|||
An analog Characterization of Elementarily Computable Functions Over the Real Numbers2nd APPSEM II Workshop - APPSEM'2004, 2004, Tallinn, Estonia, 12 p
Conference papers
inria-00099897v1
|
|||
Theoretical Computer Science: Computational ComplexityA Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, 2020
Book sections
hal-02995771v1
|
|||
On the mortality problem for matrices of low dimensions[Intern report] A00-R-089 || bournez00b, 2000
Reports
inria-00099293v1
|
|||
|
Proving Positive Almost-Sure Termination16th International Conference on Rewriting Techniques and Applications - RTA'2005, Apr 2005, Nara/Japan, pp.323-337, ⟨10.1007/b135673⟩
Conference papers
inria-00000522v1
|
||
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation3rd International Conference on Theory and Applications of Models of Computation - TAMC'2006, 2006, Pekin/Chine
Conference papers
inria-00102946v1
|
|||
Projet GasEl. Elaboration d'un logiciel de génération de mécanismes détaillés d'oxydation et de combustion de molécules d'hydrocarbures. Rapport No 2[Contrat] A02-R-559 || ibanescu02a, 2002, 26 p
Reports
inria-00101047v1
|
|||
On matrix mortality in low dimensionsV. Blondel, E. Sontag, M. Vidyasagar, J. Willems. Open Problems in Mathematical Systems Theory and Control, Springer-Verlag, pp.67-70, 1998
Book sections
inria-00108039v1
|
|||
|
Computing with Large Populations Using InteractionsMathematical Foundations of Computer Science 2012, MFCS'2012, Aug 2012, Slovakia. pp.234-246
Conference papers
hal-00760669v1
|
||
|
Towards an Axiomatization of Simple Analog AlgorithmsTheory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings, Date-Added = 2012-05-04 20:32:53 +0000, Date-Modified = 2012-05-04 20:35:01 +0000, 2012, China. pp.525-536
Conference papers
hal-00760736v1
|
||
|
Using geometric quasi-invariants to match and model images of line segments[Research Report] RR-2608, INRIA. 1995
Reports
inria-00074077v1
|
||
Safe Recursion and Calculus over an Arbitrary StructureImplicit Computational Complexity - ICC'2002, Jul 2002, Copenhagen, Denmark, 12 p
Conference papers
inria-00100884v1
|
|||
Recursive Analysis Characterized as a Class of Real Recursive FunctionsFundamenta Informaticae, 2006, 74 (4), pp.409-433
Journal articles
inria-00000515v1
|
|||
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial TimeFoundations of Software Science and Computation Structures - FOSSACS'03, Apr 2003, Warsaw, Poland, pp.185-199
Conference papers
inria-00099618v1
|
|||
Rewriting Logic and Probabilities14th International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.61-75
Conference papers
inria-00099620v1
|
|||
Automated Generation of Kinetic Chemical Mechanisms Using RewritingInternational Conference on Computational Science - ICCS 2003, Jun 2003, Melbourne, Australie, pp.367-376
Conference papers
inria-00099622v1
|
|||
|
Solving Analytic Differential Equations in Polynomial Time over Unbounded DomainsMathematical Foundations of Computer Science, MFCS'11, 2011, Poland. pp.170-181
Conference papers
hal-00760919v1
|
||
|
A Universal Ordinary Differential EquationLogical Methods in Computer Science, 2020, 16 (1), ⟨10.23638/LMCS-16(1:28)2020⟩
Journal articles
hal-03011133v1
|
||
|
Computability, Complexity and Programming with Ordinary Differential Equations37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020, Montpellier, France. ⟨10.4230/LIPIcs.STACS.2020.3⟩
Conference papers
hal-03668004v1
|
||
On the Convergence of a Population Protocol When Population Goes to InfinityPhysics and Computations, Worshop of Unconventional Computation - UC 2008, Aug 2008, Vienne, Austria
Conference papers
inria-00308018v1
|
|||
Implicit Complexity over an Arbitrary Structure: Quantifier AlternationsInformation and Computation, 2006, 204 (2), pp.210--230
Journal articles
inria-00000516v1
|
|||
|
Elementarily Computable Functions Over the Real Numbers and R-Sub-Recursive FunctionsTheoretical Computer Science, 2005, 348 (2-3), pp.130--147. ⟨10.1016/j.tcs.2005.09.010⟩
Journal articles
inria-00000518v1
|