Suchergebnisse - acm: f.: theory of computation/f.2: analysis of algorithms AND problems complexity/f.2.0: general*
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ISSN: 1529-3785.
Schlagwörter: 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
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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⟩
Schlagwörter: 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]
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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⟩
Schlagwörter: 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]
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
-
4
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Principles Of Database Systems ; https://inria.hal.science/inria-00137138 ; Principles Of Database Systems, Jun 2007, Beijing/China
Schlagwörter: 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]
-
5
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Principles Of Database Systems ; https://inria.hal.science/inria-00137138 ; Principles Of Database Systems, Jun 2007, Beijing/China
Schlagwörter: 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]
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Principles Of Database Systems ; https://hal.inria.fr/inria-00137138 ; Principles Of Database Systems, Jun 2007, Beijing/China
Schlagwörter: 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
-
7
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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⟩
Schlagwörter: 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]
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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⟩
Schlagwörter: 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]
-
9
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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⟩
Schlagwörter: 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]
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
-
10
Autoren: et al.
Weitere Verfasser: et al.
Quelle: PODS ; https://inria.hal.science/inria-00591793 ; PODS, Jun 2011, Athènes, Greece
Schlagwörter: 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]
Relation: info:eu-repo/grantAgreement/EC/FP7/226513/EU/Foundations of Web Data Management/WEBDAM; inria-00591793; https://inria.hal.science/inria-00591793
Verfügbarkeit: https://inria.hal.science/inria-00591793
Nájsť tento článok vo Web of Science