[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/DemetrescuI00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Camil_Demetrescu>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Giuseppe_F._Italiano>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.2000.892126>
foaf:homepage <https://doi.org/10.1109/SFCS.2000.892126>
dc:identifier DBLP conf/focs/DemetrescuI00 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.2000.892126 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
rdfs:label Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Camil_Demetrescu>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Giuseppe_F._Italiano>
swrc:pages 381-389 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/2000>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/DemetrescuI00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/DemetrescuI00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs2000.html#DemetrescuI00>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.2000.892126>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject directed graphs; polynomials; matrix multiplication; computational complexity; randomised algorithms; deterministic algorithms; fully dynamic transitive closure; polynomials; matrix multiplication; deterministic algorithm; directed graphs; unit worst-case cost; queries; amortized time; directed acyclic graphs; single-operation complexity; subquadratic algorithm; randomized algorithm (xsd:string)
dc:title Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document