Byzantine disk paxos: optimal resilience with byzantine shared memory View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2005-11-17

AUTHORS

Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi

ABSTRACT

We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n < 3t disks, t of which may fail by becoming non-responsive or arbitrarily corrupted. We give two constructions of this algorithm; that is, we construct two different t-tolerant (i.e., tolerating up to t disk failures) building blocks, each of which can be used, along with a leader oracle, to solve consensus. One building block is a t-tolerant wait-free shared safe register. The second building block is a t-tolerant regular register that satisfies a weaker termination (liveness) condition than wait freedom: its write operations are wait-free, whereas its read operations are guaranteed to return only in executions with a finite number of writes. We call this termination condition finite writes (FW), and show that wait-free consensus is solvable with FW-terminating registers and a leader oracle. We construct each of these t-tolerant registers from n < 3t base registers, t of which can be non-responsive or Byzantine. All the previous t-tolerant wait-free constructions in this model used at least 4t + 1 fault-prone registers, and we are not familiar with any prior FW-terminating constructions in this model.We further show tight lower bounds on the number of invocation rounds required for optimal resilience reliable register constructions, or more generally, constructions that use less than 4t + 1 fault-prone registers. Our lower bounds show that such constructions are inherently more costly than constructions that use 4t + 1 registers, and that our constructions have optimal round complexity. Furthermore, our wait-free construction is early-stopping, and it achieves the optimal round complexity with any number of actual failures. More... »

PAGES

387-408

References to SciGraph publications

  • 2002-10-24. Failure Detection Lower Bounds on Registers and Consensus in DISTRIBUTED COMPUTING
  • 2003-02. Disk Paxos in DISTRIBUTED COMPUTING
  • 1994. Using failure detectors to solve consensus in asynchronous shared-memory systems in DISTRIBUTED ALGORITHMS
  • 2002-10-24. Minimal Byzantine Storage in DISTRIBUTED COMPUTING
  • 1998-10. Byzantine quorum systems in DISTRIBUTED COMPUTING
  • 2000-01. Synchronous Byzantine quorum systems in DISTRIBUTED COMPUTING
  • 2005. A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems in PEER-TO-PEER SYSTEMS III
  • 1986-06. On interprocess communication in DISTRIBUTED COMPUTING
  • 2003. On the Cost of Fault-Tolerant Consensus When There Are No Faults – A Tutorial in DEPENDABLE COMPUTING
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00446-005-0151-6

    DOI

    http://dx.doi.org/10.1007/s00446-005-0151-6

    DIMENSIONS

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


    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/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0805", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Distributed Computing", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem", 
              "id": "http://www.grid.ac/institutes/grid.9619.7", 
              "name": [
                "School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Abraham", 
            "givenName": "Ittai", 
            "id": "sg:person.010044505623.30", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010044505623.30"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Lab for Computer Science and Artificial Intelligence, Massachusetts Institute of Technology, Massachusetts", 
              "id": "http://www.grid.ac/institutes/grid.116068.8", 
              "name": [
                "Lab for Computer Science and Artificial Intelligence, Massachusetts Institute of Technology, Massachusetts"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Chockler", 
            "givenName": "Gregory", 
            "id": "sg:person.015624006737.84", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015624006737.84"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Electrical Engineering, The Technion \u2013 Israel Institute of Technology, Israel", 
              "id": "http://www.grid.ac/institutes/grid.6451.6", 
              "name": [
                "Department of Electrical Engineering, The Technion \u2013 Israel Institute of Technology, Israel"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Keidar", 
            "givenName": "Idit", 
            "id": "sg:person.07674464077.03", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07674464077.03"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem", 
              "id": "http://www.grid.ac/institutes/grid.9619.7", 
              "name": [
                "School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Malkhi", 
            "givenName": "Dahlia", 
            "id": "sg:person.014562446521.28", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014562446521.28"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/s00446-002-0070-8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1039385238", 
              "https://doi.org/10.1007/s00446-002-0070-8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-45214-0_29", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030375458", 
              "https://doi.org/10.1007/978-3-540-45214-0_29"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s004460050004", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046076846", 
              "https://doi.org/10.1007/s004460050004"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01786228", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009069732", 
              "https://doi.org/10.1007/bf01786228"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-36108-1_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010326403", 
              "https://doi.org/10.1007/3-540-36108-1_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-36108-1_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046503607", 
              "https://doi.org/10.1007/3-540-36108-1_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s004460050050", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032075601", 
              "https://doi.org/10.1007/s004460050050"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-30183-7_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019437652", 
              "https://doi.org/10.1007/978-3-540-30183-7_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0020440", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017848770", 
              "https://doi.org/10.1007/bfb0020440"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2005-11-17", 
        "datePublishedReg": "2005-11-17", 
        "description": "We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n < 3t disks, t of which may fail by becoming non-responsive or arbitrarily corrupted. We give two constructions of this algorithm; that is, we construct two different t-tolerant (i.e., tolerating up to t disk failures) building blocks, each of which can be used, along with a leader oracle, to solve consensus. One building block is a t-tolerant wait-free shared safe register. The second building block is a t-tolerant regular register that satisfies a weaker termination (liveness) condition than wait freedom: its write operations are wait-free, whereas its read operations are guaranteed to return only in executions with a finite number of writes. We call this termination condition finite writes (FW), and show that wait-free consensus is solvable with FW-terminating registers and a leader oracle. We construct each of these t-tolerant registers from n < 3t base registers, t of which can be non-responsive or Byzantine. All the previous t-tolerant wait-free constructions in this model used at least 4t + 1 fault-prone registers, and we are not familiar with any prior FW-terminating constructions in this model.We further show tight lower bounds on the number of invocation rounds required for optimal resilience reliable register constructions, or more generally, constructions that use less than 4t + 1 fault-prone registers. Our lower bounds show that such constructions are inherently more costly than constructions that use 4t + 1 registers, and that our constructions have optimal round complexity. Furthermore, our wait-free construction is early-stopping, and it achieves the optimal round complexity with any number of actual failures.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s00446-005-0151-6", 
        "inLanguage": "en", 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1052621", 
            "issn": [
              "0178-2770", 
              "1432-0452"
            ], 
            "name": "Distributed Computing", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "5", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "18"
          }
        ], 
        "keywords": [
          "read operation", 
          "actual failure", 
          "construction", 
          "building blocks", 
          "write operation", 
          "operation", 
          "consensus algorithm", 
          "algorithm", 
          "disk", 
          "block", 
          "Register", 
          "termination condition", 
          "conditions", 
          "freedom", 
          "finite number", 
          "write", 
          "model", 
          "FW", 
          "lower bounds", 
          "such constructions", 
          "consensus", 
          "safe registers", 
          "number", 
          "finite", 
          "tight lower bounds", 
          "bounds", 
          "round complexity", 
          "complexity", 
          "failure", 
          "collection", 
          "leader oracle", 
          "oracle", 
          "second building block", 
          "execution", 
          "base register", 
          "rounds", 
          "optimal resilience", 
          "resilience", 
          "memory", 
          "Paxos", 
          "regular register", 
          "Byzantine", 
          "Byzantine Disk Paxos", 
          "Disk Paxos", 
          "asynchronous shared-memory consensus algorithm", 
          "shared-memory consensus algorithm", 
          "tolerant (i.e., tolerating up to t disk failures) building blocks", 
          "tolerant regular register", 
          "weaker termination (liveness) condition", 
          "termination condition finite", 
          "condition finite", 
          "wait-free consensus", 
          "FW-terminating registers", 
          "tolerant registers", 
          "tolerant wait-free constructions", 
          "wait-free constructions", 
          "fault-prone registers", 
          "prior FW", 
          "invocation rounds", 
          "optimal resilience reliable register constructions", 
          "resilience reliable register constructions", 
          "reliable register constructions", 
          "register constructions", 
          "optimal round complexity"
        ], 
        "name": "Byzantine disk paxos: optimal resilience with byzantine shared memory", 
        "pagination": "387-408", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1002402381"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00446-005-0151-6"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00446-005-0151-6", 
          "https://app.dimensions.ai/details/publication/pub.1002402381"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-01-01T18:14", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/article/article_398.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s00446-005-0151-6"
      }
    ]
     

    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/s00446-005-0151-6'

    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/s00446-005-0151-6'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00446-005-0151-6'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00446-005-0151-6'


     

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

    185 TRIPLES      22 PREDICATES      98 URIs      81 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00446-005-0151-6 schema:about anzsrc-for:08
    2 anzsrc-for:0805
    3 schema:author N30185326cff44dec824139d178d5daff
    4 schema:citation sg:pub.10.1007/3-540-36108-1_16
    5 sg:pub.10.1007/3-540-36108-1_21
    6 sg:pub.10.1007/978-3-540-30183-7_2
    7 sg:pub.10.1007/978-3-540-45214-0_29
    8 sg:pub.10.1007/bf01786228
    9 sg:pub.10.1007/bfb0020440
    10 sg:pub.10.1007/s00446-002-0070-8
    11 sg:pub.10.1007/s004460050004
    12 sg:pub.10.1007/s004460050050
    13 schema:datePublished 2005-11-17
    14 schema:datePublishedReg 2005-11-17
    15 schema:description We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n < 3t disks, t of which may fail by becoming non-responsive or arbitrarily corrupted. We give two constructions of this algorithm; that is, we construct two different t-tolerant (i.e., tolerating up to t disk failures) building blocks, each of which can be used, along with a leader oracle, to solve consensus. One building block is a t-tolerant wait-free shared safe register. The second building block is a t-tolerant regular register that satisfies a weaker termination (liveness) condition than wait freedom: its write operations are wait-free, whereas its read operations are guaranteed to return only in executions with a finite number of writes. We call this termination condition finite writes (FW), and show that wait-free consensus is solvable with FW-terminating registers and a leader oracle. We construct each of these t-tolerant registers from n < 3t base registers, t of which can be non-responsive or Byzantine. All the previous t-tolerant wait-free constructions in this model used at least 4t + 1 fault-prone registers, and we are not familiar with any prior FW-terminating constructions in this model.We further show tight lower bounds on the number of invocation rounds required for optimal resilience reliable register constructions, or more generally, constructions that use less than 4t + 1 fault-prone registers. Our lower bounds show that such constructions are inherently more costly than constructions that use 4t + 1 registers, and that our constructions have optimal round complexity. Furthermore, our wait-free construction is early-stopping, and it achieves the optimal round complexity with any number of actual failures.
    16 schema:genre article
    17 schema:inLanguage en
    18 schema:isAccessibleForFree true
    19 schema:isPartOf N347dcdba39ea4c7980ad74f498216bce
    20 N59ef44ebfb9a4ed289406e759d38737c
    21 sg:journal.1052621
    22 schema:keywords Byzantine
    23 Byzantine Disk Paxos
    24 Disk Paxos
    25 FW
    26 FW-terminating registers
    27 Paxos
    28 Register
    29 actual failure
    30 algorithm
    31 asynchronous shared-memory consensus algorithm
    32 base register
    33 block
    34 bounds
    35 building blocks
    36 collection
    37 complexity
    38 condition finite
    39 conditions
    40 consensus
    41 consensus algorithm
    42 construction
    43 disk
    44 execution
    45 failure
    46 fault-prone registers
    47 finite
    48 finite number
    49 freedom
    50 invocation rounds
    51 leader oracle
    52 lower bounds
    53 memory
    54 model
    55 number
    56 operation
    57 optimal resilience
    58 optimal resilience reliable register constructions
    59 optimal round complexity
    60 oracle
    61 prior FW
    62 read operation
    63 register constructions
    64 regular register
    65 reliable register constructions
    66 resilience
    67 resilience reliable register constructions
    68 round complexity
    69 rounds
    70 safe registers
    71 second building block
    72 shared-memory consensus algorithm
    73 such constructions
    74 termination condition
    75 termination condition finite
    76 tight lower bounds
    77 tolerant (i.e., tolerating up to t disk failures) building blocks
    78 tolerant registers
    79 tolerant regular register
    80 tolerant wait-free constructions
    81 wait-free consensus
    82 wait-free constructions
    83 weaker termination (liveness) condition
    84 write
    85 write operation
    86 schema:name Byzantine disk paxos: optimal resilience with byzantine shared memory
    87 schema:pagination 387-408
    88 schema:productId N5ca61b973599473dbd3400b9d44539cb
    89 N758be11857d04dd3bc30aba658799dcd
    90 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002402381
    91 https://doi.org/10.1007/s00446-005-0151-6
    92 schema:sdDatePublished 2022-01-01T18:14
    93 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    94 schema:sdPublisher N8206eb92ab50470b99c5045ab330d94d
    95 schema:url https://doi.org/10.1007/s00446-005-0151-6
    96 sgo:license sg:explorer/license/
    97 sgo:sdDataset articles
    98 rdf:type schema:ScholarlyArticle
    99 N0c99a18723104177bd1ed30c826d6b68 rdf:first sg:person.014562446521.28
    100 rdf:rest rdf:nil
    101 N30185326cff44dec824139d178d5daff rdf:first sg:person.010044505623.30
    102 rdf:rest N82d54c48156a4088b2014bdfe4f84a5c
    103 N347dcdba39ea4c7980ad74f498216bce schema:volumeNumber 18
    104 rdf:type schema:PublicationVolume
    105 N59ef44ebfb9a4ed289406e759d38737c schema:issueNumber 5
    106 rdf:type schema:PublicationIssue
    107 N5ca61b973599473dbd3400b9d44539cb schema:name doi
    108 schema:value 10.1007/s00446-005-0151-6
    109 rdf:type schema:PropertyValue
    110 N758be11857d04dd3bc30aba658799dcd schema:name dimensions_id
    111 schema:value pub.1002402381
    112 rdf:type schema:PropertyValue
    113 N8206eb92ab50470b99c5045ab330d94d schema:name Springer Nature - SN SciGraph project
    114 rdf:type schema:Organization
    115 N82d54c48156a4088b2014bdfe4f84a5c rdf:first sg:person.015624006737.84
    116 rdf:rest Ne80b615f96fe4b8d86911907e88230af
    117 Ne80b615f96fe4b8d86911907e88230af rdf:first sg:person.07674464077.03
    118 rdf:rest N0c99a18723104177bd1ed30c826d6b68
    119 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    120 schema:name Information and Computing Sciences
    121 rdf:type schema:DefinedTerm
    122 anzsrc-for:0805 schema:inDefinedTermSet anzsrc-for:
    123 schema:name Distributed Computing
    124 rdf:type schema:DefinedTerm
    125 sg:journal.1052621 schema:issn 0178-2770
    126 1432-0452
    127 schema:name Distributed Computing
    128 schema:publisher Springer Nature
    129 rdf:type schema:Periodical
    130 sg:person.010044505623.30 schema:affiliation grid-institutes:grid.9619.7
    131 schema:familyName Abraham
    132 schema:givenName Ittai
    133 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010044505623.30
    134 rdf:type schema:Person
    135 sg:person.014562446521.28 schema:affiliation grid-institutes:grid.9619.7
    136 schema:familyName Malkhi
    137 schema:givenName Dahlia
    138 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014562446521.28
    139 rdf:type schema:Person
    140 sg:person.015624006737.84 schema:affiliation grid-institutes:grid.116068.8
    141 schema:familyName Chockler
    142 schema:givenName Gregory
    143 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015624006737.84
    144 rdf:type schema:Person
    145 sg:person.07674464077.03 schema:affiliation grid-institutes:grid.6451.6
    146 schema:familyName Keidar
    147 schema:givenName Idit
    148 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07674464077.03
    149 rdf:type schema:Person
    150 sg:pub.10.1007/3-540-36108-1_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010326403
    151 https://doi.org/10.1007/3-540-36108-1_16
    152 rdf:type schema:CreativeWork
    153 sg:pub.10.1007/3-540-36108-1_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046503607
    154 https://doi.org/10.1007/3-540-36108-1_21
    155 rdf:type schema:CreativeWork
    156 sg:pub.10.1007/978-3-540-30183-7_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019437652
    157 https://doi.org/10.1007/978-3-540-30183-7_2
    158 rdf:type schema:CreativeWork
    159 sg:pub.10.1007/978-3-540-45214-0_29 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030375458
    160 https://doi.org/10.1007/978-3-540-45214-0_29
    161 rdf:type schema:CreativeWork
    162 sg:pub.10.1007/bf01786228 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009069732
    163 https://doi.org/10.1007/bf01786228
    164 rdf:type schema:CreativeWork
    165 sg:pub.10.1007/bfb0020440 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017848770
    166 https://doi.org/10.1007/bfb0020440
    167 rdf:type schema:CreativeWork
    168 sg:pub.10.1007/s00446-002-0070-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039385238
    169 https://doi.org/10.1007/s00446-002-0070-8
    170 rdf:type schema:CreativeWork
    171 sg:pub.10.1007/s004460050004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046076846
    172 https://doi.org/10.1007/s004460050004
    173 rdf:type schema:CreativeWork
    174 sg:pub.10.1007/s004460050050 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032075601
    175 https://doi.org/10.1007/s004460050050
    176 rdf:type schema:CreativeWork
    177 grid-institutes:grid.116068.8 schema:alternateName Lab for Computer Science and Artificial Intelligence, Massachusetts Institute of Technology, Massachusetts
    178 schema:name Lab for Computer Science and Artificial Intelligence, Massachusetts Institute of Technology, Massachusetts
    179 rdf:type schema:Organization
    180 grid-institutes:grid.6451.6 schema:alternateName Department of Electrical Engineering, The Technion – Israel Institute of Technology, Israel
    181 schema:name Department of Electrical Engineering, The Technion – Israel Institute of Technology, Israel
    182 rdf:type schema:Organization
    183 grid-institutes:grid.9619.7 schema:alternateName School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem
    184 schema:name School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem
    185 rdf:type schema:Organization
     




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


    ...