Výsledky vyhledávání - acm: f.: theory of computation/f.2: analysis of algorithms AND problems complexity/f.2.0: general

  • Zobrazuji výsledky 1 - 10 z 10
Upřesnit hledání
  1. 1

    Sup-interpretations, a semantic method for static analysis of program resources

    Autoři: Marion, Jean-Yves Péchoux, Romain Theoretical adverse computations, and safety (CARTE) a další

    Přispěvatelé: Marion, Jean-Yves Péchoux, Romain Theoretical adverse computations, and safety (CARTE) a další

    Zdroj: ISSN: 1529-3785.

    Témata: Resources control, static analysis of first order languages, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    Relation: inria-00446057; https://hal.inria.fr/inria-00446057; https://hal.inria.fr/inria-00446057/document; https://hal.inria.fr/inria-00446057/file/333pechoux.pdf

    Dostupnost: https://hal.inria.fr/inria-00446057
    https://hal.inria.fr/inria-00446057/document
    https://hal.inria.fr/inria-00446057/file/333pechoux.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  2. 2

    Characterizations of Polynomial Complexity Classes with a Better Intensionality

    Autoři: Marion, Jean-Yves Péchoux, Romain Theoretical adverse computations, and safety (CARTE) a další

    Přispěvatelé: Marion, Jean-Yves Péchoux, Romain Theoretical adverse computations, and safety (CARTE) a další

    Zdroj: Proceedings of the 10th international ACM SIGPLAN conference on Principles and Practice of Declarative Programming - PPDP 2008 ; https://inria.hal.science/inria-00332389 ; Proceedings of the 10th international ACM SIGPLAN conference on Principles and Practice of Declarative Programming - PPDP 2008, Universidad Polytechnica, Jul 2008, Valencia, Spain. pp.79-88, ⟨10.1145/1389449.1389460⟩

    Témata: static analysis, resource upper bounds, quasi-interpretation, sup-interpretation, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    Geografické téma: Valencia, Spain

    Dostupnost: https://inria.hal.science/inria-00332389
    https://inria.hal.science/inria-00332389v1/document
    https://inria.hal.science/inria-00332389v1/file/ppdp09-pechoux.pdf
    https://doi.org/10.1145/1389449.1389460

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  3. 3

    Characterizations of Polynomial Complexity Classes with a Better Intensionality

    Autoři: Marion, Jean-Yves Péchoux, Romain Theoretical adverse computations, and safety (CARTE) a další

    Přispěvatelé: Marion, Jean-Yves Péchoux, Romain Theoretical adverse computations, and safety (CARTE) a další

    Zdroj: Proceedings of the 10th international ACM SIGPLAN conference on Principles and Practice of Declarative Programming - PPDP 2008 ; https://hal.inria.fr/inria-00332389 ; Proceedings of the 10th international ACM SIGPLAN conference on Principles and Practice of Declarative Programming - PPDP 2008, Universidad Polytechnica, Jul 2008, Valencia, Spain. pp.79-88, ⟨10.1145/1389449.1389460⟩

    Témata: static analysis, resource upper bounds, quasi-interpretation, sup-interpretation, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    Geografické téma: Valencia, Spain

    Relation: inria-00332389; https://hal.inria.fr/inria-00332389; https://hal.inria.fr/inria-00332389/document; https://hal.inria.fr/inria-00332389/file/ppdp09-pechoux.pdf

    Dostupnost: https://hal.inria.fr/inria-00332389
    https://hal.inria.fr/inria-00332389/document
    https://hal.inria.fr/inria-00332389/file/ppdp09-pechoux.pdf
    https://doi.org/10.1145/1389449.1389460

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  4. 4

    On the Complexity of Managing Probabilistic XML Data

    Autoři: Senellart, Pierre Abiteboul, Serge Integration of data and knowledge distributed over the web (GEMO) a další

    Přispěvatelé: Senellart, Pierre Abiteboul, Serge Integration of data and knowledge distributed over the web (GEMO) a další

    Zdroj: Principles Of Database Systems ; https://inria.hal.science/inria-00137138 ; Principles Of Database Systems, Jun 2007, Beijing/China

    Témata: XML, probabilistic databases, semi-structured databases, complexity, ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.1: Logical Design, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]

    Dostupnost: https://inria.hal.science/inria-00137138
    https://inria.hal.science/inria-00137138v2/document
    https://inria.hal.science/inria-00137138v2/file/pods102-senellart.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  5. 5

    On the Complexity of Managing Probabilistic XML Data

    Autoři: Senellart, Pierre Abiteboul, Serge Integration of data and knowledge distributed over the web (GEMO) a další

    Přispěvatelé: Senellart, Pierre Abiteboul, Serge Integration of data and knowledge distributed over the web (GEMO) a další

    Zdroj: Principles Of Database Systems ; https://inria.hal.science/inria-00137138 ; Principles Of Database Systems, Jun 2007, Beijing/China

    Témata: XML, probabilistic databases, semi-structured databases, complexity, ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.1: Logical Design, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]

    Dostupnost: https://inria.hal.science/inria-00137138
    https://inria.hal.science/inria-00137138v2/document
    https://inria.hal.science/inria-00137138v2/file/pods102-senellart.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  6. 6

    On the Complexity of Managing Probabilistic XML Data

    Autoři: Senellart, Pierre Abiteboul, Serge Integration of data and knowledge distributed over the web (GEMO) a další

    Přispěvatelé: Senellart, Pierre Abiteboul, Serge Integration of data and knowledge distributed over the web (GEMO) a další

    Zdroj: Principles Of Database Systems ; https://hal.inria.fr/inria-00137138 ; Principles Of Database Systems, Jun 2007, Beijing/China

    Témata: XML, probabilistic databases, semi-structured databases, complexity, ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.1: Logical Design, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]

    Relation: inria-00137138; https://hal.inria.fr/inria-00137138; https://hal.inria.fr/inria-00137138v2/document; https://hal.inria.fr/inria-00137138v2/file/pods102-senellart.pdf

    Dostupnost: https://hal.inria.fr/inria-00137138
    https://hal.inria.fr/inria-00137138v2/document
    https://hal.inria.fr/inria-00137138v2/file/pods102-senellart.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  7. 7

    Upper Bounds on Stream I/O Using Semantic Interpretations

    Autoři: Gaboardi, Marco Péchoux, Romain Dipartimento di Informatica Torino a další

    Přispěvatelé: Gaboardi, Marco Péchoux, Romain Dipartimento di Informatica Torino a další

    Zdroj: Computer Science Logic 2009 (CSL'09) ; 23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL ; https://inria.hal.science/inria-00431469 ; 23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL, Sep 2009, Coimbra, Portugal. pp.271-286, ⟨10.1007/978-3-642-04027-6_21⟩

    Témata: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    Geografické téma: Coimbra, Portugal

    Dostupnost: https://inria.hal.science/inria-00431469
    https://inria.hal.science/inria-00431469v1/document
    https://inria.hal.science/inria-00431469v1/file/csl.pdf
    https://doi.org/10.1007/978-3-642-04027-6_21

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  8. 8

    Upper Bounds on Stream I/O Using Semantic Interpretations

    Autoři: Gaboardi, Marco Péchoux, Romain Dipartimento di Informatica Torino a další

    Přispěvatelé: Gaboardi, Marco Péchoux, Romain Dipartimento di Informatica Torino a další

    Zdroj: Computer Science Logic 2009 (CSL'09) ; 23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL ; https://inria.hal.science/inria-00431469 ; 23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL, Sep 2009, Coimbra, Portugal. pp.271-286, ⟨10.1007/978-3-642-04027-6_21⟩

    Témata: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    Geografické téma: Coimbra, Portugal

    Dostupnost: https://inria.hal.science/inria-00431469
    https://inria.hal.science/inria-00431469v1/document
    https://inria.hal.science/inria-00431469v1/file/csl.pdf
    https://doi.org/10.1007/978-3-642-04027-6_21

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  9. 9

    Upper Bounds on Stream I/O Using Semantic Interpretations

    Autoři: Gaboardi, Marco Péchoux, Romain Dipartimento di Informatica Torino a další

    Přispěvatelé: Gaboardi, Marco Péchoux, Romain Dipartimento di Informatica Torino a další

    Zdroj: Computer Science Logic 2009 (CSL'09) ; 23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL ; https://hal.inria.fr/inria-00431469 ; 23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL, Sep 2009, Coimbra, Portugal. pp.271-286, ⟨10.1007/978-3-642-04027-6_21⟩

    Témata: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    Geografické téma: Coimbra, Portugal

    Relation: inria-00431469; https://hal.inria.fr/inria-00431469; https://hal.inria.fr/inria-00431469/document; https://hal.inria.fr/inria-00431469/file/csl.pdf

    Dostupnost: https://hal.inria.fr/inria-00431469
    https://hal.inria.fr/inria-00431469/document
    https://hal.inria.fr/inria-00431469/file/csl.pdf
    https://doi.org/10.1007/978-3-642-04027-6_21

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených
  10. 10

    Determining Relevance of Accesses at Runtime

    Autoři: Benedikt, Michael Gottlob, Georg Senellart, Pierre a další

    Přispěvatelé: Benedikt, Michael Gottlob, Georg Senellart, Pierre a další

    Zdroj: PODS ; https://inria.hal.science/inria-00591793 ; PODS, Jun 2011, Athènes, Greece

    Témata: ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.3: Languages, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.0: General, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]

    Geografické téma: Athènes, Greece

    Relation: info:eu-repo/grantAgreement/EC/FP7/226513/EU/Foundations of Web Data Management/WEBDAM; inria-00591793; https://inria.hal.science/inria-00591793

    Dostupnost: https://inria.hal.science/inria-00591793

    View record from BASE Nájsť tento článok vo Web of Science
    Přidat do oblíbených

Vyhledávací nástroje: