Skip to Main content Skip to Navigation
  1. Search


...
tel-01750475v1  Theses
Guillaume Bonfante. Constructions d'ordres, analyse de la complexité
Autre [cs.OH]. Institut National Polytechnique de Lorraine, 2000. Français. ⟨NNT : 2000INPL102N⟩
hal-01423520v1  Journal articles
Marie Maccaig. Exploring the complexity of the integer image problem in the max-algebra
Discrete Applied Mathematics, Elsevier, 2017, 217 (2), pp.261--275. ⟨10.1016/j.dam.2016.09.016⟩
hal-00780066v1  Conference papers
Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li. Complexity of Creative Telescoping for Bivariate Rational Functions
ISSAC'10 - International Symposium on Symbolic and Algebraic Computation, Jul 2010, Munich, Germany. pp.203-210
...
hal-03087716v1  Conference papers
Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schlöter, Martin Skutella, Leen Stougie. On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems
IPDPS 2020 - IEEE International Parallel and Distributed Processing Symposium, May 2020, New Orleans / Virtual, United States. pp.1061-1070, ⟨10.1109/IPDPS47924.2020.00112⟩
...
inria-00590077v1  Conference papers
Bart Lamiroy, Patrick Gros. Object Indexing is a Complex Matter
10th Scandinavian Conference on Image Analysis (SCIA '97), Jun 1997, Lappeenranta, Finland. pp.277--283
...
inria-00130920v1  Conference papers
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux. Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs
ICTAC, Sep 2007, Macao, China
...
hal-01191172v2  Conference papers
David Baelde, Simon Lunel, Sylvain Schmitz. A Sequent Calculus for a Modal Logic on Finite Data Trees
CSL 2016, Sep 2016, Marseille, France. pp.1--16, ⟨10.4230/LIPIcs.CSL.2016.32⟩
...
hal-01852119v1  Journal articles
Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2018, 161 (4), pp.317--349. ⟨10.3233/FI-2018-1706⟩
...
hal-01351970v2  Journal articles
Mohamadou Lamine Diouf, Sophie Pinchinat. Complexité de l'algorithme de l'opacité dans les systèmes Workflows centrés sur les documents
Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2016, Volume 25 - 2016 - Special issue CNRIA 2015
...
hal-01312067v1  Preprints, Working Papers, ...
Mohamadou Diouf, Sophie Pinchinat. Complexité de l'algorithme de l'opacité dans les systèmes Workflows centrés sur les documents
2016
inria-00104145v1  Journal articles
François Laroussinie, Philippe Schnoebelen, Mathieu Turuani. On the expressivity and complexity of quantitative branching-time temporal logics.
Theoretical Computer Science, Elsevier, 2003, Theoretical Computer Science, 1-3 (297), pp.297-315. ⟨10.1016/S0304-3975(02)00644-8⟩
hal-01340113v1  Journal articles
Sylvain Schmitz. Implicational Relevance Logic is 2-ExpTime-Complete
The Journal of Symbolic Logic, Association for Symbolic Logic, 2016, 81 (2), pp.641--661. ⟨10.1017/jsl.2015.7⟩
...
hal-01141938v2  Conference papers
Davide Grossi, Emiliano Lorini, François Schwarzentruber. Ceteris Paribus Structure in Logics of Game Forms
Conference on Theoretical Aspects of Rationality and Knowledge - TARK 2013, Jan 2013, Chennai, India. pp. 1-11
...
hal-02021070v1  Reports
Guillaume Aupy, Emmanuel Jeannot, Nicolas Vidal. Scheduling periodic I/O access with bi-colored chains: models and algorithms
[Research Report] RR-9255, Inria. 2019, pp.25
...
hal-00938235v1  Conference papers
Paul Brunet, Damien Pous. Kleene Algebra with Converse
RAMiCS, Apr 2014, Marienstatt im Westerwald, Germany. pp.101-118
...
tel-00012046v1  Theses
Liliana Cucu. Ordonnancement non préemptif et condition d'ordonnançabilité pour systèmes embarqués à contraintes temps réel
Autre [cs.OH]. Université Paris Sud - Paris XI, 2004. Français
...
inria-00166096v3  Reports
Pierre Weiss, Gilles Aubert, Laure Blanc-Féraud. Efficient schemes for total variation minimization under constraints in image processing
[Research Report] RR-6260, INRIA. 2007, pp.36
...
inria-00132396v3  Reports
Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé. WDM and Directed Star Arboricity
[Research Report] RR-6179, INRIA. 2007, pp.20
halshs-01417248v1  Journal articles
Enrico Formenti, Kévin Perrot, Eric Rémila. Computational complexity of the avalanche problem for one dimensional decreasing sandpiles
Journal of Cellular Automata, Old City Publishing, 2018, 13 (3), pp. 215-228
...
pastel-00000711v1  Theses
Cédric Tavernier. Testeurs, problemes de reconstruction univaries et multivaries, et application a la cryptanalyse du DES.
Informatique [cs]. Ecole Polytechnique X, 2004. Français
...
hal-01149392v1  Conference papers
Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot. Incremental complexity of a bi-objective hypergraph transversal problem
Fundamentals of Computation Theory (FCT2015), Aug 2015, Gdansk, Poland. pp.202-213, ⟨10.1007/978-3-319-22177-9_16⟩
...
hal-02025469v2  Reports
Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant. Overlaying a hypergraph with a graph with bounded maximum degree
[Research Report] RR-9258, Inria Sophia Antipolis. 2019
...
hal-01905491v1  Journal articles
Miguel Couceiro, Pierre Mercuriali, Romain Péchoux, Abdallah Saffidine. On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials
Journal of Multiple-Valued Logic and Soft Computing, Old City Publishing, In press, 33 (3), pp.197-218
...
tel-00788467v1  Theses
Cédric Saule. Modèles combinatoires des structures d'ARN avec ou sans pseudonoeuds, application à la comparaison de structures.
Bio-informatique [q-bio.QM]. Université Paris Sud - Paris XI, 2011. Français
...
tel-00012133v1  Theses
Hélène Renard. Equilibrage de charge et redistribution de données sur plates-formes hétérogènes
Autre [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2005. Français
...
inria-00076966v1  Reports
Monique Teillaud. Towards dynamic randomized algorithms in computational geometry
[Research Report] RR-1727, INRIA. 1992
...
inria-00137138v2  Conference papers
Pierre Senellart, Serge Abiteboul. On the Complexity of Managing Probabilistic XML Data
Principles Of Database Systems, Jun 2007, Beijing/China
...
hal-01908684v1  Journal articles
Andreas Fellner, Pascal Fontaine, Bruno Woltzenlogel Paleo. NP-completeness of small conflict set generation for congruence closure
Formal Methods in System Design, Springer Verlag, 2017, 51 (3), pp.533 - 544. ⟨10.1007/s10703-017-0283-x⟩
...
tel-03028074v1  Theses
Momar Sakho. Certain Query Answering on Hyperstreams
Computational Complexity [cs.CC]. Université de Lille; Inria, 2020. English
...
hal-00683424v1  Conference papers
Ioana Barbu, Cédric Herzet, Etienne Mémin. REPRESENTATION ET ALGORITHMES PARCIMONIEUX POUR LA TOMOGRAPHIE PIV
14ème Congrès Français de Visualisation et de Traitement d'Images en Mécanique des Fluides, Nov 2011, Lille, France