# https://id.confref.org/data/confref-portal/event/wdag2004 (confref labs, beta)
@prefix cr: <https://id.confref.org/ontology/> .
@prefix portal: <https://id.confref.org/data/confref-portal/vocab/> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix schema: <http://schema.org/> .
@prefix wd: <http://www.wikidata.org/entity/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://id.confref.org/data/confref-portal/event/wdag2004>
    a portal:Conference ;
    schema:location wd:Q29999 ;
    rdfs:label "International Symposium on Distributed Computing (DISC) / Workshop on Distributed Algorithms (WDAG)" ;
    portal:acronym "WDAG" ;
    portal:area <https://id.confref.org/data/confref-portal/area/2> ;
    portal:city "Amsterdam" ;
    portal:country "The Netherlands" ;
    portal:endDate "2004-10-07"^^xsd:date ;
    portal:keyword "$Diamond {cal P}$" ,
        "$Diamond {cal S}$" ,
        "Agreement problem" ,
        "Asynchronous distributed system" ,
        "Byzantine Failures" ,
        "Computational Power" ,
        "Consensus" ,
        "Early deciding" ,
        "Input vector" ,
        "One-Shot Problem" ,
        "Process Crash" ,
        "Process crash failure" ,
        "Secret sharing" ,
        "chordality" ,
        "compact routing" ,
        "condition" ,
        "message passing" ,
        "optimal detection latency" ,
        "optimal message complexity" ,
        "quiescence detection" ;
    portal:name "International Symposium on Distributed Computing (DISC) / Workshop on Distributed Algorithms (WDAG)" ;
    portal:portalPage <http://portal.confref.org/list/wdag2004> ;
    portal:series <https://id.confref.org/data/confref-portal/series/wdag> ;
    portal:startDate "2004-10-04"^^xsd:date ;
    portal:submissionExtended "false"^^xsd:boolean ;
    portal:year "2004"^^xsd:integer ;
    cr:discipline wd:Q21198 ;
    cr:field <https://id.confref.org/data/oecd-fos/1.2> ;
    cr:sameAs <https://dblp.org/db/conf/wdag/disc2004> ,
        <https://id.confref.org/data/confident/35093> .