A Characterization of NCk by First Order Functional Programs View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2008

AUTHORS

Jean-Yves Marion , Romain Péchoux

ABSTRACT

This paper is part of a research on static analysis in order to predict program resources and belongs to the implicit computational complexity line of research. It presents intrinsic characterizations of the classes of functions, which are computable in , that is by a uniform, poly-logarithmic depth and polynomial size family of circuits, using first order functional programs. Our characterizations are new in terms of first order functional programming language and extend the characterization of in [9]. These characterizations are obtained using a complexity measure, the sup-interpretation, which gives upper bounds on the size of computed values and captures a lot of program schemas. More... »

PAGES

136-147

References to SciGraph publications

  • 1992-06. A new recursion-theoretic characterization of the polytime functions in COMPUTATIONAL COMPLEXITY
  • 1994-06. Function-algebraic characterizations of log and polylog parallel time in COMPUTATIONAL COMPLEXITY
  • 2006. A Characterization of Alternating Log Time by First Order Functional Programs in LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING
  • 2006. Resource Analysis by Sup-interpretation in FUNCTIONAL AND LOGIC PROGRAMMING
  • 2007. A Soft Type Assignment System for λ-Calculus in COMPUTER SCIENCE LOGIC
  • 2005. The Flow of Data and the Complexity of Algorithms in NEW COMPUTATIONAL PARADIGMS
  • 2001. On Lexicographic Termination Ordering with Space Bound Certifications in PERSPECTIVES OF SYSTEM INFORMATICS
  • 2006. Towards an Implicit Characterization of NCk in COMPUTER SCIENCE LOGIC
  • 1995. Computation models and function algebras in LOGIC AND COMPUTATIONAL COMPLEXITY
  • 2004. Soft lambda-Calculus: A Language for Polynomial Time Computation in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES
  • 1990. Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, ACk, NCkand NC in FEASIBLE MATHEMATICS
  • Book

    TITLE

    Theory and Applications of Models of Computation

    ISBN

    978-3-540-79227-7
    978-3-540-79228-4

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-540-79228-4_12

    DOI

    http://dx.doi.org/10.1007/978-3-540-79228-4_12

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1026553376


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "\u00c9cole Nationale Sup\u00e9rieure des Mines de Nancy", 
              "id": "https://www.grid.ac/institutes/grid.473477.4", 
              "name": [
                "Loria-INPL, \u00c9cole Nationale Sup\u00e9rieure des Mines de Nancy, B.P. 239, 54506, Vand\u0153uvre-l\u00e8s-Nancy Cedex, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Marion", 
            "givenName": "Jean-Yves", 
            "id": "sg:person.016702671367.99", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016702671367.99"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "\u00c9cole Nationale Sup\u00e9rieure des Mines de Nancy", 
              "id": "https://www.grid.ac/institutes/grid.473477.4", 
              "name": [
                "Loria-INPL, \u00c9cole Nationale Sup\u00e9rieure des Mines de Nancy, B.P. 239, 54506, Vand\u0153uvre-l\u00e8s-Nancy Cedex, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "P\u00e9choux", 
            "givenName": "Romain", 
            "id": "sg:person.016241557431.75", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016241557431.75"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1145/346048.346051", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005765514"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11874683_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006062970", 
              "https://doi.org/10.1007/11874683_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11874683_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006062970", 
              "https://doi.org/10.1007/11874683_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0022-0000(90)90022-d", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007070716"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01201998", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007256989", 
              "https://doi.org/10.1007/bf01201998"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01201998", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007256989", 
              "https://doi.org/10.1007/bf01201998"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0304-3975(92)90386-t", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007694429"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2003.10.018", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008459023"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0304-3975(99)00209-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009612334"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/322217.322230", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010875099"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11916277_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012388623", 
              "https://doi.org/10.1007/11916277_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11916277_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012388623", 
              "https://doi.org/10.1007/11916277_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01202288", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1015506435", 
              "https://doi.org/10.1007/bf01202288"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01202288", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1015506435", 
              "https://doi.org/10.1007/bf01202288"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0890-5401(90)90063-n", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017490867"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11737414_12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018767695", 
              "https://doi.org/10.1007/11737414_12"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11737414_12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018767695", 
              "https://doi.org/10.1007/11737414_12"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24727-2_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020241211", 
              "https://doi.org/10.1007/978-3-540-24727-2_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24727-2_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020241211", 
              "https://doi.org/10.1007/978-3-540-24727-2_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1006/inco.1998.2700", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029192341"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-60178-3_81", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029652351", 
              "https://doi.org/10.1007/3-540-60178-3_81"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4612-3466-1_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031303856", 
              "https://doi.org/10.1007/978-1-4612-3466-1_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4612-3466-1_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031303856", 
              "https://doi.org/10.1007/978-1-4612-3466-1_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-74915-8_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032657209", 
              "https://doi.org/10.1007/978-3-540-74915-8_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-74915-8_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032657209", 
              "https://doi.org/10.1007/978-3-540-74915-8_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/28395.28409", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1037335279"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11494645_33", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038435051", 
              "https://doi.org/10.1007/11494645_33"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11494645_33", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038435051", 
              "https://doi.org/10.1007/11494645_33"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45575-2_46", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041545494", 
              "https://doi.org/10.1007/3-540-45575-2_46"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0022-0000(81)90038-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053111440"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/s0097539704445597", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062879554"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1998.743522", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095275026"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2008", 
        "datePublishedReg": "2008-01-01", 
        "description": "This paper is part of a research on static analysis in order to predict program resources and belongs to the implicit computational complexity line of research. It presents intrinsic characterizations of the classes of functions, which are computable in , that is by a uniform, poly-logarithmic depth and polynomial size family of circuits, using first order functional programs. Our characterizations are new in terms of first order functional programming language and extend the characterization of in [9]. These characterizations are obtained using a complexity measure, the sup-interpretation, which gives upper bounds on the size of computed values and captures a lot of program schemas.", 
        "editor": [
          {
            "familyName": "Agrawal", 
            "givenName": "Manindra", 
            "type": "Person"
          }, 
          {
            "familyName": "Du", 
            "givenName": "Dingzhu", 
            "type": "Person"
          }, 
          {
            "familyName": "Duan", 
            "givenName": "Zhenhua", 
            "type": "Person"
          }, 
          {
            "familyName": "Li", 
            "givenName": "Angsheng", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-540-79228-4_12", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-540-79227-7", 
            "978-3-540-79228-4"
          ], 
          "name": "Theory and Applications of Models of Computation", 
          "type": "Book"
        }, 
        "name": "A Characterization of NCk by First Order Functional Programs", 
        "pagination": "136-147", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-540-79228-4_12"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "7e8029492fb06726a90baa1387b74b1837c91198bd65f05151c6701ef63820d4"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1026553376"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-540-79228-4_12", 
          "https://app.dimensions.ai/details/publication/pub.1026553376"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T06:04", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000349_0000000349/records_113673_00000001.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F978-3-540-79228-4_12"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-79228-4_12'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-79228-4_12'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-79228-4_12'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-79228-4_12'


     

    This table displays all metadata directly associated to this object as RDF triples.

    167 TRIPLES      23 PREDICATES      50 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-540-79228-4_12 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N93837e6049d04669bb8c718a6074a1bf
    4 schema:citation sg:pub.10.1007/11494645_33
    5 sg:pub.10.1007/11737414_12
    6 sg:pub.10.1007/11874683_14
    7 sg:pub.10.1007/11916277_7
    8 sg:pub.10.1007/3-540-45575-2_46
    9 sg:pub.10.1007/3-540-60178-3_81
    10 sg:pub.10.1007/978-1-4612-3466-1_4
    11 sg:pub.10.1007/978-3-540-24727-2_4
    12 sg:pub.10.1007/978-3-540-74915-8_21
    13 sg:pub.10.1007/bf01201998
    14 sg:pub.10.1007/bf01202288
    15 https://doi.org/10.1006/inco.1998.2700
    16 https://doi.org/10.1016/0022-0000(81)90038-6
    17 https://doi.org/10.1016/0022-0000(90)90022-d
    18 https://doi.org/10.1016/0304-3975(92)90386-t
    19 https://doi.org/10.1016/0890-5401(90)90063-n
    20 https://doi.org/10.1016/j.tcs.2003.10.018
    21 https://doi.org/10.1016/s0304-3975(99)00209-1
    22 https://doi.org/10.1109/sfcs.1998.743522
    23 https://doi.org/10.1137/s0097539704445597
    24 https://doi.org/10.1145/28395.28409
    25 https://doi.org/10.1145/322217.322230
    26 https://doi.org/10.1145/346048.346051
    27 schema:datePublished 2008
    28 schema:datePublishedReg 2008-01-01
    29 schema:description This paper is part of a research on static analysis in order to predict program resources and belongs to the implicit computational complexity line of research. It presents intrinsic characterizations of the classes of functions, which are computable in , that is by a uniform, poly-logarithmic depth and polynomial size family of circuits, using first order functional programs. Our characterizations are new in terms of first order functional programming language and extend the characterization of in [9]. These characterizations are obtained using a complexity measure, the sup-interpretation, which gives upper bounds on the size of computed values and captures a lot of program schemas.
    30 schema:editor N4e30a0d895a9433fbbe62721d28175df
    31 schema:genre chapter
    32 schema:inLanguage en
    33 schema:isAccessibleForFree true
    34 schema:isPartOf N2e7c4da52ac845279fcda49d68606acc
    35 schema:name A Characterization of NCk by First Order Functional Programs
    36 schema:pagination 136-147
    37 schema:productId N6fff94b8c7474eb8b912e48f833264a3
    38 Nb45d7c05283e4f8e914772cb88c5e69e
    39 Nd292f6408c234e8b997ddb1b7470a8fe
    40 schema:publisher N10d6198be12d404185ce6e3a23552d1a
    41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026553376
    42 https://doi.org/10.1007/978-3-540-79228-4_12
    43 schema:sdDatePublished 2019-04-16T06:04
    44 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    45 schema:sdPublisher N1cd3dde2b89c487992bc9da93c80e364
    46 schema:url https://link.springer.com/10.1007%2F978-3-540-79228-4_12
    47 sgo:license sg:explorer/license/
    48 sgo:sdDataset chapters
    49 rdf:type schema:Chapter
    50 N0328c6347d824523a33658eb3d37bb4b rdf:first Nbe2f6063d70a4285a599ef3563bb07cf
    51 rdf:rest rdf:nil
    52 N10d6198be12d404185ce6e3a23552d1a schema:location Berlin, Heidelberg
    53 schema:name Springer Berlin Heidelberg
    54 rdf:type schema:Organisation
    55 N119469bcf2e9437c89269de6d6204694 rdf:first sg:person.016241557431.75
    56 rdf:rest rdf:nil
    57 N16208be4bbbf4a959fea1bc80a4e580c rdf:first Ncd001352063a46c9b8a402f77f3f15dd
    58 rdf:rest N0328c6347d824523a33658eb3d37bb4b
    59 N1cd3dde2b89c487992bc9da93c80e364 schema:name Springer Nature - SN SciGraph project
    60 rdf:type schema:Organization
    61 N2364c1e6c3aa422ebf8fa0a4ad8135bb rdf:first N6a48837cfef74c26b1290cc92b0d7e96
    62 rdf:rest N16208be4bbbf4a959fea1bc80a4e580c
    63 N2e7c4da52ac845279fcda49d68606acc schema:isbn 978-3-540-79227-7
    64 978-3-540-79228-4
    65 schema:name Theory and Applications of Models of Computation
    66 rdf:type schema:Book
    67 N49e89afc293c497c9baf52f2013982f2 schema:familyName Agrawal
    68 schema:givenName Manindra
    69 rdf:type schema:Person
    70 N4e30a0d895a9433fbbe62721d28175df rdf:first N49e89afc293c497c9baf52f2013982f2
    71 rdf:rest N2364c1e6c3aa422ebf8fa0a4ad8135bb
    72 N6a48837cfef74c26b1290cc92b0d7e96 schema:familyName Du
    73 schema:givenName Dingzhu
    74 rdf:type schema:Person
    75 N6fff94b8c7474eb8b912e48f833264a3 schema:name dimensions_id
    76 schema:value pub.1026553376
    77 rdf:type schema:PropertyValue
    78 N93837e6049d04669bb8c718a6074a1bf rdf:first sg:person.016702671367.99
    79 rdf:rest N119469bcf2e9437c89269de6d6204694
    80 Nb45d7c05283e4f8e914772cb88c5e69e schema:name doi
    81 schema:value 10.1007/978-3-540-79228-4_12
    82 rdf:type schema:PropertyValue
    83 Nbe2f6063d70a4285a599ef3563bb07cf schema:familyName Li
    84 schema:givenName Angsheng
    85 rdf:type schema:Person
    86 Ncd001352063a46c9b8a402f77f3f15dd schema:familyName Duan
    87 schema:givenName Zhenhua
    88 rdf:type schema:Person
    89 Nd292f6408c234e8b997ddb1b7470a8fe schema:name readcube_id
    90 schema:value 7e8029492fb06726a90baa1387b74b1837c91198bd65f05151c6701ef63820d4
    91 rdf:type schema:PropertyValue
    92 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    93 schema:name Information and Computing Sciences
    94 rdf:type schema:DefinedTerm
    95 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    96 schema:name Computation Theory and Mathematics
    97 rdf:type schema:DefinedTerm
    98 sg:person.016241557431.75 schema:affiliation https://www.grid.ac/institutes/grid.473477.4
    99 schema:familyName Péchoux
    100 schema:givenName Romain
    101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016241557431.75
    102 rdf:type schema:Person
    103 sg:person.016702671367.99 schema:affiliation https://www.grid.ac/institutes/grid.473477.4
    104 schema:familyName Marion
    105 schema:givenName Jean-Yves
    106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016702671367.99
    107 rdf:type schema:Person
    108 sg:pub.10.1007/11494645_33 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038435051
    109 https://doi.org/10.1007/11494645_33
    110 rdf:type schema:CreativeWork
    111 sg:pub.10.1007/11737414_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018767695
    112 https://doi.org/10.1007/11737414_12
    113 rdf:type schema:CreativeWork
    114 sg:pub.10.1007/11874683_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006062970
    115 https://doi.org/10.1007/11874683_14
    116 rdf:type schema:CreativeWork
    117 sg:pub.10.1007/11916277_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012388623
    118 https://doi.org/10.1007/11916277_7
    119 rdf:type schema:CreativeWork
    120 sg:pub.10.1007/3-540-45575-2_46 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041545494
    121 https://doi.org/10.1007/3-540-45575-2_46
    122 rdf:type schema:CreativeWork
    123 sg:pub.10.1007/3-540-60178-3_81 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029652351
    124 https://doi.org/10.1007/3-540-60178-3_81
    125 rdf:type schema:CreativeWork
    126 sg:pub.10.1007/978-1-4612-3466-1_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031303856
    127 https://doi.org/10.1007/978-1-4612-3466-1_4
    128 rdf:type schema:CreativeWork
    129 sg:pub.10.1007/978-3-540-24727-2_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020241211
    130 https://doi.org/10.1007/978-3-540-24727-2_4
    131 rdf:type schema:CreativeWork
    132 sg:pub.10.1007/978-3-540-74915-8_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032657209
    133 https://doi.org/10.1007/978-3-540-74915-8_21
    134 rdf:type schema:CreativeWork
    135 sg:pub.10.1007/bf01201998 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007256989
    136 https://doi.org/10.1007/bf01201998
    137 rdf:type schema:CreativeWork
    138 sg:pub.10.1007/bf01202288 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015506435
    139 https://doi.org/10.1007/bf01202288
    140 rdf:type schema:CreativeWork
    141 https://doi.org/10.1006/inco.1998.2700 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029192341
    142 rdf:type schema:CreativeWork
    143 https://doi.org/10.1016/0022-0000(81)90038-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053111440
    144 rdf:type schema:CreativeWork
    145 https://doi.org/10.1016/0022-0000(90)90022-d schema:sameAs https://app.dimensions.ai/details/publication/pub.1007070716
    146 rdf:type schema:CreativeWork
    147 https://doi.org/10.1016/0304-3975(92)90386-t schema:sameAs https://app.dimensions.ai/details/publication/pub.1007694429
    148 rdf:type schema:CreativeWork
    149 https://doi.org/10.1016/0890-5401(90)90063-n schema:sameAs https://app.dimensions.ai/details/publication/pub.1017490867
    150 rdf:type schema:CreativeWork
    151 https://doi.org/10.1016/j.tcs.2003.10.018 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008459023
    152 rdf:type schema:CreativeWork
    153 https://doi.org/10.1016/s0304-3975(99)00209-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009612334
    154 rdf:type schema:CreativeWork
    155 https://doi.org/10.1109/sfcs.1998.743522 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095275026
    156 rdf:type schema:CreativeWork
    157 https://doi.org/10.1137/s0097539704445597 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062879554
    158 rdf:type schema:CreativeWork
    159 https://doi.org/10.1145/28395.28409 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037335279
    160 rdf:type schema:CreativeWork
    161 https://doi.org/10.1145/322217.322230 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010875099
    162 rdf:type schema:CreativeWork
    163 https://doi.org/10.1145/346048.346051 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005765514
    164 rdf:type schema:CreativeWork
    165 https://www.grid.ac/institutes/grid.473477.4 schema:alternateName École Nationale Supérieure des Mines de Nancy
    166 schema:name Loria-INPL, École Nationale Supérieure des Mines de Nancy, B.P. 239, 54506, Vandœuvre-lès-Nancy Cedex, France
    167 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...