Filter your results
- 103
- 59
- 1
- 76
- 52
- 24
- 7
- 2
- 2
- 1
- 163
- 59
- 15
- 13
- 13
- 10
- 9
- 3
- 1
- 3
- 12
- 3
- 5
- 12
- 11
- 7
- 7
- 6
- 11
- 4
- 12
- 9
- 6
- 12
- 9
- 11
- 6
- 4
- 5
- 2
- 1
- 1
- 2
- 1
- 1
- 157
- 6
- 52
- 31
- 28
- 15
- 13
- 13
- 12
- 10
- 9
- 8
- 7
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 19
- 12
- 12
- 8
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
|
Undecidable Problems About Timed AutomataFORMATS'06, 2006, France. pp.187-199
Conference papers
hal-00121529v2
|
||
|
Complexity of pebble tree-walking automata16th International Symposium on Fundamentals of Computation Theory, Aug 2007, Budapest, Hungary
Conference papers
hal-00158716v1
|
||
|
Longest Common Separable Pattern between PermutationsCombinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327
Conference papers
hal-00128750v1
|
||
|
A $p$-adic Descartes solver: the Strassman solver2022
Preprints, Working Papers, ...
hal-03609363v1
|
||
|
Towards Optimal Depth-Reductions for Algebraic Formulas2023
Preprints, Working Papers, ...
hal-04007228v1
|
||
|
The Isomorphism Relation Between Tree-Automatic StructuresCentral European Journal of Mathematics, 2010, 8 (2), p. 299-313. ⟨10.2478/s11533-010-0014-7⟩
Journal articles
hal-00497724v1
|
||
|
Linear temporal logic for regular cost functionsSymposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.627-636
Conference papers
hal-00573635v1
|
||
|
Sensitivity lower bounds from linear dependencies2020
Preprints, Working Papers, ...
hal-02429358v1
|
||
|
The Ecosystem in Practice: Interest and Problems of an Old Definition for Constructing Ecological ModelsEcosystems, 2011, 14 (7), pp.1039-1054. ⟨10.1007/s10021-011-9466-2⟩
Journal articles
hal-02456429v1
|
||
Le learning game: espace d’entente entre apprentissages formels et informels?Le Français dans le monde. Recherches et applications, 2016, Jeu(x) et langue(s) : avatars du ludique dans l’enseignement/apprentissage des langues, 59
Journal articles
hal-01525467v1
|
|||
Playing with Population ProtocolsThe Complexity of Simple Program, CSP'08, Dec 2008, Cork, Ireland
Conference papers
hal-00760951v1
|
|||
|
Polynomial Factorisation using Drinfeld ModulesNewsletter of the London Mathematical Society, 2019
Journal articles
hal-02368680v1
|
||
|
Reversible Barbed Congruence on Configuration Structures8th Interaction and Concurrency Experience (ICE 2015) Satellite workshop of DisCoTec 2015, Jun 2015, Grenoble, France. pp.68-85, ⟨10.4204/EPTCS.189.7⟩
Conference papers
hal-01157974v2
|
||
|
Highly Undecidable Problems about Recognizability by Tiling SystemsFundamenta Informaticae, 2009, 91 (2), pp.305-323
Journal articles
ensl-00340791v1
|
||
|
Finding a Vector Orthogonal to Roughly Half a Collection of VectorsJournal of Complexity, 2008, 24, pp.39-53. ⟨10.1016/j.jco.2006.09.005⟩
Journal articles
lirmm-00292703v1
|
||
Choice under social influence: effects of learning behaviors on the collective dynamicsRichard Topol; Bernard Walliser. Cognitive Economics: New Trends, 280, Elsevier, pp.178-203, 2007, Contributions to Economic Analysis, 978-0444522429
Book sections
halshs-04005045v1
|
|||
|
Fast Evaluation of Real and Complex Polynomials2022
Preprints, Working Papers, ...
hal-03820369v1
|
||
|
Quadratically Tight Relations for Randomized Query ComplexityTheory of Computing Systems, 2020, 64, pp.101-119. ⟨10.1007/s00224-019-09935-x⟩
Journal articles
hal-02351409v1
|
||
|
On the complexity of trial and error for constraint satisfaction problemsJournal of Computer and System Sciences, 2018, 92, pp.48-64. ⟨10.1016/j.jcss.2017.07.005⟩
Journal articles
hal-02350754v1
|
||
|
Quantum and Classical Algorithms for Approximate Submodular Function MinimizationQuantum Information & Computation, 2019, 19 (15&16), pp.1325-1349
Journal articles
hal-02350737v1
|
||
|
The Complexity of Infinite Computations In Models of Set TheoryLogical Methods in Computer Science, 2009, 5 (4:4), pp.1-19
Journal articles
hal-00422538v3
|
||
Comparing the Performances of Diggle's Tests of Spatial Randomness for Small Samples with and without Edge-Effect Correction: Application to Ecological DataBiometrics, 1999, 55 (1), pp.156-164. ⟨10.1111/j.0006-341X.1999.00156.x⟩
Journal articles
istex
hal-02456557v1
|
|||
Design and test of a generic cohort model of soil organic matter decomposition: the SOMKO modelGlobal Ecology and Biogeography, 2001, 10 (6), pp.639-660. ⟨10.1046/j.1466-822X.2001.t01-1-00250.x⟩
Journal articles
istex
hal-02456465v1
|
|||
|
Some Problems in Automata Theory Which Depend on the Models of Set TheoryRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2011, 45 (4), pp.383 - 397. ⟨10.1051/ita/2011113⟩
Journal articles
hal-00614658v1
|
||
|
Improved bounds for the randomized decision tree complexity of recursive majority[Research Report] xx. 2010
Reports
hal-00580816v1
|
||
|
Tight bounds for rumor spreading in graphs of a given conductanceSymposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.57-68
Conference papers
hal-00573638v1
|
||
|
Polynomial Interpolation and Identity Testing from High Powers Over Finite FieldsAlgorithmica, 2018, 80 (2), pp.560-575. ⟨10.1007/s00453-016-0273-1⟩
Journal articles
hal-02350749v1
|
||
|
Fine costs for Euclid's algorithm on polynomials and Farey mapsAdvances in Applied Mathematics, 2014, 54, pp.27-65. ⟨10.1016/j.aam.2013.11.001⟩
Journal articles
hal-01086629v1
|
||
|
Topological Complexity of Context-Free omega-Languages: A SurveyNachum Dershowitz and Ephraim Nissan. Language, Culture, Computation. Computing - Theory and Technology - Essays Dedicated to Yaacov Choueka on the Occasion of His 75th Birthday, Part I, 8001, Springer, pp.50--77, 2014, Lecture Notes in Computer Science, 978-3-642-45320-5
Book sections
ensl-00286373v2
|
||
|
Topological Complexity of omega-Powers : Extended AbstractDagstuhl Seminar on "Topological and Game-Theoretic Aspects of Infinite Computations" 29.06.08 - 04.07.08, P. Hertling, V. Selivanov, W. Thomas, W. W. Wadge, K. Wagner, Dagstuhl, Germany
Conference papers
ensl-00319447v2
|